./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_loopvsstraightlinecode_100-while_file-55.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 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:11:43,547 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:11:43,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:11:43,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:11:43,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:11:43,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:11:43,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:11:43,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:11:43,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:11:43,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:11:43,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:11:43,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:11:43,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:11:43,676 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:11:43,676 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:11:43,677 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:11:43,677 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:11:43,677 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:11:43,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:11:43,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:11:43,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:11:43,682 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:11:43,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:11:43,684 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:11:43,684 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:11:43,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:11:43,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:11:43,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:11:43,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:11:43,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:11:43,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:11:43,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:11:43,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:11:43,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:11:43,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:11:43,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:11:43,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:11:43,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:11:43,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:11:43,690 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:11:43,690 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:11:43,690 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:11:43,690 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 -> 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d [2024-11-12 05:11:43,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:11:43,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:11:43,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:11:43,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:11:43,979 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:11:43,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-12 05:11:45,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:11:45,698 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:11:45,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-12 05:11:45,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a411501e0/425a90cb26dc43529680ea8122416c23/FLAG7efc45eac [2024-11-12 05:11:46,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a411501e0/425a90cb26dc43529680ea8122416c23 [2024-11-12 05:11:46,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:11:46,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:11:46,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:11:46,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:11:46,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:11:46,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307848ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46, skipping insertion in model container [2024-11-12 05:11:46,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:11:46,276 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-12 05:11:46,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:11:46,363 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:11:46,376 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-12 05:11:46,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:11:46,431 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:11:46,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46 WrapperNode [2024-11-12 05:11:46,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:11:46,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:11:46,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:11:46,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:11:46,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,507 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-12 05:11:46,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:11:46,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:11:46,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:11:46,509 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:11:46,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,547 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:11:46,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:11:46,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:11:46,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:11:46,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:11:46,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (1/1) ... [2024-11-12 05:11:46,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:11:46,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:11:46,614 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-12 05:11:46,617 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-12 05:11:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:11:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:11:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:11:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:11:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:11:46,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:11:46,778 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:11:46,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:11:47,257 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 05:11:47,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:11:47,273 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:11:47,273 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:11:47,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:47 BoogieIcfgContainer [2024-11-12 05:11:47,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:11:47,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:11:47,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:11:47,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:11:47,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:11:46" (1/3) ... [2024-11-12 05:11:47,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388dffa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:47, skipping insertion in model container [2024-11-12 05:11:47,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:46" (2/3) ... [2024-11-12 05:11:47,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388dffa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:47, skipping insertion in model container [2024-11-12 05:11:47,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:47" (3/3) ... [2024-11-12 05:11:47,285 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-12 05:11:47,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:11:47,301 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:11:47,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:11:47,358 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;@7390913a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:11:47,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:11:47,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:11:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 05:11:47,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:47,376 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:47,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:47,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:47,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1211062472, now seen corresponding path program 1 times [2024-11-12 05:11:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:47,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653140522] [2024-11-12 05:11:47,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:11:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:11:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:11:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:11:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:11:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:11:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:11:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:11:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:11:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:11:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:11:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:11:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:11:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:11:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:11:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:11:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:11:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:11:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:11:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:11:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:11:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:11:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:11:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:11:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:47,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:11:47,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:11:47,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653140522] [2024-11-12 05:11:47,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653140522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:11:47,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:11:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:11:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12431039] [2024-11-12 05:11:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:11:47,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:11:47,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:11:47,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:11:47,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:11:47,937 INFO L87 Difference]: Start difference. First operand has 85 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:11:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:47,965 INFO L93 Difference]: Finished difference Result 163 states and 280 transitions. [2024-11-12 05:11:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:11:47,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-11-12 05:11:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:47,974 INFO L225 Difference]: With dead ends: 163 [2024-11-12 05:11:47,974 INFO L226 Difference]: Without dead ends: 81 [2024-11-12 05:11:47,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-12 05:11:47,983 INFO L435 NwaCegarLoop]: 123 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, 123 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-12 05:11:47,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:11:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-12 05:11:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-12 05:11:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:11:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-12 05:11:48,031 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 160 [2024-11-12 05:11:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:48,031 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-12 05:11:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:11:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-12 05:11:48,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 05:11:48,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:48,039 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:48,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:11:48,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1796506252, now seen corresponding path program 1 times [2024-11-12 05:11:48,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:48,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310955500] [2024-11-12 05:11:48,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:48,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:11:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:11:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:11:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:11:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:11:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:11:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:11:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:11:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:11:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:11:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:11:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:11:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:11:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:11:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:11:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:11:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:11:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:11:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:11:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:11:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:11:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:11:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:11:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:11:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:11:48,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:11:48,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310955500] [2024-11-12 05:11:48,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310955500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:11:48,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:11:48,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:11:48,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048036047] [2024-11-12 05:11:48,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:11:48,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:11:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:11:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:11:48,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:11:48,900 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:11:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:49,166 INFO L93 Difference]: Finished difference Result 238 states and 364 transitions. [2024-11-12 05:11:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:11:49,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-11-12 05:11:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:49,171 INFO L225 Difference]: With dead ends: 238 [2024-11-12 05:11:49,171 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 05:11:49,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:11:49,175 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:11:49,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 347 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:11:49,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 05:11:49,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 130. [2024-11-12 05:11:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:11:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 198 transitions. [2024-11-12 05:11:49,219 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 198 transitions. Word has length 160 [2024-11-12 05:11:49,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:49,220 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 198 transitions. [2024-11-12 05:11:49,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:11:49,220 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 198 transitions. [2024-11-12 05:11:49,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 05:11:49,223 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:49,223 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:49,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:11:49,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:49,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:49,224 INFO L85 PathProgramCache]: Analyzing trace with hash -387667324, now seen corresponding path program 1 times [2024-11-12 05:11:49,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152412865] [2024-11-12 05:11:49,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:11:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:11:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:11:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:11:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:11:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:11:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:11:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:11:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:11:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:11:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:11:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:11:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:11:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:11:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:11:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:11:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:11:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:11:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:11:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:11:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:11:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:11:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:11:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:11:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:11:51,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:11:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152412865] [2024-11-12 05:11:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152412865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:11:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:11:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:11:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809936317] [2024-11-12 05:11:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:11:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:11:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:11:51,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:11:51,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:11:51,475 INFO L87 Difference]: Start difference. First operand 130 states and 198 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-12 05:11:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:53,017 INFO L93 Difference]: Finished difference Result 324 states and 482 transitions. [2024-11-12 05:11:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 05:11:53,018 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 161 [2024-11-12 05:11:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:53,022 INFO L225 Difference]: With dead ends: 324 [2024-11-12 05:11:53,022 INFO L226 Difference]: Without dead ends: 240 [2024-11-12 05:11:53,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:11:53,024 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 484 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:11:53,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 941 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 05:11:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-12 05:11:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 163. [2024-11-12 05:11:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 110 states have internal predecessors, (142), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-12 05:11:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2024-11-12 05:11:53,075 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 161 [2024-11-12 05:11:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:53,076 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2024-11-12 05:11:53,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-12 05:11:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2024-11-12 05:11:53,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 05:11:53,080 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:53,081 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:53,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:11:53,081 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:53,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash 892196354, now seen corresponding path program 1 times [2024-11-12 05:11:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:53,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442513584] [2024-11-12 05:11:53,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:53,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:11:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:11:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:11:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:11:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:11:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:11:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:11:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:11:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:11:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:11:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:11:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:11:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:11:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:11:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:11:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:11:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:11:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:11:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:11:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:11:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:11:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:11:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:11:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:11:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:11:53,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:11:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442513584] [2024-11-12 05:11:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442513584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:11:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:11:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:11:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390514217] [2024-11-12 05:11:53,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:11:53,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:11:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:11:53,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:11:53,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:11:53,827 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:11:54,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:54,305 INFO L93 Difference]: Finished difference Result 409 states and 612 transitions. [2024-11-12 05:11:54,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:11:54,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 05:11:54,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:54,312 INFO L225 Difference]: With dead ends: 409 [2024-11-12 05:11:54,312 INFO L226 Difference]: Without dead ends: 331 [2024-11-12 05:11:54,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:11:54,316 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 228 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 05:11:54,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 571 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 05:11:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-12 05:11:54,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 234. [2024-11-12 05:11:54,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 163 states have (on average 1.343558282208589) internal successors, (219), 165 states have internal predecessors, (219), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 05:11:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 351 transitions. [2024-11-12 05:11:54,367 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 351 transitions. Word has length 161 [2024-11-12 05:11:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:54,368 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 351 transitions. [2024-11-12 05:11:54,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:11:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 351 transitions. [2024-11-12 05:11:54,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 05:11:54,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:54,371 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:54,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:11:54,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:54,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:54,372 INFO L85 PathProgramCache]: Analyzing trace with hash -118920896, now seen corresponding path program 1 times [2024-11-12 05:11:54,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:54,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576727424] [2024-11-12 05:11:54,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:54,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:11:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:11:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:11:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:11:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:11:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:11:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:11:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:11:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:11:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:11:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:11:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:11:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:11:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:11:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:11:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:11:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:11:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:11:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:11:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:11:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:11:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:11:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:11:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:11:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 21 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-12 05:11:55,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:11:55,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576727424] [2024-11-12 05:11:55,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576727424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:11:55,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400387658] [2024-11-12 05:11:55,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:55,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:11:55,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:11:55,098 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-12 05:11:55,100 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-12 05:11:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:55,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 05:11:55,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:11:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 542 proven. 21 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2024-11-12 05:11:55,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:11:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 111 proven. 24 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-12 05:11:56,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400387658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:11:56,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:11:56,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 23 [2024-11-12 05:11:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280597934] [2024-11-12 05:11:56,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:11:56,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-12 05:11:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:11:56,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-12 05:11:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-11-12 05:11:56,351 INFO L87 Difference]: Start difference. First operand 234 states and 351 transitions. Second operand has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-12 05:11:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:57,251 INFO L93 Difference]: Finished difference Result 473 states and 693 transitions. [2024-11-12 05:11:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 05:11:57,252 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) Word has length 161 [2024-11-12 05:11:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:57,255 INFO L225 Difference]: With dead ends: 473 [2024-11-12 05:11:57,255 INFO L226 Difference]: Without dead ends: 295 [2024-11-12 05:11:57,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 357 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=526, Invalid=1544, Unknown=0, NotChecked=0, Total=2070 [2024-11-12 05:11:57,257 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 373 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:11:57,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 525 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 05:11:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-12 05:11:57,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 247. [2024-11-12 05:11:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 174 states have internal predecessors, (222), 66 states have call successors, (66), 8 states have call predecessors, (66), 8 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 05:11:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 354 transitions. [2024-11-12 05:11:57,300 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 354 transitions. Word has length 161 [2024-11-12 05:11:57,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:57,301 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 354 transitions. [2024-11-12 05:11:57,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.565217391304348) internal successors, (105), 23 states have internal predecessors, (105), 8 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 8 states have call predecessors, (56), 8 states have call successors, (56) [2024-11-12 05:11:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 354 transitions. [2024-11-12 05:11:57,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 05:11:57,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:57,305 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:57,325 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-12 05:11:57,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:11:57,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:57,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1976015226, now seen corresponding path program 1 times [2024-11-12 05:11:57,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:57,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341902981] [2024-11-12 05:11:57,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:57,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:11:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:11:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:11:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:11:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:11:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:11:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:11:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:11:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:11:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:11:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:11:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:11:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:11:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:11:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:11:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:11:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:11:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:11:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:11:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:11:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:11:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:11:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:11:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:11:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 05:11:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:11:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341902981] [2024-11-12 05:11:57,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341902981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:11:57,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850075870] [2024-11-12 05:11:57,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:57,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:11:57,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:11:57,969 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-12 05:11:57,971 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-12 05:11:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:58,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 05:11:58,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:11:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 518 proven. 72 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2024-11-12 05:11:58,312 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:11:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 05:11:58,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850075870] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:11:58,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:11:58,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-12 05:11:58,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330991957] [2024-11-12 05:11:58,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:11:58,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 05:11:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:11:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 05:11:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-12 05:11:58,555 INFO L87 Difference]: Start difference. First operand 247 states and 354 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-12 05:11:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:59,269 INFO L93 Difference]: Finished difference Result 532 states and 751 transitions. [2024-11-12 05:11:59,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 05:11:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 161 [2024-11-12 05:11:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:59,276 INFO L225 Difference]: With dead ends: 532 [2024-11-12 05:11:59,276 INFO L226 Difference]: Without dead ends: 352 [2024-11-12 05:11:59,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 364 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2024-11-12 05:11:59,278 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 261 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 05:11:59,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 570 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 05:11:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-12 05:11:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 251. [2024-11-12 05:11:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 174 states have (on average 1.2586206896551724) internal successors, (219), 176 states have internal predecessors, (219), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 05:11:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 351 transitions. [2024-11-12 05:11:59,326 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 351 transitions. Word has length 161 [2024-11-12 05:11:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:59,326 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 351 transitions. [2024-11-12 05:11:59,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 13 states have internal predecessors, (91), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-12 05:11:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 351 transitions. [2024-11-12 05:11:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 05:11:59,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:59,329 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:11:59,350 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-12 05:11:59,529 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,SelfDestructingSolverStorable5 [2024-11-12 05:11:59,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:59,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1604090165, now seen corresponding path program 1 times [2024-11-12 05:11:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:11:59,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607395308] [2024-11-12 05:11:59,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:11:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:11:59,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973707091] [2024-11-12 05:11:59,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:11:59,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:11:59,691 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-12 05:11:59,693 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-12 05:11:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:11:59,851 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:12:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:12:00,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:12:00,191 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:12:00,192 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:12:00,205 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-12 05:12:00,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:12:00,399 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:12:00,544 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:12:00,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:12:00 BoogieIcfgContainer [2024-11-12 05:12:00,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:12:00,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:12:00,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:12:00,548 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:12:00,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:47" (3/4) ... [2024-11-12 05:12:00,551 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:12:00,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:12:00,553 INFO L158 Benchmark]: Toolchain (without parser) took 14505.15ms. Allocated memory was 159.4MB in the beginning and 360.7MB in the end (delta: 201.3MB). Free memory was 103.1MB in the beginning and 303.4MB in the end (delta: -200.3MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-12 05:12:00,553 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:12:00,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.55ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 85.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:12:00,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.30ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 81.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:12:00,555 INFO L158 Benchmark]: Boogie Preprocessor took 66.75ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 76.5MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:12:00,556 INFO L158 Benchmark]: RCFGBuilder took 697.48ms. Allocated memory is still 159.4MB. Free memory was 76.5MB in the beginning and 108.4MB in the end (delta: -31.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-12 05:12:00,556 INFO L158 Benchmark]: TraceAbstraction took 13270.09ms. Allocated memory was 159.4MB in the beginning and 360.7MB in the end (delta: 201.3MB). Free memory was 107.6MB in the beginning and 304.5MB in the end (delta: -196.9MB). Peak memory consumption was 159.8MB. Max. memory is 16.1GB. [2024-11-12 05:12:00,556 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 360.7MB. Free memory was 304.5MB in the beginning and 303.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:12:00,558 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.20ms. Allocated memory is still 159.4MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.55ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 85.6MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.30ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 81.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.75ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 76.5MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 697.48ms. Allocated memory is still 159.4MB. Free memory was 76.5MB in the beginning and 108.4MB in the end (delta: -31.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13270.09ms. Allocated memory was 159.4MB in the beginning and 360.7MB in the end (delta: 201.3MB). Free memory was 107.6MB in the beginning and 304.5MB in the end (delta: -196.9MB). Peak memory consumption was 159.8MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 360.7MB. Free memory was 304.5MB in the beginning and 303.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 someBinaryFLOATComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] signed char var_1_4 = 0; [L24] signed char var_1_5 = -5; [L25] signed short int var_1_6 = -32; [L26] signed char var_1_7 = 8; [L27] unsigned char var_1_8 = 2; [L28] float var_1_10 = 15.6; [L29] unsigned char var_1_11 = 10; [L30] unsigned short int var_1_12 = 64; [L31] signed long int var_1_13 = -8; [L32] unsigned long int var_1_14 = 64; [L33] float var_1_17 = 9.75; [L34] float var_1_18 = 0.5; [L35] signed short int var_1_19 = -128; [L36] unsigned char var_1_21 = 1; [L37] unsigned long int var_1_22 = 3552880340; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 1; [L44] unsigned char var_1_29 = 0; [L45] signed short int var_1_30 = 10; [L46] float var_1_31 = 99.25; [L47] signed long int var_1_32 = 256; [L48] signed short int last_1_var_1_6 = -32; [L49] signed long int last_1_var_1_13 = -8; [L50] unsigned long int last_1_var_1_14 = 64; [L51] float last_1_var_1_17 = 9.75; [L52] signed short int last_1_var_1_19 = -128; [L53] unsigned char last_1_var_1_21 = 1; [L54] float last_1_var_1_31 = 99.25; [L55] signed long int last_1_var_1_32 = 256; VAL [isInitial=0, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L175] last_1_var_1_6 = var_1_6 [L176] last_1_var_1_13 = var_1_13 [L177] last_1_var_1_14 = var_1_14 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 [L180] last_1_var_1_21 = var_1_21 [L181] last_1_var_1_31 = var_1_31 [L182] last_1_var_1_32 = var_1_32 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L137] var_1_4 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L138] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L139] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L139] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-5, var_1_6=-32, var_1_7=8, var_1_8=2] [L140] var_1_5 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_5 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L141] RET assume_abort_if_not(var_1_5 >= -63) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L142] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L142] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=8, var_1_8=2] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L144] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L145] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L145] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L146] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L146] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_10=78/5, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L147] var_1_10 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L148] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L149] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L149] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=10, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_18=1/2, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L153] var_1_18 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L154] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=3552880340, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L155] var_1_22 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L156] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L157] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L157] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L158] var_1_23 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L159] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L160] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L160] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L161] var_1_24 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L162] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L163] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L163] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L165] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L166] CALL assume_abort_if_not(var_1_26 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L166] RET assume_abort_if_not(var_1_26 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L169] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L169] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L171] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L172] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L172] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=-2, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L193] RET updateVariables() [L194] CALL step() [L59] COND FALSE !(-2 == last_1_var_1_32) [L66] var_1_1 = (var_1_5 + 5) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=256, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L68] var_1_32 = var_1_1 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-32, var_1_7=-13, var_1_8=2] [L69] COND TRUE var_1_5 > (last_1_var_1_13 % var_1_7) [L70] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L74] unsigned char stepLocal_4 = (- var_1_18) > last_1_var_1_31; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_4=1, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L75] COND TRUE last_1_var_1_21 || stepLocal_4 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L76] COND FALSE !(! last_1_var_1_21) [L79] var_1_25 = var_1_24 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=64, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=10, var_1_31=397/4, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L84] var_1_12 = var_1_11 [L85] var_1_30 = var_1_1 [L86] var_1_31 = 24.4f [L87] unsigned char stepLocal_0 = (var_1_31 / var_1_10) < 255.625f; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_0=1, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=2] [L88] COND TRUE stepLocal_0 && (var_1_7 < (var_1_5 * -100)) [L89] var_1_8 = (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L93] signed char stepLocal_5 = var_1_7; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_5=-13, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L94] COND TRUE stepLocal_5 <= (~ var_1_1) [L95] var_1_28 = (! (! (var_1_24 && var_1_29))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=64, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L99] COND TRUE var_1_25 || var_1_28 [L100] var_1_14 = ((last_1_var_1_14 + 1u) + var_1_11) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=39/4, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L102] COND TRUE (64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4)) [L103] var_1_17 = 100.5f VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L107] COND FALSE !((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L114] signed char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_1=-1, var_1_11=261, var_1_12=5, var_1_13=-8, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L115] COND TRUE ((last_1_var_1_6 * var_1_11) / 10) <= stepLocal_1 [L116] var_1_13 = (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L124] EXPR 256u & var_1_13 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L124] unsigned char stepLocal_3 = (256u & var_1_13) == (var_1_22 - var_1_12); [L125] unsigned short int stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_2=5, stepLocal_3=0, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L126] COND TRUE stepLocal_3 || var_1_25 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, stepLocal_2=5, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=1, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L127] COND TRUE var_1_13 != stepLocal_2 [L128] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((((((-2 == last_1_var_1_32) ? (((last_1_var_1_32 * last_1_var_1_6) <= -500) ? (var_1_1 == ((signed char) ((((2 - var_1_4) < 0 ) ? -(2 - var_1_4) : (2 - var_1_4))))) : (var_1_1 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) : (var_1_1 == ((signed char) (var_1_5 + 5)))) && ((var_1_5 > (last_1_var_1_13 % var_1_7)) ? (var_1_6 == ((signed short int) var_1_5)) : (var_1_6 == ((signed short int) (var_1_5 + var_1_7))))) && ((((var_1_31 / var_1_10) < 255.625f) && (var_1_7 < (var_1_5 * -100))) ? (var_1_8 == ((unsigned char) (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))))) : (var_1_8 == ((unsigned char) var_1_4)))) && (var_1_12 == ((unsigned short int) var_1_11))) && ((((last_1_var_1_6 * var_1_11) / 10) <= var_1_5) ? (var_1_13 == ((signed long int) (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))))) : (((- (- last_1_var_1_17)) < var_1_10) ? (var_1_13 == ((signed long int) (var_1_7 + var_1_5))) : (var_1_13 == ((signed long int) var_1_4))))) && ((var_1_25 || var_1_28) ? (var_1_14 == ((unsigned long int) ((last_1_var_1_14 + 1u) + var_1_11))) : 1)) && (((64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4))) ? (var_1_17 == ((float) 100.5f)) : (var_1_17 == ((float) var_1_18)))) && (((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) ? (var_1_25 ? (var_1_19 == ((signed short int) var_1_7)) : (var_1_19 == ((signed short int) last_1_var_1_19))) : 1)) && ((((256u & var_1_13) == (var_1_22 - var_1_12)) || var_1_25) ? ((var_1_13 != var_1_12) ? (var_1_21 == ((unsigned char) var_1_23)) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L185-L186] return ((((((((((((((-2 == last_1_var_1_32) ? (((last_1_var_1_32 * last_1_var_1_6) <= -500) ? (var_1_1 == ((signed char) ((((2 - var_1_4) < 0 ) ? -(2 - var_1_4) : (2 - var_1_4))))) : (var_1_1 == ((signed char) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) : (var_1_1 == ((signed char) (var_1_5 + 5)))) && ((var_1_5 > (last_1_var_1_13 % var_1_7)) ? (var_1_6 == ((signed short int) var_1_5)) : (var_1_6 == ((signed short int) (var_1_5 + var_1_7))))) && ((((var_1_31 / var_1_10) < 255.625f) && (var_1_7 < (var_1_5 * -100))) ? (var_1_8 == ((unsigned char) (((((128 - var_1_4)) > (var_1_11)) ? ((128 - var_1_4)) : (var_1_11))))) : (var_1_8 == ((unsigned char) var_1_4)))) && (var_1_12 == ((unsigned short int) var_1_11))) && ((((last_1_var_1_6 * var_1_11) / 10) <= var_1_5) ? (var_1_13 == ((signed long int) (var_1_7 + (var_1_11 - ((((last_1_var_1_13) < (last_1_var_1_32)) ? (last_1_var_1_13) : (last_1_var_1_32))))))) : (((- (- last_1_var_1_17)) < var_1_10) ? (var_1_13 == ((signed long int) (var_1_7 + var_1_5))) : (var_1_13 == ((signed long int) var_1_4))))) && ((var_1_25 || var_1_28) ? (var_1_14 == ((unsigned long int) ((last_1_var_1_14 + 1u) + var_1_11))) : 1)) && (((64 - ((((-64) < 0 ) ? -(-64) : (-64)))) <= (var_1_14 + (var_1_8 * var_1_4))) ? (var_1_17 == ((float) 100.5f)) : (var_1_17 == ((float) var_1_18)))) && (((var_1_31 + (var_1_10 + var_1_31)) > (var_1_18 * var_1_17)) ? (var_1_25 ? (var_1_19 == ((signed short int) var_1_7)) : (var_1_19 == ((signed short int) last_1_var_1_19))) : 1)) && ((((256u & var_1_13) == (var_1_22 - var_1_12)) || var_1_25) ? ((var_1_13 != var_1_12) ? (var_1_21 == ((unsigned char) var_1_23)) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_24)))) && ((last_1_var_1_21 || ((- var_1_18) > last_1_var_1_31)) ? ((! last_1_var_1_21) ? (var_1_25 == ((unsigned char) ((var_1_23 || var_1_26) || var_1_27))) : (var_1_25 == ((unsigned char) var_1_24))) : (var_1_25 == ((unsigned char) var_1_24)))) && ((var_1_7 <= (~ var_1_1)) ? (var_1_28 == ((unsigned char) (! (! (var_1_24 && var_1_29))))) : (var_1_28 == ((unsigned char) ((var_1_31 == 8.5f) || (var_1_29 && var_1_24)))))) && (var_1_30 == ((signed short int) var_1_1))) && (var_1_31 == ((float) 24.4f))) && (var_1_32 == ((signed long int) var_1_1)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-8, last_1_var_1_14=64, last_1_var_1_17=39/4, last_1_var_1_19=-128, last_1_var_1_21=1, last_1_var_1_31=397/4, last_1_var_1_32=256, last_1_var_1_6=-32, var_1_11=261, var_1_12=5, var_1_13=0, var_1_14=70, var_1_17=201/2, var_1_19=-128, var_1_1=4, var_1_21=0, var_1_22=-19327352833, var_1_23=0, var_1_24=1, var_1_25=1, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=4, var_1_31=122/5, var_1_32=4, var_1_4=0, var_1_5=-1, var_1_6=-1, var_1_7=-13, var_1_8=128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.1s, OverallIterations: 7, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1502 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1452 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2218 mSDsCounter, 605 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1823 IncrementalHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 605 mSolverCounterUnsat, 859 mSDtfsCounter, 1823 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1049 GetRequests, 951 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=251occurred in iteration=6, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 353 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1610 NumberOfCodeBlocks, 1610 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1598 ConstructedInterpolants, 0 QuantifiedInterpolants, 7051 SizeOfPredicates, 9 NumberOfNonLiveVariables, 826 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 10860/11040 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-12 05:12:00,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/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_loopvsstraightlinecode_100-while_file-55.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 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:12:02,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:12:02,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:12:02,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:12:02,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:12:02,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:12:02,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:12:02,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:12:02,961 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:12:02,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:12:02,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:12:02,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:12:02,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:12:02,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:12:02,963 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:12:02,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:12:02,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:12:02,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:12:02,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:12:02,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:12:02,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:12:02,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:12:02,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:12:02,969 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:12:02,970 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:12:02,970 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:12:02,970 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:12:02,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:12:02,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:12:02,971 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:12:02,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:12:02,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:12:02,972 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:12:02,972 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:12:02,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:12:02,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:12:02,976 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:12:02,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:12:02,976 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:12:02,976 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:12:02,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:12:02,977 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:12:02,977 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:12:02,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:12:02,978 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 -> 12ec80b88d13cbd20df6410c30aafcaf8554885c00373f899d9eea2626edd39d [2024-11-12 05:12:03,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:12:03,343 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:12:03,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:12:03,347 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:12:03,347 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:12:03,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-12 05:12:04,947 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:12:05,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:12:05,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-12 05:12:05,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9693f787a/66e0e544826f436b9f62c53595bb5a3e/FLAGf1640990e [2024-11-12 05:12:05,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9693f787a/66e0e544826f436b9f62c53595bb5a3e [2024-11-12 05:12:05,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:12:05,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:12:05,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:12:05,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:12:05,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:12:05,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34258f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05, skipping insertion in model container [2024-11-12 05:12:05,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:12:05,470 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-12 05:12:05,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:12:05,616 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:12:05,632 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_loopvsstraightlinecode_100-while_file-55.i[916,929] [2024-11-12 05:12:05,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:12:05,685 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:12:05,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05 WrapperNode [2024-11-12 05:12:05,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:12:05,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:12:05,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:12:05,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:12:05,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,756 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-12 05:12:05,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:12:05,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:12:05,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:12:05,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:12:05,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,804 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:12:05,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,805 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:12:05,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:12:05,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:12:05,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:12:05,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (1/1) ... [2024-11-12 05:12:05,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:12:05,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:12:05,886 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-12 05:12:05,890 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-12 05:12:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:12:05,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:12:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:12:05,928 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:12:05,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:12:05,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:12:06,011 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:12:06,014 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:12:13,472 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 05:12:13,473 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:12:13,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:12:13,486 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:12:13,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:13 BoogieIcfgContainer [2024-11-12 05:12:13,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:12:13,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:12:13,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:12:13,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:12:13,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:12:05" (1/3) ... [2024-11-12 05:12:13,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d92fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:13, skipping insertion in model container [2024-11-12 05:12:13,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:12:05" (2/3) ... [2024-11-12 05:12:13,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72d92fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:12:13, skipping insertion in model container [2024-11-12 05:12:13,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:12:13" (3/3) ... [2024-11-12 05:12:13,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-55.i [2024-11-12 05:12:13,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:12:13,506 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:12:13,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:12:13,585 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;@608c7ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:12:13,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:12:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:12:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 05:12:13,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:12:13,607 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:12:13,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:12:13,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:12:13,615 INFO L85 PathProgramCache]: Analyzing trace with hash 911881905, now seen corresponding path program 1 times [2024-11-12 05:12:13,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:12:13,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133446623] [2024-11-12 05:12:13,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:12:13,632 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-12 05:12:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:12:13,636 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-12 05:12:13,640 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-12 05:12:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:12:14,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:12:14,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:12:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 05:12:14,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:12:14,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:12:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133446623] [2024-11-12 05:12:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133446623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:12:14,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:12:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:12:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179213240] [2024-11-12 05:12:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:12:14,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:12:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:12:14,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:12:14,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:12:14,224 INFO L87 Difference]: Start difference. First operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:12:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:12:14,253 INFO L93 Difference]: Finished difference Result 145 states and 252 transitions. [2024-11-12 05:12:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:12:14,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-11-12 05:12:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:12:14,265 INFO L225 Difference]: With dead ends: 145 [2024-11-12 05:12:14,265 INFO L226 Difference]: Without dead ends: 72 [2024-11-12 05:12:14,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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-12 05:12:14,274 INFO L435 NwaCegarLoop]: 109 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, 109 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-12 05:12:14,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:12:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-12 05:12:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-12 05:12:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 05:12:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-12 05:12:14,329 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 157 [2024-11-12 05:12:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:12:14,330 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-12 05:12:14,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 05:12:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-12 05:12:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-12 05:12:14,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:12:14,334 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:12:14,347 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-12 05:12:14,534 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-12 05:12:14,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:12:14,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:12:14,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1627849581, now seen corresponding path program 1 times [2024-11-12 05:12:14,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:12:14,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036809570] [2024-11-12 05:12:14,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:12:14,538 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-12 05:12:14,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:12:14,558 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-12 05:12:14,560 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-12 05:12:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:12:14,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 05:12:14,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:12:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 05:12:16,476 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:12:16,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:12:16,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036809570] [2024-11-12 05:12:16,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036809570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:12:16,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:12:16,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:12:16,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819092795] [2024-11-12 05:12:16,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:12:16,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:12:16,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:12:16,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:12:16,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:12:16,481 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:12:19,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:12:23,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:12:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:12:23,651 INFO L93 Difference]: Finished difference Result 211 states and 322 transitions. [2024-11-12 05:12:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:12:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-12 05:12:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:12:23,703 INFO L225 Difference]: With dead ends: 211 [2024-11-12 05:12:23,704 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 05:12:23,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:12:23,706 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 84 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:12:23,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 306 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-12 05:12:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 05:12:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2024-11-12 05:12:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 70 states have internal predecessors, (88), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:12:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 184 transitions. [2024-11-12 05:12:23,752 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 184 transitions. Word has length 157 [2024-11-12 05:12:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:12:23,753 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 184 transitions. [2024-11-12 05:12:23,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 05:12:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 184 transitions. [2024-11-12 05:12:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 05:12:23,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:12:23,756 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:12:23,771 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-12 05:12:23,957 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-12 05:12:23,957 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:12:23,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:12:23,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1305132533, now seen corresponding path program 1 times [2024-11-12 05:12:23,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:12:23,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372823225] [2024-11-12 05:12:23,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:12:23,959 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-12 05:12:23,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:12:23,961 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-12 05:12:23,962 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-12 05:12:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:12:24,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:12:24,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:12:25,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 512 proven. 36 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-12 05:12:25,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:12:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 05:12:27,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:12:27,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372823225] [2024-11-12 05:12:27,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372823225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:12:27,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 05:12:27,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-12 05:12:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862816874] [2024-11-12 05:12:27,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 05:12:27,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:12:27,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:12:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:12:27,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:12:27,248 INFO L87 Difference]: Start difference. First operand 121 states and 184 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-12 05:12:33,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:12:34,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:12:39,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:12:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:12:40,378 INFO L93 Difference]: Finished difference Result 360 states and 521 transitions. [2024-11-12 05:12:40,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-12 05:12:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 158 [2024-11-12 05:12:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:12:40,383 INFO L225 Difference]: With dead ends: 360 [2024-11-12 05:12:40,383 INFO L226 Difference]: Without dead ends: 291 [2024-11-12 05:12:40,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 307 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 05:12:40,388 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 180 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 105 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:12:40,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 531 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 524 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2024-11-12 05:12:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-12 05:12:40,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 150. [2024-11-12 05:12:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 95 states have internal predecessors, (118), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 05:12:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2024-11-12 05:12:40,432 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 158 [2024-11-12 05:12:40,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:12:40,433 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2024-11-12 05:12:40,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 3 states have call successors, (31), 3 states have call predecessors, (31), 5 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-12 05:12:40,433 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2024-11-12 05:12:40,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-12 05:12:40,436 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:12:40,436 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:12:40,454 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-12 05:12:40,640 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-12 05:12:40,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:12:40,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:12:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1568842632, now seen corresponding path program 1 times [2024-11-12 05:12:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:12:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573580117] [2024-11-12 05:12:40,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:12:40,644 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-12 05:12:40,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:12:40,647 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-12 05:12:40,648 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-12 05:12:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:12:41,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-12 05:12:41,082 INFO L279 TraceCheckSpWp]: Computing forward predicates...