./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_codestructure_normal_file-13.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 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:31:22,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:31:22,118 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:31:22,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:31:22,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:31:22,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:31:22,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:31:22,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:31:22,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:31:22,168 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:31:22,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:31:22,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:31:22,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:31:22,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:31:22,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:31:22,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:31:22,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:31:22,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:31:22,173 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:31:22,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:31:22,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:31:22,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:31:22,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:31:22,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:31:22,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:31:22,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:31:22,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:31:22,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:31:22,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:31:22,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:31:22,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:31:22,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:31:22,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:31:22,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:31:22,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:31:22,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:31:22,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:31:22,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:31:22,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:31:22,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:31:22,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:31:22,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:31:22,184 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 -> 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b [2024-11-08 19:31:22,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:31:22,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:31:22,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:31:22,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:31:22,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:31:22,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-11-08 19:31:23,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:31:24,166 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:31:24,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-11-08 19:31:24,175 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da01c703/be4910cee12d4ea3ab05dbd139efd3e4/FLAG14df609a3 [2024-11-08 19:31:24,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da01c703/be4910cee12d4ea3ab05dbd139efd3e4 [2024-11-08 19:31:24,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:31:24,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:31:24,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:31:24,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:31:24,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:31:24,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f863d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24, skipping insertion in model container [2024-11-08 19:31:24,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:31:24,421 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_codestructure_normal_file-13.i[913,926] [2024-11-08 19:31:24,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:31:24,510 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:31:24,522 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_codestructure_normal_file-13.i[913,926] [2024-11-08 19:31:24,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:31:24,570 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:31:24,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24 WrapperNode [2024-11-08 19:31:24,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:31:24,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:31:24,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:31:24,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:31:24,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,648 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-08 19:31:24,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:31:24,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:31:24,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:31:24,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:31:24,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,694 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-08 19:31:24,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:31:24,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:31:24,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:31:24,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:31:24,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (1/1) ... [2024-11-08 19:31:24,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:31:24,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:31:24,759 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-08 19:31:24,761 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-08 19:31:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:31:24,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:31:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:31:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:31:24,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:31:24,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:31:24,880 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:31:24,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:31:25,205 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:31:25,206 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:31:25,222 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:31:25,222 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:31:25,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:25 BoogieIcfgContainer [2024-11-08 19:31:25,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:31:25,227 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:31:25,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:31:25,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:31:25,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:31:24" (1/3) ... [2024-11-08 19:31:25,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b94388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:31:25, skipping insertion in model container [2024-11-08 19:31:25,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:24" (2/3) ... [2024-11-08 19:31:25,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27b94388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:31:25, skipping insertion in model container [2024-11-08 19:31:25,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:25" (3/3) ... [2024-11-08 19:31:25,236 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-13.i [2024-11-08 19:31:25,252 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:31:25,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:31:25,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:31:25,319 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;@39b681ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:31:25,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:31:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:31:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:31:25,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:25,340 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:25,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:25,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:25,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1701807165, now seen corresponding path program 1 times [2024-11-08 19:31:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:31:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113584211] [2024-11-08 19:31:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:31:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:31:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:31:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:31:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:31:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:31:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:31:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:31:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:31:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:31:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:31:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:31:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:31:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:31:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:31:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:31:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:31:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:31:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:31:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:31:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:31:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:31:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:31:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:31:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:31:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:31:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:31:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:31:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 19:31:25,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:31:25,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113584211] [2024-11-08 19:31:25,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113584211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:31:25,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:31:25,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:31:25,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440278135] [2024-11-08 19:31:25,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:31:25,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:31:25,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:31:25,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:31:25,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:31:25,957 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:31:25,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:31:25,986 INFO L93 Difference]: Finished difference Result 151 states and 264 transitions. [2024-11-08 19:31:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:31:25,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2024-11-08 19:31:25,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:31:25,996 INFO L225 Difference]: With dead ends: 151 [2024-11-08 19:31:25,998 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 19:31:26,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-08 19:31:26,009 INFO L432 NwaCegarLoop]: 113 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, 113 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-08 19:31:26,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:31:26,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 19:31:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-08 19:31:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:31:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-11-08 19:31:26,069 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 176 [2024-11-08 19:31:26,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:31:26,070 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-11-08 19:31:26,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:31:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-11-08 19:31:26,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:31:26,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:26,080 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:26,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:31:26,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:26,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:26,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1199661259, now seen corresponding path program 1 times [2024-11-08 19:31:26,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:31:26,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381806294] [2024-11-08 19:31:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:26,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:26,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:31:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:31:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:31:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:31:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:31:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:31:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:31:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:31:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:31:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:31:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:31:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:31:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:31:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:31:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:31:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:31:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:31:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:31:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:31:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:31:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:31:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:31:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:31:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:31:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:31:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:31:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:31:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:31:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 19:31:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:31:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381806294] [2024-11-08 19:31:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381806294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:31:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:31:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:31:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637895718] [2024-11-08 19:31:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:31:26,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:31:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:31:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:31:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:31:26,494 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 19:31:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:31:26,555 INFO L93 Difference]: Finished difference Result 188 states and 282 transitions. [2024-11-08 19:31:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:31:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-11-08 19:31:26,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:31:26,561 INFO L225 Difference]: With dead ends: 188 [2024-11-08 19:31:26,561 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 19:31:26,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:31:26,566 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 55 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:31:26,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 267 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:31:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 19:31:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-08 19:31:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 71 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 19:31:26,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2024-11-08 19:31:26,618 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 176 [2024-11-08 19:31:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:31:26,619 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2024-11-08 19:31:26,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 19:31:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2024-11-08 19:31:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 19:31:26,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:26,626 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:26,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:31:26,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:26,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:26,627 INFO L85 PathProgramCache]: Analyzing trace with hash 612855245, now seen corresponding path program 1 times [2024-11-08 19:31:26,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:31:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285802931] [2024-11-08 19:31:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:31:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 19:31:26,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [142842658] [2024-11-08 19:31:26,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:26,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:31:26,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:31:26,844 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-08 19:31:26,846 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-08 19:31:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:31:27,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:31:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:31:27,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:31:27,260 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:31:27,261 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:31:27,285 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-08 19:31:27,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:31:27,467 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 19:31:27,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:31:27,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:31:27 BoogieIcfgContainer [2024-11-08 19:31:27,616 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:31:27,617 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:31:27,617 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:31:27,617 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:31:27,618 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:25" (3/4) ... [2024-11-08 19:31:27,620 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:31:27,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:31:27,622 INFO L158 Benchmark]: Toolchain (without parser) took 3429.95ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 111.1MB in the beginning and 152.8MB in the end (delta: -41.7MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2024-11-08 19:31:27,625 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:31:27,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.43ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 94.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:31:27,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.07ms. Allocated memory is still 165.7MB. Free memory was 94.1MB in the beginning and 90.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:31:27,626 INFO L158 Benchmark]: Boogie Preprocessor took 71.63ms. Allocated memory is still 165.7MB. Free memory was 90.1MB in the beginning and 84.2MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:31:27,628 INFO L158 Benchmark]: RCFGBuilder took 500.26ms. Allocated memory is still 165.7MB. Free memory was 84.2MB in the beginning and 60.7MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 19:31:27,628 INFO L158 Benchmark]: TraceAbstraction took 2389.65ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 60.2MB in the beginning and 152.8MB in the end (delta: -92.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:31:27,628 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 249.6MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:31:27,630 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.19ms. Allocated memory is still 165.7MB. Free memory is still 130.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.43ms. Allocated memory is still 165.7MB. Free memory was 111.1MB in the beginning and 94.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.07ms. Allocated memory is still 165.7MB. Free memory was 94.1MB in the beginning and 90.1MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.63ms. Allocated memory is still 165.7MB. Free memory was 90.1MB in the beginning and 84.2MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 500.26ms. Allocated memory is still 165.7MB. Free memory was 84.2MB in the beginning and 60.7MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2389.65ms. Allocated memory was 165.7MB in the beginning and 249.6MB in the end (delta: 83.9MB). Free memory was 60.2MB in the beginning and 152.8MB in the end (delta: -92.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 249.6MB. Free memory is still 152.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned short int var_1_2 = 256; [L24] signed long int var_1_3 = 500; [L25] signed char var_1_4 = 16; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 1; [L28] unsigned short int var_1_7 = 50; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 64; [L33] signed char var_1_12 = -10; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = -25; [L36] double var_1_15 = 64.875; [L37] unsigned long int var_1_16 = 1000000; [L38] double var_1_17 = 1.625; [L39] double var_1_18 = 32.2; [L40] double var_1_19 = 8.6; [L41] double var_1_20 = 10.5; [L42] signed short int var_1_21 = -64; [L43] unsigned char var_1_22 = 25; [L44] unsigned char var_1_23 = 0; [L45] unsigned long int var_1_24 = 5; VAL [isInitial=0, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=256, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L139] isInitial = 1 [L140] FCALL initially() [L141] COND TRUE 1 [L142] FCALL updateLastVariables() [L143] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L89] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=500, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L90] var_1_3 = __VERIFIER_nondet_long() [L91] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L92] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=16, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L93] var_1_4 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=1, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=1, var_1_7=50, var_1_8=1, var_1_9=0] [L99] var_1_6 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=50, var_1_8=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=50, var_1_8=1, var_1_9=0] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=1, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L105] var_1_9 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1] [L106] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1] [L107] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L108] var_1_10 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=254, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L114] var_1_13 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=-25, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L117] var_1_14 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_16=1000000, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L120] var_1_16 = __VERIFIER_nondet_ulong() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L122] CALL assume_abort_if_not(var_1_16 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L122] RET assume_abort_if_not(var_1_16 <= 4294967295) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L123] var_1_17 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L124] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L125] var_1_18 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L126] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L127] var_1_19 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L129] var_1_20 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L130] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L143] RET updateVariables() [L144] CALL step() [L49] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L49] COND FALSE !((~ var_1_2) != (var_1_3 >> var_1_4)) [L56] var_1_1 = 100 VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=-10, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L61] COND TRUE var_1_10 > var_1_8 [L62] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=519/8, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L64] COND FALSE !(var_1_4 > var_1_1) [L67] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L69] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L74] COND TRUE ((- var_1_11) < 8) || var_1_9 [L75] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=127, var_1_23=0, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L77] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=5, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L78] COND TRUE var_1_18 <= var_1_20 [L79] var_1_24 = ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L144] RET step() [L145] CALL, EXPR property() [L135] EXPR var_1_3 >> var_1_4 VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L135-L136] return (((((((((~ var_1_2) != (var_1_3 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_8) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_8 % var_1_10) > var_1_16) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_7 + var_1_11))) ? (var_1_8) : ((var_1_7 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_23)) : 1)) ; [L145] RET, EXPR property() [L145] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=254, var_1_11=-129, var_1_12=0, var_1_13=-31, var_1_14=31, var_1_15=2, var_1_16=0, var_1_17=2, var_1_1=100, var_1_21=-64, var_1_22=127, var_1_23=127, var_1_24=1, var_1_2=0, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=65536, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 380 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 105 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 275 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 704 NumberOfCodeBlocks, 704 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3024/3024 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-08 19:31:27,671 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_codestructure_normal_file-13.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 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:31:29,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:31:29,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:31:29,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:31:29,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:31:30,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:31:30,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:31:30,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:31:30,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:31:30,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:31:30,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:31:30,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:31:30,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:31:30,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:31:30,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:31:30,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:31:30,022 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:31:30,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:31:30,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:31:30,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:31:30,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:31:30,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:31:30,025 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:31:30,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:31:30,026 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:31:30,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:31:30,026 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:31:30,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:31:30,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:31:30,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:31:30,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:31:30,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:31:30,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:31:30,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:31:30,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:31:30,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:31:30,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:31:30,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:31:30,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:31:30,031 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:31:30,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:31:30,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:31:30,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:31:30,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:31:30,032 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 -> 25840860c78de275d49136a8e7b041bfd54ebe6c9f8e50f6ca8cb09cd039519b [2024-11-08 19:31:30,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:31:30,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:31:30,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:31:30,419 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:31:30,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:31:30,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-11-08 19:31:31,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:31:32,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:31:32,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-13.i [2024-11-08 19:31:32,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe5973fc/64a57df310824855bea40ee1dbeb527e/FLAG94ac15789 [2024-11-08 19:31:32,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efe5973fc/64a57df310824855bea40ee1dbeb527e [2024-11-08 19:31:32,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:31:32,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:31:32,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:31:32,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:31:32,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:31:32,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3621cae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32, skipping insertion in model container [2024-11-08 19:31:32,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:31:32,462 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_codestructure_normal_file-13.i[913,926] [2024-11-08 19:31:32,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:31:32,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:31:32,566 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_codestructure_normal_file-13.i[913,926] [2024-11-08 19:31:32,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:31:32,631 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:31:32,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32 WrapperNode [2024-11-08 19:31:32,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:31:32,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:31:32,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:31:32,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:31:32,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,694 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-11-08 19:31:32,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:31:32,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:31:32,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:31:32,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:31:32,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,716 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,737 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-08 19:31:32,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,777 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,780 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:31:32,781 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:31:32,781 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:31:32,781 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:31:32,784 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (1/1) ... [2024-11-08 19:31:32,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:31:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:31:32,827 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-08 19:31:32,831 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-08 19:31:32,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:31:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:31:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:31:32,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:31:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:31:32,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:31:32,974 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:31:32,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:31:37,291 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:31:37,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:31:37,310 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:31:37,311 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:31:37,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:37 BoogieIcfgContainer [2024-11-08 19:31:37,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:31:37,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:31:37,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:31:37,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:31:37,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:31:32" (1/3) ... [2024-11-08 19:31:37,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c430afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:31:37, skipping insertion in model container [2024-11-08 19:31:37,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:31:32" (2/3) ... [2024-11-08 19:31:37,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c430afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:31:37, skipping insertion in model container [2024-11-08 19:31:37,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:31:37" (3/3) ... [2024-11-08 19:31:37,321 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-13.i [2024-11-08 19:31:37,338 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:31:37,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:31:37,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:31:37,420 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;@7a0a167f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:31:37,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:31:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:31:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 19:31:37,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:37,437 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:37,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:37,444 INFO L85 PathProgramCache]: Analyzing trace with hash -2079685081, now seen corresponding path program 1 times [2024-11-08 19:31:37,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:31:37,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532425990] [2024-11-08 19:31:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:37,456 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-08 19:31:37,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:31:37,461 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-08 19:31:37,462 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-08 19:31:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:37,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:31:37,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:31:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 19:31:37,923 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:31:37,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:31:37,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532425990] [2024-11-08 19:31:37,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532425990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:31:37,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:31:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:31:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842898153] [2024-11-08 19:31:37,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:31:37,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:31:37,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:31:37,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:31:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:31:37,963 INFO L87 Difference]: Start difference. First operand has 74 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:31:37,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:31:37,990 INFO L93 Difference]: Finished difference Result 141 states and 250 transitions. [2024-11-08 19:31:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:31:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-11-08 19:31:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:31:37,999 INFO L225 Difference]: With dead ends: 141 [2024-11-08 19:31:38,000 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 19:31:38,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-08 19:31:38,006 INFO L432 NwaCegarLoop]: 106 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, 106 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-08 19:31:38,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:31:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 19:31:38,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-08 19:31:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 19:31:38,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-08 19:31:38,056 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 173 [2024-11-08 19:31:38,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:31:38,057 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-08 19:31:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 19:31:38,058 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-08 19:31:38,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 19:31:38,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:38,062 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:38,073 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-08 19:31:38,263 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-08 19:31:38,264 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:38,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash -425525729, now seen corresponding path program 1 times [2024-11-08 19:31:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:31:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089594993] [2024-11-08 19:31:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:38,266 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-08 19:31:38,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:31:38,269 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-08 19:31:38,271 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-08 19:31:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:38,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:31:38,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:31:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 428 proven. 132 refuted. 0 times theorem prover too weak. 952 trivial. 0 not checked. [2024-11-08 19:31:40,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:31:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 19:31:40,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:31:40,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089594993] [2024-11-08 19:31:40,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089594993] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 19:31:40,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:31:40,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2024-11-08 19:31:40,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452305469] [2024-11-08 19:31:40,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:31:40,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 19:31:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:31:40,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 19:31:40,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-08 19:31:40,893 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-08 19:31:45,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:31:48,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:31:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:31:48,572 INFO L93 Difference]: Finished difference Result 201 states and 291 transitions. [2024-11-08 19:31:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 19:31:48,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 173 [2024-11-08 19:31:48,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:31:48,583 INFO L225 Difference]: With dead ends: 201 [2024-11-08 19:31:48,583 INFO L226 Difference]: Without dead ends: 134 [2024-11-08 19:31:48,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2024-11-08 19:31:48,585 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 357 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:31:48,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 258 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-08 19:31:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-08 19:31:48,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2024-11-08 19:31:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 19:31:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2024-11-08 19:31:48,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 173 [2024-11-08 19:31:48,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:31:48,613 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2024-11-08 19:31:48,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 4 states have call successors, (51), 3 states have call predecessors, (51), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-08 19:31:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2024-11-08 19:31:48,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 19:31:48,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:48,620 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:48,633 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 (3)] Forceful destruction successful, exit code 0 [2024-11-08 19:31:48,821 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-08 19:31:48,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:48,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 254532641, now seen corresponding path program 1 times [2024-11-08 19:31:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:31:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770224792] [2024-11-08 19:31:48,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:48,824 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-08 19:31:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:31:48,825 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-08 19:31:48,826 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-08 19:31:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:49,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:31:49,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:31:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 19:31:49,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:31:49,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:31:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770224792] [2024-11-08 19:31:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770224792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:31:49,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:31:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:31:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787887973] [2024-11-08 19:31:49,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:31:49,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:31:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:31:49,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:31:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:31:49,200 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 19:31:51,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:31:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:31:52,031 INFO L93 Difference]: Finished difference Result 270 states and 382 transitions. [2024-11-08 19:31:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:31:52,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-08 19:31:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:31:52,040 INFO L225 Difference]: With dead ends: 270 [2024-11-08 19:31:52,041 INFO L226 Difference]: Without dead ends: 171 [2024-11-08 19:31:52,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:31:52,044 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 51 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-08 19:31:52,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 246 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-08 19:31:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-08 19:31:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-11-08 19:31:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 111 states have (on average 1.2522522522522523) internal successors, (139), 114 states have internal predecessors, (139), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 19:31:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 235 transitions. [2024-11-08 19:31:52,085 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 235 transitions. Word has length 173 [2024-11-08 19:31:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:31:52,087 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 235 transitions. [2024-11-08 19:31:52,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 19:31:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 235 transitions. [2024-11-08 19:31:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-08 19:31:52,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:31:52,093 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:31:52,109 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-08 19:31:52,294 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-08 19:31:52,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:31:52,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:31:52,295 INFO L85 PathProgramCache]: Analyzing trace with hash 955597219, now seen corresponding path program 1 times [2024-11-08 19:31:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:31:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787098032] [2024-11-08 19:31:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:31:52,297 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-08 19:31:52,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:31:52,300 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-08 19:31:52,303 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-08 19:31:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:31:52,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 19:31:52,611 INFO L278 TraceCheckSpWp]: Computing forward predicates...