/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:35:26,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:35:26,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:35:26,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:35:26,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:35:26,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:35:26,133 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:35:26,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:35:26,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:35:26,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:35:26,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:35:26,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:35:26,144 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:35:26,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:35:26,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:35:26,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:35:26,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:35:26,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:35:26,151 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:35:26,154 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:35:26,156 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:35:26,156 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:35:26,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:35:26,157 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:35:26,158 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:35:26,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:35:26,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:35:26,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:35:26,163 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:35:26,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:35:26,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:35:26,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:35:26,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:35:26,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:35:26,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:35:26,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:35:26,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:35:26,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:35:26,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:35:26,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:35:26,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:35:26,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:35:26,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:35:26,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:35:26,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:35:26,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:35:26,178 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:35:26,178 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:35:26,178 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:35:26,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:35:26,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:35:26,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:35:26,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:35:26,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:35:26,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:35:26,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:35:26,180 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:35:26,180 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:35:26,180 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 19:35:26,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:35:26,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:35:26,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:35:26,345 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:35:26,345 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:35:26,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c [2022-04-07 19:35:26,383 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503d52436/9da5aca10e35450d89e57f0b5a24fa7a/FLAG432f39ac6 [2022-04-07 19:35:26,722 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:35:26,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c [2022-04-07 19:35:26,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503d52436/9da5aca10e35450d89e57f0b5a24fa7a/FLAG432f39ac6 [2022-04-07 19:35:27,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/503d52436/9da5aca10e35450d89e57f0b5a24fa7a [2022-04-07 19:35:27,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:35:27,181 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:35:27,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:35:27,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:35:27,185 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:35:27,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76dd258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27, skipping insertion in model container [2022-04-07 19:35:27,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:35:27,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:35:27,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c[525,538] [2022-04-07 19:35:27,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:35:27,316 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:35:27,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_valuebound20.c[525,538] [2022-04-07 19:35:27,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:35:27,334 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:35:27,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27 WrapperNode [2022-04-07 19:35:27,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:35:27,335 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:35:27,335 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:35:27,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:35:27,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:35:27,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:35:27,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:35:27,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:35:27,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:35:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:35:27,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 19:35:27,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 19:35:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:35:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:35:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:35:27,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:35:27,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:35:27,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:35:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:35:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:35:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:35:27,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:35:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 19:35:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:35:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:35:27,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:35:27,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:35:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:35:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:35:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:35:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:35:27,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:35:27,462 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:35:27,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:35:27,600 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:35:27,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:35:27,620 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 19:35:27,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:35:27 BoogieIcfgContainer [2022-04-07 19:35:27,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:35:27,622 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:35:27,622 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:35:27,627 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:35:27,629 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:35:27" (1/1) ... [2022-04-07 19:35:27,631 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:35:27,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:35:27 BasicIcfg [2022-04-07 19:35:27,651 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:35:27,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:35:27,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:35:27,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:35:27,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:35:27" (1/4) ... [2022-04-07 19:35:27,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107d5f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:35:27, skipping insertion in model container [2022-04-07 19:35:27,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:35:27" (2/4) ... [2022-04-07 19:35:27,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107d5f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:35:27, skipping insertion in model container [2022-04-07 19:35:27,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:35:27" (3/4) ... [2022-04-07 19:35:27,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107d5f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:35:27, skipping insertion in model container [2022-04-07 19:35:27,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:35:27" (4/4) ... [2022-04-07 19:35:27,656 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound20.cJordan [2022-04-07 19:35:27,659 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:35:27,659 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:35:27,687 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:35:27,691 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 19:35:27,692 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:35:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:35:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 19:35:27,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:35:27,711 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:35:27,712 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:35:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:35:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1338008438, now seen corresponding path program 1 times [2022-04-07 19:35:27,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:35:27,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558856674] [2022-04-07 19:35:27,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:35:27,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:35:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:27,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:35:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:27,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 19:35:27,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:35:27,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:35:27,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:35:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:27,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-07 19:35:27,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-07 19:35:27,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 19:35:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:27,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-07 19:35:27,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-07 19:35:27,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-07 19:35:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:27,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-07 19:35:27,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-07 19:35:27,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:35:27,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {34#true} is VALID [2022-04-07 19:35:27,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:35:27,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:35:27,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#true} is VALID [2022-04-07 19:35:27,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {34#true} is VALID [2022-04-07 19:35:27,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-07 19:35:27,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-07 19:35:27,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-07 19:35:27,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {35#false} is VALID [2022-04-07 19:35:27,895 INFO L272 TraceCheckUtils]: 12: Hoare triple {35#false} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {34#true} is VALID [2022-04-07 19:35:27,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-07 19:35:27,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,896 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {35#false} {35#false} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {35#false} is VALID [2022-04-07 19:35:27,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {35#false} is VALID [2022-04-07 19:35:27,896 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#true} is VALID [2022-04-07 19:35:27,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {34#true} is VALID [2022-04-07 19:35:27,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#true} [78] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,897 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {35#false} is VALID [2022-04-07 19:35:27,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {35#false} is VALID [2022-04-07 19:35:27,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} [84] L36-2-->L36-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,898 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} [87] L36-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~z~0_11 v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) (* v_main_~y~0_8 v_main_~az~0_6)) v_main_~a~0_10) 0) 1 0)) InVars {main_~az~0=v_main_~az~0_6, main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {35#false} is VALID [2022-04-07 19:35:27,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {35#false} is VALID [2022-04-07 19:35:27,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#false} is VALID [2022-04-07 19:35:27,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:35:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:35:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558856674] [2022-04-07 19:35:27,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558856674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:35:27,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:35:27,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:35:27,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187661911] [2022-04-07 19:35:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:35:27,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-07 19:35:27,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:35:27,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:35:27,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:35:27,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:35:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:35:27,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:35:27,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:35:27,944 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:35:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:28,055 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-07 19:35:28,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:35:28,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-07 19:35:28,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:35:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:35:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-07 19:35:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:35:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-07 19:35:28,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-07 19:35:28,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:35:28,102 INFO L225 Difference]: With dead ends: 31 [2022-04-07 19:35:28,103 INFO L226 Difference]: Without dead ends: 26 [2022-04-07 19:35:28,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:35:28,106 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:35:28,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:35:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-07 19:35:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-07 19:35:28,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:35:28,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 19:35:28,136 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 19:35:28,136 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 19:35:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:28,140 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 19:35:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 19:35:28,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:28,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:35:28,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-07 19:35:28,141 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 26 states. [2022-04-07 19:35:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:28,147 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-07 19:35:28,147 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 19:35:28,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:28,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:35:28,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:35:28,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:35:28,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-07 19:35:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-07 19:35:28,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 29 [2022-04-07 19:35:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:35:28,155 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-07 19:35:28,156 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:35:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-07 19:35:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 19:35:28,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:35:28,157 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:35:28,157 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:35:28,158 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:35:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:35:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1251333530, now seen corresponding path program 1 times [2022-04-07 19:35:28,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:35:28,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665898347] [2022-04-07 19:35:28,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:35:28,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:35:28,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:35:28,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931141961] [2022-04-07 19:35:28,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:35:28,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:35:28,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:35:28,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:35:28,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 19:35:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:28,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 19:35:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:28,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:35:28,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {163#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {163#true} is VALID [2022-04-07 19:35:28,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163#true} {163#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {163#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {163#true} is VALID [2022-04-07 19:35:28,481 INFO L272 TraceCheckUtils]: 6: Hoare triple {163#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {163#true} is VALID [2022-04-07 19:35:28,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {163#true} is VALID [2022-04-07 19:35:28,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,482 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {163#true} {163#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {163#true} is VALID [2022-04-07 19:35:28,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {163#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {163#true} is VALID [2022-04-07 19:35:28,484 INFO L272 TraceCheckUtils]: 12: Hoare triple {163#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {163#true} is VALID [2022-04-07 19:35:28,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {163#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {163#true} is VALID [2022-04-07 19:35:28,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {163#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {163#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,485 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {163#true} {163#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {163#true} is VALID [2022-04-07 19:35:28,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {163#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {163#true} is VALID [2022-04-07 19:35:28,486 INFO L272 TraceCheckUtils]: 18: Hoare triple {163#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {163#true} is VALID [2022-04-07 19:35:28,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {163#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {163#true} is VALID [2022-04-07 19:35:28,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {163#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {163#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#true} is VALID [2022-04-07 19:35:28,487 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {163#true} {163#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {163#true} is VALID [2022-04-07 19:35:28,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {163#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {237#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:28,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {237#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {237#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:28,489 INFO L272 TraceCheckUtils]: 25: Hoare triple {237#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {244#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:35:28,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {244#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {248#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:35:28,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {248#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {164#false} is VALID [2022-04-07 19:35:28,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {164#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {164#false} is VALID [2022-04-07 19:35:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:35:28,491 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:35:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:35:28,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665898347] [2022-04-07 19:35:28,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:35:28,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931141961] [2022-04-07 19:35:28,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931141961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:35:28,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:35:28,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:35:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207405369] [2022-04-07 19:35:28,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:35:28,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-07 19:35:28,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:35:28,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:35:28,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:35:28,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:35:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:35:28,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:35:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:35:28,526 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:35:28,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:28,646 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-07 19:35:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:35:28,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-07 19:35:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:35:28,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:35:28,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-07 19:35:28,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:35:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-04-07 19:35:28,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-04-07 19:35:28,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:35:28,686 INFO L225 Difference]: With dead ends: 34 [2022-04-07 19:35:28,686 INFO L226 Difference]: Without dead ends: 33 [2022-04-07 19:35:28,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:35:28,687 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:35:28,688 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:35:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-07 19:35:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-07 19:35:28,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:35:28,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:35:28,691 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:35:28,691 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:35:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:28,693 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 19:35:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 19:35:28,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:28,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:35:28,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-07 19:35:28,694 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-07 19:35:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:28,695 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-07 19:35:28,695 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 19:35:28,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:28,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:35:28,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:35:28,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:35:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-07 19:35:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-07 19:35:28,698 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-04-07 19:35:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:35:28,698 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-07 19:35:28,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-07 19:35:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-07 19:35:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:35:28,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:35:28,701 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:35:28,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 19:35:28,917 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:35:28,918 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:35:28,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:35:28,918 INFO L85 PathProgramCache]: Analyzing trace with hash -284720885, now seen corresponding path program 1 times [2022-04-07 19:35:28,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:35:28,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869626894] [2022-04-07 19:35:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:35:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:35:28,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:35:28,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081321652] [2022-04-07 19:35:28,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:35:28,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:35:28,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:35:28,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:35:28,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 19:35:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:28,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-07 19:35:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:35:28,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:35:29,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {389#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {389#true} is VALID [2022-04-07 19:35:29,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {389#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {389#true} is VALID [2022-04-07 19:35:29,207 INFO L272 TraceCheckUtils]: 6: Hoare triple {389#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:29,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {389#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {389#true} is VALID [2022-04-07 19:35:29,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {389#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {389#true} {389#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:29,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {389#true} is VALID [2022-04-07 19:35:29,209 INFO L272 TraceCheckUtils]: 12: Hoare triple {389#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {389#true} is VALID [2022-04-07 19:35:29,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {389#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {389#true} is VALID [2022-04-07 19:35:29,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {389#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {389#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,210 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {389#true} {389#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {389#true} is VALID [2022-04-07 19:35:29,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {389#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {389#true} is VALID [2022-04-07 19:35:29,211 INFO L272 TraceCheckUtils]: 18: Hoare triple {389#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:29,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {389#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {389#true} is VALID [2022-04-07 19:35:29,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {389#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {389#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:29,211 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {389#true} {389#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:29,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {389#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:29,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:29,212 INFO L272 TraceCheckUtils]: 25: Hoare triple {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {389#true} is VALID [2022-04-07 19:35:29,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {389#true} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {473#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:35:29,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {473#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [95] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {477#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:35:29,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {477#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:35:29,216 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {477#(not (= |__VERIFIER_assert_#in~cond| 0))} {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [104] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:29,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {463#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} [92] L37-1-->L36-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_8)) (< v_main_~c~0_5 v_main_~k~0_5) (= (+ v_main_~a~0_7 (* v_main_~x~0_7 v_main_~z~0_8)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_7} OutVars{main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {487#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:29,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {487#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {487#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-07 19:35:29,224 INFO L272 TraceCheckUtils]: 32: Hoare triple {487#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:35:29,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {494#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:35:29,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {498#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {390#false} is VALID [2022-04-07 19:35:29,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {390#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#false} is VALID [2022-04-07 19:35:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:35:29,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:35:37,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {390#false} [96] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {390#false} is VALID [2022-04-07 19:35:37,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {498#(<= 1 __VERIFIER_assert_~cond)} [94] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {390#false} is VALID [2022-04-07 19:35:37,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {494#(<= 1 |__VERIFIER_assert_#in~cond|)} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:35:37,594 INFO L272 TraceCheckUtils]: 32: Hoare triple {514#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:35:37,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {514#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {514#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-07 19:35:37,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {521#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} [92] L37-1-->L36-2: Formula: (and (= v_main_~c~0_4 (+ v_main_~c~0_5 1)) (= v_main_~y~0_5 (* v_main_~y~0_6 v_main_~z~0_8)) (< v_main_~c~0_5 v_main_~k~0_5) (= (+ v_main_~a~0_7 (* v_main_~x~0_7 v_main_~z~0_8)) v_main_~x~0_6)) InVars {main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_6, main_~c~0=v_main_~c~0_5, main_~a~0=v_main_~a~0_7} OutVars{main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_8, main_~k~0=v_main_~k~0_5, main_~y~0=v_main_~y~0_5, main_~c~0=v_main_~c~0_4, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_~c~0] {514#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-07 19:35:37,618 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {477#(not (= |__VERIFIER_assert_#in~cond| 0))} {389#true} [104] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {521#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-07 19:35:37,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {477#(not (= |__VERIFIER_assert_#in~cond| 0))} [98] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:35:37,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {534#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [95] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_1 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {477#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:35:37,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {389#true} [90] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {534#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:35:37,620 INFO L272 TraceCheckUtils]: 25: Hoare triple {389#true} [88] L37-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 1) v_main_~x~0_8) v_main_~a~0_9 (* v_main_~z~0_10 v_main_~x~0_8) (* (* v_main_~y~0_7 v_main_~az~0_5) (- 1))) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~az~0=v_main_~az~0_5, main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~az~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0, main_~a~0] {389#true} is VALID [2022-04-07 19:35:37,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {389#true} [86] L36-2-->L37: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {389#true} [83] L29-1-->L36-2: Formula: (and (= v_main_~a~0_5 v_main_~x~0_4) (= v_main_~c~0_2 1) (= (* v_main_~a~0_5 v_main_~z~0_6) v_main_~az~0_3) (= v_main_~y~0_3 1)) InVars {main_~z~0=v_main_~z~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~az~0=v_main_~az~0_3, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_6, main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~az~0, main_~x~0, main_~c~0, main_~y~0] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {389#true} {389#true} [102] assume_abort_if_notEXIT-->L29-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {389#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {389#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {389#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L272 TraceCheckUtils]: 18: Hoare triple {389#true} [82] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (and (<= 0 v_main_~k~0_6) (<= v_main_~k~0_6 20)) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:37,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {389#true} [80] L27-1-->L29: Formula: (and (<= |v_main_#t~nondet6_2| 2147483647) (<= 0 (+ |v_main_#t~nondet6_2| 2147483648)) (= v_main_~k~0_2 |v_main_#t~nondet6_2|)) InVars {main_#t~nondet6=|v_main_#t~nondet6_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet6, main_~k~0] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {389#true} {389#true} [101] assume_abort_if_notEXIT-->L27-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {389#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {389#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L290 TraceCheckUtils]: 13: Hoare triple {389#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L272 TraceCheckUtils]: 12: Hoare triple {389#true} [77] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~a~0_8) (<= v_main_~a~0_8 20)) 1 0)) InVars {main_~a~0=v_main_~a~0_8} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#true} [75] L25-1-->L27: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~a~0_3 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~a~0] {389#true} is VALID [2022-04-07 19:35:37,622 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {389#true} {389#true} [100] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#true} [81] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {389#true} [79] L12-->L12-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {389#true} [76] assume_abort_if_notENTRY-->L12: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L272 TraceCheckUtils]: 6: Hoare triple {389#true} [74] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~z~0_9) (<= v_main_~z~0_9 20)) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {389#true} [72] mainENTRY-->L25: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~z~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~az~0=v_main_~az~0_2, main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1, main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~az~0, main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0, main_~a~0] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {389#true} [69] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {389#true} {389#true} [99] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {389#true} [73] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {389#true} [70] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {389#true} is VALID [2022-04-07 19:35:37,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {389#true} [68] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {389#true} is VALID [2022-04-07 19:35:37,624 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-07 19:35:37,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:35:37,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869626894] [2022-04-07 19:35:37,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:35:37,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081321652] [2022-04-07 19:35:37,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081321652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:35:37,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:35:37,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-07 19:35:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87106095] [2022-04-07 19:35:37,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:35:37,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-04-07 19:35:37,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:35:37,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:35:37,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:35:37,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 19:35:37,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:35:37,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 19:35:37,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:35:37,701 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:35:39,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:39,246 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-07 19:35:39,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 19:35:39,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2022-04-07 19:35:39,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:35:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:35:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-07 19:35:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:35:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-07 19:35:39,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-07 19:35:41,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 37 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:35:41,487 INFO L225 Difference]: With dead ends: 35 [2022-04-07 19:35:41,487 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 19:35:41,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:35:41,488 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 19:35:41,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 19:35:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 19:35:41,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 19:35:41,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:35:41,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:35:41,489 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:35:41,489 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:35:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:41,489 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 19:35:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 19:35:41,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:41,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:35:41,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 19:35:41,490 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 19:35:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:35:41,490 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 19:35:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 19:35:41,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:41,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:35:41,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:35:41,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:35:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 19:35:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 19:35:41,490 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-04-07 19:35:41,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:35:41,491 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 19:35:41,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:35:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 19:35:41,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:35:41,495 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:35:41,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 19:35:41,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 19:35:41,706 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 19:35:41,707 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:35:41,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:35:41 BasicIcfg [2022-04-07 19:35:41,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:35:41,709 INFO L158 Benchmark]: Toolchain (without parser) took 14528.31ms. Allocated memory was 180.4MB in the beginning and 227.5MB in the end (delta: 47.2MB). Free memory was 128.3MB in the beginning and 193.6MB in the end (delta: -65.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:35:41,709 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:35:41,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.51ms. Allocated memory is still 180.4MB. Free memory was 128.2MB in the beginning and 155.5MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 19:35:41,710 INFO L158 Benchmark]: Boogie Preprocessor took 20.04ms. Allocated memory is still 180.4MB. Free memory was 155.5MB in the beginning and 154.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-07 19:35:41,710 INFO L158 Benchmark]: RCFGBuilder took 265.60ms. Allocated memory is still 180.4MB. Free memory was 154.0MB in the beginning and 142.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 19:35:41,710 INFO L158 Benchmark]: IcfgTransformer took 29.10ms. Allocated memory is still 180.4MB. Free memory was 142.5MB in the beginning and 140.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:35:41,710 INFO L158 Benchmark]: TraceAbstraction took 14056.71ms. Allocated memory was 180.4MB in the beginning and 227.5MB in the end (delta: 47.2MB). Free memory was 140.4MB in the beginning and 194.2MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:35:41,712 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 152.51ms. Allocated memory is still 180.4MB. Free memory was 128.2MB in the beginning and 155.5MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.04ms. Allocated memory is still 180.4MB. Free memory was 155.5MB in the beginning and 154.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 265.60ms. Allocated memory is still 180.4MB. Free memory was 154.0MB in the beginning and 142.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 29.10ms. Allocated memory is still 180.4MB. Free memory was 142.5MB in the beginning and 140.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 14056.71ms. Allocated memory was 180.4MB in the beginning and 227.5MB in the end (delta: 47.2MB). Free memory was 140.4MB in the beginning and 194.2MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 179 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 80 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 3 NumberOfNonLiveVariables, 209 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 52/56 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 19:35:41,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...