./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:23:05,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:23:05,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:23:05,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:23:05,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:23:05,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:23:05,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:23:05,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:23:05,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:23:05,480 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:23:05,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:23:05,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:23:05,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:23:05,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:23:05,483 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:23:05,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:23:05,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:23:05,484 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:23:05,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:23:05,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:23:05,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:23:05,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:23:05,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:23:05,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:23:05,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:23:05,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:23:05,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:23:05,488 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:23:05,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:23:05,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:23:05,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:23:05,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:23:05,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:23:05,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:23:05,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:23:05,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:23:05,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:23:05,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:23:05,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:23:05,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:23:05,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:23:05,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:23:05,492 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2024-11-22 13:23:05,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:23:05,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:23:05,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:23:05,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:23:05,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:23:05,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-22 13:23:07,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:23:07,243 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:23:07,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-22 13:23:07,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56b6681fd/3a1a9bef66f14ecb8e4cd7f0538af2d9/FLAG9e21ca8cf [2024-11-22 13:23:07,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56b6681fd/3a1a9bef66f14ecb8e4cd7f0538af2d9 [2024-11-22 13:23:07,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:23:07,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:23:07,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:23:07,622 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:23:07,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:23:07,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:23:07" (1/1) ... [2024-11-22 13:23:07,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231d38a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:07, skipping insertion in model container [2024-11-22 13:23:07,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:23:07" (1/1) ... [2024-11-22 13:23:07,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:23:07,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2024-11-22 13:23:07,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:23:08,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:23:08,010 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2024-11-22 13:23:08,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:23:08,045 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:23:08,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08 WrapperNode [2024-11-22 13:23:08,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:23:08,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:23:08,047 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:23:08,047 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:23:08,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,087 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 351 [2024-11-22 13:23:08,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:23:08,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:23:08,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:23:08,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:23:08,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,102 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,116 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-22 13:23:08,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,117 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,135 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:23:08,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:23:08,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:23:08,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:23:08,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (1/1) ... [2024-11-22 13:23:08,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:23:08,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:08,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:23:08,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:23:08,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:23:08,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-22 13:23:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-22 13:23:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 13:23:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 13:23:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-22 13:23:08,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-22 13:23:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 13:23:08,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 13:23:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-22 13:23:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-22 13:23:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:23:08,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:23:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 13:23:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 13:23:08,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:23:08,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:23:08,319 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:23:08,320 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:23:08,597 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2024-11-22 13:23:08,598 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:23:08,607 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:23:08,608 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:23:08,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:08 BoogieIcfgContainer [2024-11-22 13:23:08,608 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:23:08,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:23:08,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:23:08,613 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:23:08,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:23:07" (1/3) ... [2024-11-22 13:23:08,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2958be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:23:08, skipping insertion in model container [2024-11-22 13:23:08,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:08" (2/3) ... [2024-11-22 13:23:08,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f2958be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:23:08, skipping insertion in model container [2024-11-22 13:23:08,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:08" (3/3) ... [2024-11-22 13:23:08,615 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-22 13:23:08,629 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:23:08,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:23:08,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:23:08,687 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@736c2040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:23:08,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:23:08,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:08,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 13:23:08,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:08,702 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:08,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:08,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1156031742, now seen corresponding path program 1 times [2024-11-22 13:23:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:08,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434808995] [2024-11-22 13:23:08,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-22 13:23:08,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:08,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434808995] [2024-11-22 13:23:08,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434808995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:23:08,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604497480] [2024-11-22 13:23:08,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:08,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:08,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:08,948 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) [2024-11-22 13:23:08,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 13:23:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:09,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:23:09,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-22 13:23:09,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:09,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604497480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:09,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:23:09,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:23:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202626379] [2024-11-22 13:23:09,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:09,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:23:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:09,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:23:09,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:23:09,124 INFO L87 Difference]: Start difference. First operand has 76 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 13:23:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:09,140 INFO L93 Difference]: Finished difference Result 145 states and 213 transitions. [2024-11-22 13:23:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:23:09,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 62 [2024-11-22 13:23:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:09,149 INFO L225 Difference]: With dead ends: 145 [2024-11-22 13:23:09,149 INFO L226 Difference]: Without dead ends: 72 [2024-11-22 13:23:09,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:23:09,153 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:09,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-22 13:23:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-22 13:23:09,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:09,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2024-11-22 13:23:09,240 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 62 [2024-11-22 13:23:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:09,241 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2024-11-22 13:23:09,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 13:23:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2024-11-22 13:23:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 13:23:09,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:09,247 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:09,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 13:23:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:23:09,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1779963588, now seen corresponding path program 1 times [2024-11-22 13:23:09,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:09,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797796492] [2024-11-22 13:23:09,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:09,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:09,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797796492] [2024-11-22 13:23:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797796492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:09,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:23:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609612080] [2024-11-22 13:23:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:09,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:23:09,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:09,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:23:09,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:23:09,692 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:09,732 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-22 13:23:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:23:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-22 13:23:09,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:09,735 INFO L225 Difference]: With dead ends: 144 [2024-11-22 13:23:09,735 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 13:23:09,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:23:09,736 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:09,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 13:23:09,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-22 13:23:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-22 13:23:09,751 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 62 [2024-11-22 13:23:09,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:09,753 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-22 13:23:09,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:09,753 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-22 13:23:09,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 13:23:09,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:09,756 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:09,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:23:09,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:09,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:09,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1813939130, now seen corresponding path program 1 times [2024-11-22 13:23:09,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:09,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324172810] [2024-11-22 13:23:09,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:09,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 13:23:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324172810] [2024-11-22 13:23:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324172810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:23:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431129484] [2024-11-22 13:23:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:10,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:10,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:10,302 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) [2024-11-22 13:23:10,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:23:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:10,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:23:10,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:10,438 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:10,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:10,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431129484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:10,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:23:10,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-22 13:23:10,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630116940] [2024-11-22 13:23:10,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:10,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:23:10,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:10,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:23:10,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:23:10,441 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:10,459 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2024-11-22 13:23:10,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:23:10,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-22 13:23:10,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:10,461 INFO L225 Difference]: With dead ends: 148 [2024-11-22 13:23:10,461 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 13:23:10,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:23:10,462 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:10,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 13:23:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2024-11-22 13:23:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 104 transitions. [2024-11-22 13:23:10,467 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 104 transitions. Word has length 62 [2024-11-22 13:23:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:10,468 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 104 transitions. [2024-11-22 13:23:10,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 104 transitions. [2024-11-22 13:23:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 13:23:10,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:10,469 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:10,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 13:23:10,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-22 13:23:10,670 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:10,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1133880760, now seen corresponding path program 1 times [2024-11-22 13:23:10,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151696457] [2024-11-22 13:23:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:10,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 13:23:10,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:10,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151696457] [2024-11-22 13:23:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151696457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:23:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670398180] [2024-11-22 13:23:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:10,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:10,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:10,992 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:23:10,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:23:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:11,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:23:11,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:11,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670398180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:23:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-22 13:23:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992614950] [2024-11-22 13:23:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:11,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:23:11,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:23:11,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:23:11,165 INFO L87 Difference]: Start difference. First operand 76 states and 104 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:11,189 INFO L93 Difference]: Finished difference Result 152 states and 209 transitions. [2024-11-22 13:23:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:23:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-22 13:23:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:11,193 INFO L225 Difference]: With dead ends: 152 [2024-11-22 13:23:11,193 INFO L226 Difference]: Without dead ends: 79 [2024-11-22 13:23:11,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:23:11,194 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:11,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 282 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-22 13:23:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-11-22 13:23:11,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.352112676056338) internal successors, (96), 71 states have internal predecessors, (96), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 106 transitions. [2024-11-22 13:23:11,203 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 106 transitions. Word has length 62 [2024-11-22 13:23:11,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:11,205 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 106 transitions. [2024-11-22 13:23:11,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2024-11-22 13:23:11,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 13:23:11,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:11,206 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:11,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 13:23:11,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:11,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:11,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:11,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1132033718, now seen corresponding path program 1 times [2024-11-22 13:23:11,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:11,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823368511] [2024-11-22 13:23:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:11,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 13:23:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823368511] [2024-11-22 13:23:11,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823368511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:23:11,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809804750] [2024-11-22 13:23:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:11,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:11,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:23:11,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 13:23:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:11,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 13:23:11,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:11,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-22 13:23:12,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:23:12,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-22 13:23:12,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:23:12,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 13:23:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:12,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809804750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:23:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-11-22 13:23:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545714203] [2024-11-22 13:23:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:12,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:23:12,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:12,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:23:12,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-22 13:23:12,348 INFO L87 Difference]: Start difference. First operand 78 states and 106 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:12,613 INFO L93 Difference]: Finished difference Result 235 states and 321 transitions. [2024-11-22 13:23:12,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:23:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 62 [2024-11-22 13:23:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:12,614 INFO L225 Difference]: With dead ends: 235 [2024-11-22 13:23:12,614 INFO L226 Difference]: Without dead ends: 160 [2024-11-22 13:23:12,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 13:23:12,615 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 111 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:12,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 328 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:23:12,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-22 13:23:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 103. [2024-11-22 13:23:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 13:23:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-11-22 13:23:12,624 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 62 [2024-11-22 13:23:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:12,625 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-11-22 13:23:12,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-11-22 13:23:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-22 13:23:12,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:12,626 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:12,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 13:23:12,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:12,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:12,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1248313765, now seen corresponding path program 1 times [2024-11-22 13:23:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091918191] [2024-11-22 13:23:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091918191] [2024-11-22 13:23:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091918191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:23:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447120896] [2024-11-22 13:23:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:13,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:23:13,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:23:13,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:23:13,235 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:13,347 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2024-11-22 13:23:13,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:23:13,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2024-11-22 13:23:13,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:13,350 INFO L225 Difference]: With dead ends: 180 [2024-11-22 13:23:13,350 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 13:23:13,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:23:13,351 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 124 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:13,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 250 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:23:13,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 13:23:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-22 13:23:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 13:23:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 141 transitions. [2024-11-22 13:23:13,366 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 141 transitions. Word has length 63 [2024-11-22 13:23:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:13,367 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 141 transitions. [2024-11-22 13:23:13,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 141 transitions. [2024-11-22 13:23:13,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 13:23:13,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:13,368 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:13,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:23:13,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:13,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:13,370 INFO L85 PathProgramCache]: Analyzing trace with hash -2085121383, now seen corresponding path program 1 times [2024-11-22 13:23:13,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:13,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377315421] [2024-11-22 13:23:13,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:13,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:13,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377315421] [2024-11-22 13:23:13,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377315421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:13,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 13:23:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119500512] [2024-11-22 13:23:13,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:13,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 13:23:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:13,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 13:23:13,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:23:13,931 INFO L87 Difference]: Start difference. First operand 105 states and 141 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 13:23:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:14,208 INFO L93 Difference]: Finished difference Result 233 states and 315 transitions. [2024-11-22 13:23:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:23:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 67 [2024-11-22 13:23:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:14,210 INFO L225 Difference]: With dead ends: 233 [2024-11-22 13:23:14,210 INFO L226 Difference]: Without dead ends: 156 [2024-11-22 13:23:14,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:23:14,212 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 327 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:14,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 211 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 13:23:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-22 13:23:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 126. [2024-11-22 13:23:14,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.345132743362832) internal successors, (152), 113 states have internal predecessors, (152), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 13:23:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 172 transitions. [2024-11-22 13:23:14,230 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 172 transitions. Word has length 67 [2024-11-22 13:23:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:14,230 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 172 transitions. [2024-11-22 13:23:14,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 13:23:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 172 transitions. [2024-11-22 13:23:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 13:23:14,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:14,234 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:14,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 13:23:14,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:14,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:14,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1013672813, now seen corresponding path program 1 times [2024-11-22 13:23:14,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:14,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756344802] [2024-11-22 13:23:14,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:14,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:14,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:23:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756344802] [2024-11-22 13:23:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756344802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:23:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353695750] [2024-11-22 13:23:14,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:14,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:23:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:23:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:23:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:23:14,466 INFO L87 Difference]: Start difference. First operand 126 states and 172 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:14,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:14,580 INFO L93 Difference]: Finished difference Result 262 states and 356 transitions. [2024-11-22 13:23:14,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:23:14,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 67 [2024-11-22 13:23:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:14,583 INFO L225 Difference]: With dead ends: 262 [2024-11-22 13:23:14,583 INFO L226 Difference]: Without dead ends: 164 [2024-11-22 13:23:14,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:23:14,584 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 147 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:14,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 254 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:23:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-22 13:23:14,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 130. [2024-11-22 13:23:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 117 states have (on average 1.3333333333333333) internal successors, (156), 117 states have internal predecessors, (156), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-22 13:23:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 176 transitions. [2024-11-22 13:23:14,602 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 176 transitions. Word has length 67 [2024-11-22 13:23:14,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:14,602 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 176 transitions. [2024-11-22 13:23:14,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 176 transitions. [2024-11-22 13:23:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 13:23:14,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:14,603 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:14,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 13:23:14,603 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:14,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1047048597, now seen corresponding path program 1 times [2024-11-22 13:23:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:23:14,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174422736] [2024-11-22 13:23:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:23:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:23:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230778961] [2024-11-22 13:23:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:14,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:14,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:14,664 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:23:14,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 13:23:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:23:14,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:23:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:23:14,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:23:14,947 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:23:14,948 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:23:14,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 13:23:15,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:23:15,153 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:15,229 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:23:15,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:23:15 BoogieIcfgContainer [2024-11-22 13:23:15,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:23:15,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:23:15,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:23:15,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:23:15,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:08" (3/4) ... [2024-11-22 13:23:15,238 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:23:15,239 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:23:15,240 INFO L158 Benchmark]: Toolchain (without parser) took 7621.21ms. Allocated memory was 178.3MB in the beginning and 318.8MB in the end (delta: 140.5MB). Free memory was 105.1MB in the beginning and 130.4MB in the end (delta: -25.4MB). Peak memory consumption was 116.6MB. Max. memory is 16.1GB. [2024-11-22 13:23:15,240 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 178.3MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:23:15,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.11ms. Allocated memory is still 178.3MB. Free memory was 104.9MB in the beginning and 145.2MB in the end (delta: -40.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-22 13:23:15,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.75ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 142.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 13:23:15,241 INFO L158 Benchmark]: Boogie Preprocessor took 46.94ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 137.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:23:15,241 INFO L158 Benchmark]: RCFGBuilder took 472.96ms. Allocated memory is still 178.3MB. Free memory was 137.9MB in the beginning and 110.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-22 13:23:15,241 INFO L158 Benchmark]: TraceAbstraction took 6625.51ms. Allocated memory was 178.3MB in the beginning and 318.8MB in the end (delta: 140.5MB). Free memory was 109.6MB in the beginning and 131.5MB in the end (delta: -21.9MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. [2024-11-22 13:23:15,241 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 318.8MB. Free memory was 131.5MB in the beginning and 130.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:23:15,243 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50ms. Allocated memory is still 178.3MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.11ms. Allocated memory is still 178.3MB. Free memory was 104.9MB in the beginning and 145.2MB in the end (delta: -40.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.75ms. Allocated memory is still 178.3MB. Free memory was 145.2MB in the beginning and 142.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.94ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 137.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 472.96ms. Allocated memory is still 178.3MB. Free memory was 137.9MB in the beginning and 110.6MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6625.51ms. Allocated memory was 178.3MB in the beginning and 318.8MB in the end (delta: 140.5MB). Free memory was 109.6MB in the beginning and 131.5MB in the end (delta: -21.9MB). Peak memory consumption was 118.6MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 318.8MB. Free memory was 131.5MB in the beginning and 130.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of shiftLeft at line 104. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L47] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L48] signed short int* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L49] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L50] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L51] double* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L52] signed short int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] signed long int* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L54] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L55] double last_1_WrapperStruct0_var_1_10 = 9.2; [L56] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L57] signed long int last_1_WrapperStruct0_var_1_14 = -16; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=0, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_1 [L98] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_12 [L100] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L101] EXPR WrapperStruct0.var_1_14 [L101] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L88] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L91] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L94] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L112] RET updateVariables() [L113] CALL step() [L61] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L62] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L65] (*(WrapperStruct0_var_1_12_Pointer)) = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L67] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L67] (*(WrapperStruct0_var_1_14_Pointer)) = (*(WrapperStruct0_var_1_12_Pointer)) [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L68] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] COND TRUE (10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer))) [L69] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] (*(WrapperStruct0_var_1_8_Pointer)) = ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))) [L71] (*(WrapperStruct0_var_1_9_Pointer)) = 64 [L72] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L72] (*(WrapperStruct0_var_1_10_Pointer)) = (*(WrapperStruct0_var_1_11_Pointer)) [L73] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L73] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) <= 16 [L74] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L74] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) [L104] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104-L105] return (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 712 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 712 mSDsluCounter, 1986 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1316 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 670 mSDtfsCounter, 743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=8, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 124 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 891 NumberOfCodeBlocks, 891 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 3654 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 436/480 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 13:23:15,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:23:17,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:23:17,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:23:17,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:23:17,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:23:17,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:23:17,293 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:23:17,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:23:17,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:23:17,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:23:17,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:23:17,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:23:17,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:23:17,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:23:17,295 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:23:17,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:23:17,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:23:17,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:23:17,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:23:17,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:23:17,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:23:17,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:23:17,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:23:17,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:23:17,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:23:17,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:23:17,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:23:17,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:23:17,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:23:17,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:23:17,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:23:17,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:23:17,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:23:17,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:23:17,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:23:17,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:23:17,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:23:17,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:23:17,304 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:23:17,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:23:17,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:23:17,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:23:17,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:23:17,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:23:17,306 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2024-11-22 13:23:17,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:23:17,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:23:17,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:23:17,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:23:17,608 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:23:17,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-22 13:23:18,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:23:19,192 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:23:19,192 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-22 13:23:19,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06200043/f08171e0301b41038dfb0b776fdfa83b/FLAG19967703e [2024-11-22 13:23:19,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06200043/f08171e0301b41038dfb0b776fdfa83b [2024-11-22 13:23:19,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:23:19,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:23:19,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:23:19,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:23:19,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:23:19,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a0e7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19, skipping insertion in model container [2024-11-22 13:23:19,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,251 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:23:19,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2024-11-22 13:23:19,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:23:19,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:23:19,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i[916,929] [2024-11-22 13:23:19,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:23:19,544 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:23:19,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19 WrapperNode [2024-11-22 13:23:19,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:23:19,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:23:19,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:23:19,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:23:19,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,639 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 337 [2024-11-22 13:23:19,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:23:19,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:23:19,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:23:19,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:23:19,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,680 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-22 13:23:19,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:23:19,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:23:19,719 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:23:19,719 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:23:19,720 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (1/1) ... [2024-11-22 13:23:19,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:23:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:23:19,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 13:23:19,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 13:23:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:23:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-22 13:23:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-22 13:23:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-22 13:23:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-22 13:23:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:23:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:23:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-22 13:23:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-22 13:23:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:23:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:23:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-22 13:23:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-22 13:23:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-22 13:23:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-22 13:23:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 13:23:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 13:23:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:23:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:23:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:23:19,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:23:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:23:19,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:23:19,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:23:19,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:23:19,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:23:19,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:23:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 13:23:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 13:23:19,936 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:23:19,937 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:23:20,400 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2024-11-22 13:23:20,400 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:23:20,410 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:23:20,410 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:23:20,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:20 BoogieIcfgContainer [2024-11-22 13:23:20,410 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:23:20,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:23:20,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:23:20,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:23:20,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:23:19" (1/3) ... [2024-11-22 13:23:20,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90b67df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:23:20, skipping insertion in model container [2024-11-22 13:23:20,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:23:19" (2/3) ... [2024-11-22 13:23:20,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90b67df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:23:20, skipping insertion in model container [2024-11-22 13:23:20,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:23:20" (3/3) ... [2024-11-22 13:23:20,416 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2024-11-22 13:23:20,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:23:20,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:23:20,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:23:20,477 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@475eb5c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:23:20,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:23:20,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 13:23:20,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:20,498 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:20,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:20,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash -562539789, now seen corresponding path program 1 times [2024-11-22 13:23:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:23:20,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217773939] [2024-11-22 13:23:20,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:20,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:20,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:23:20,520 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:23:20,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 13:23:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:20,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:23:20,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:20,790 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-22 13:23:20,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:20,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:23:20,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217773939] [2024-11-22 13:23:20,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217773939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:20,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:20,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:23:20,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647894058] [2024-11-22 13:23:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:20,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:23:20,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:23:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:23:20,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:23:20,821 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.435483870967742) internal successors, (89), 63 states have internal predecessors, (89), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:20,837 INFO L93 Difference]: Finished difference Result 133 states and 197 transitions. [2024-11-22 13:23:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:23:20,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-22 13:23:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:20,844 INFO L225 Difference]: With dead ends: 133 [2024-11-22 13:23:20,844 INFO L226 Difference]: Without dead ends: 66 [2024-11-22 13:23:20,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:23:20,849 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:20,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-22 13:23:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-22 13:23:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-22 13:23:20,877 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 60 [2024-11-22 13:23:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:20,877 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-22 13:23:20,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-22 13:23:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 13:23:20,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:20,879 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:20,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 13:23:21,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:21,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:21,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash -830046663, now seen corresponding path program 1 times [2024-11-22 13:23:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:23:21,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760686764] [2024-11-22 13:23:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:21,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:21,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:23:21,089 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:23:21,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 13:23:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:21,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 13:23:21,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:21,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:21,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:23:21,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760686764] [2024-11-22 13:23:21,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760686764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:21,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:21,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:23:21,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220119850] [2024-11-22 13:23:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:21,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:23:21,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:23:21,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:23:21,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:23:21,316 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:21,368 INFO L93 Difference]: Finished difference Result 132 states and 185 transitions. [2024-11-22 13:23:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:23:21,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-22 13:23:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:21,372 INFO L225 Difference]: With dead ends: 132 [2024-11-22 13:23:21,374 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 13:23:21,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:23:21,375 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:21,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 256 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 13:23:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2024-11-22 13:23:21,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2024-11-22 13:23:21,391 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 60 [2024-11-22 13:23:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2024-11-22 13:23:21,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2024-11-22 13:23:21,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 13:23:21,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:21,394 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:21,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 13:23:21,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:21,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:21,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash -128982085, now seen corresponding path program 1 times [2024-11-22 13:23:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:23:21,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632566206] [2024-11-22 13:23:21,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:21,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:23:21,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:23:21,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 13:23:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:21,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 13:23:21,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:21,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:21,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:23:21,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632566206] [2024-11-22 13:23:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632566206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:21,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:21,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:23:21,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630156008] [2024-11-22 13:23:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:21,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:23:21,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:23:21,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:23:21,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:23:21,774 INFO L87 Difference]: Start difference. First operand 68 states and 94 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:21,808 INFO L93 Difference]: Finished difference Result 136 states and 189 transitions. [2024-11-22 13:23:21,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:23:21,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-22 13:23:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:21,810 INFO L225 Difference]: With dead ends: 136 [2024-11-22 13:23:21,810 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 13:23:21,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:23:21,811 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:21,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 333 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 13:23:21,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-11-22 13:23:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:21,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2024-11-22 13:23:21,816 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 60 [2024-11-22 13:23:21,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:21,816 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2024-11-22 13:23:21,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2024-11-22 13:23:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 13:23:21,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:21,817 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:21,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 13:23:22,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:22,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:22,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:22,019 INFO L85 PathProgramCache]: Analyzing trace with hash 551076285, now seen corresponding path program 1 times [2024-11-22 13:23:22,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:23:22,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1118852718] [2024-11-22 13:23:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:22,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:23:22,022 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:23:22,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 13:23:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:22,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 13:23:22,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:22,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:23:22,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:23:22,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1118852718] [2024-11-22 13:23:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1118852718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:23:22,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:23:22,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 13:23:22,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924449038] [2024-11-22 13:23:22,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 13:23:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:23:22,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 13:23:22,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:23:22,221 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:22,266 INFO L93 Difference]: Finished difference Result 142 states and 196 transitions. [2024-11-22 13:23:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:23:22,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-22 13:23:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:22,267 INFO L225 Difference]: With dead ends: 142 [2024-11-22 13:23:22,267 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 13:23:22,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 13:23:22,268 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:22,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 479 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:23:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 13:23:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-22 13:23:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2024-11-22 13:23:22,273 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 60 [2024-11-22 13:23:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:22,273 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2024-11-22 13:23:22,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2024-11-22 13:23:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 13:23:22,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:22,274 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:22,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 13:23:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:22,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:22,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:22,476 INFO L85 PathProgramCache]: Analyzing trace with hash 552923327, now seen corresponding path program 1 times [2024-11-22 13:23:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:23:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1737040195] [2024-11-22 13:23:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:22,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:22,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:23:22,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:23:22,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-22 13:23:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:22,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-22 13:23:22,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:23,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 13:23:23,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-22 13:23:24,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2024-11-22 13:23:28,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-22 13:23:28,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2024-11-22 13:23:28,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2024-11-22 13:23:28,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 72 [2024-11-22 13:23:28,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 87 [2024-11-22 13:23:28,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:23:28,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 110 treesize of output 58 [2024-11-22 13:23:28,864 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 13:23:28,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:23:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-22 13:23:28,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:23:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1737040195] [2024-11-22 13:23:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1737040195] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 13:23:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:23:28,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-22 13:23:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382564328] [2024-11-22 13:23:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:23:28,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 13:23:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:23:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 13:23:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2024-11-22 13:23:28,962 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:29,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:23:29,281 INFO L93 Difference]: Finished difference Result 149 states and 202 transitions. [2024-11-22 13:23:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 13:23:29,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2024-11-22 13:23:29,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:23:29,283 INFO L225 Difference]: With dead ends: 149 [2024-11-22 13:23:29,283 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 13:23:29,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=44, Invalid=227, Unknown=1, NotChecked=0, Total=272 [2024-11-22 13:23:29,285 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 44 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:23:29,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 235 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:23:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 13:23:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2024-11-22 13:23:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 69 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-22 13:23:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-11-22 13:23:29,291 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 60 [2024-11-22 13:23:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:23:29,291 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-11-22 13:23:29,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-22 13:23:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-11-22 13:23:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 13:23:29,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:23:29,293 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:23:29,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 13:23:29,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:29,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:23:29,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:23:29,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1489190506, now seen corresponding path program 1 times [2024-11-22 13:23:29,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:23:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169277256] [2024-11-22 13:23:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:23:29,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 13:23:29,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:23:29,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 13:23:29,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-22 13:23:29,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:23:29,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-22 13:23:29,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:23:31,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2024-11-22 13:23:32,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 67 [2024-11-22 13:23:32,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 76 [2024-11-22 13:23:32,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 76 [2024-11-22 13:23:33,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 121 [2024-11-22 13:23:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 130 [2024-11-22 13:23:33,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:23:33,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 304 treesize of output 152 [2024-11-22 13:23:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 13:23:33,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:24:04,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:24:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169277256] [2024-11-22 13:24:04,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169277256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:24:04,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [603638869] [2024-11-22 13:24:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:24:04,040 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:24:04,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:24:04,044 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:24:04,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-22 13:24:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:24:04,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-22 13:24:05,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:24:08,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-22 13:24:11,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 71 [2024-11-22 13:24:11,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 80 [2024-11-22 13:24:11,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 80 [2024-11-22 13:24:12,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 125 [2024-11-22 13:24:12,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2024-11-22 13:24:14,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 86 [2024-11-22 13:24:14,222 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-22 13:24:14,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:24:43,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [603638869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:24:43,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:24:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2024-11-22 13:24:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846482959] [2024-11-22 13:24:43,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:24:43,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-22 13:24:43,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:24:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-22 13:24:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=737, Unknown=6, NotChecked=0, Total=870 [2024-11-22 13:24:43,526 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 24 states, 24 states have (on average 3.25) internal successors, (78), 23 states have internal predecessors, (78), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)