./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:35:38,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:35:38,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:35:38,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:35:38,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:35:38,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:35:38,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:35:38,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:35:38,242 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:35:38,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:35:38,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:35:38,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:35:38,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:35:38,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:35:38,246 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:35:38,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:35:38,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:35:38,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:35:38,247 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:35:38,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:35:38,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:35:38,249 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:35:38,249 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:35:38,249 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:35:38,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:35:38,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:35:38,250 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:35:38,250 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:35:38,250 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:35:38,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:35:38,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:35:38,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:35:38,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:35:38,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:35:38,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:35:38,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:35:38,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:35:38,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:35:38,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:35:38,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:35:38,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:35:38,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:35:38,253 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2024-10-24 05:35:38,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:35:38,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:35:38,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:35:38,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:35:38,484 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:35:38,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-24 05:35:39,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:35:39,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:35:39,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-24 05:35:39,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1145358/7e9e29ae395e427e81f53cd172cdf587/FLAGc39c9e2bf [2024-10-24 05:35:39,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b1145358/7e9e29ae395e427e81f53cd172cdf587 [2024-10-24 05:35:39,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:35:39,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:35:39,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:35:39,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:35:39,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:35:39,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:35:39" (1/1) ... [2024-10-24 05:35:39,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4d6818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:39, skipping insertion in model container [2024-10-24 05:35:39,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:35:39" (1/1) ... [2024-10-24 05:35:39,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:35:40,087 WARN L248 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_steplocals_file-74.i[917,930] [2024-10-24 05:35:40,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:35:40,137 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:35:40,146 WARN L248 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_steplocals_file-74.i[917,930] [2024-10-24 05:35:40,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:35:40,183 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:35:40,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40 WrapperNode [2024-10-24 05:35:40,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:35:40,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:35:40,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:35:40,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:35:40,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,235 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-24 05:35:40,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:35:40,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:35:40,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:35:40,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:35:40,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,267 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-10-24 05:35:40,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:35:40,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:35:40,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:35:40,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:35:40,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (1/1) ... [2024-10-24 05:35:40,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:35:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:35:40,317 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-10-24 05:35:40,321 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-10-24 05:35:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:35:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:35:40,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:35:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:35:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:35:40,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:35:40,428 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:35:40,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:35:40,692 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 05:35:40,694 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:35:40,718 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:35:40,719 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:35:40,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:35:40 BoogieIcfgContainer [2024-10-24 05:35:40,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:35:40,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:35:40,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:35:40,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:35:40,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:35:39" (1/3) ... [2024-10-24 05:35:40,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18aa0ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:35:40, skipping insertion in model container [2024-10-24 05:35:40,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:40" (2/3) ... [2024-10-24 05:35:40,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18aa0ab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:35:40, skipping insertion in model container [2024-10-24 05:35:40,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:35:40" (3/3) ... [2024-10-24 05:35:40,729 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2024-10-24 05:35:40,743 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:35:40,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:35:40,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:35:40,798 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;@56b7056f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:35:40,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:35:40,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 51 states have internal predecessors, (70), 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-10-24 05:35:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 05:35:40,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:40,812 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] [2024-10-24 05:35:40,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:40,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1914651930, now seen corresponding path program 1 times [2024-10-24 05:35:40,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:35:40,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339601368] [2024-10-24 05:35:40,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:40,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:35:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:35:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:35:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:35:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:35:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:35:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:35:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:35:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:35:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:35:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:35:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:35:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:35:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:35:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:35:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:35:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:35:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:35:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:35:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:35:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:35:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:35:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:35:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:35:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:35:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:35:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:35:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 05:35:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 05:35:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:35:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:35:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339601368] [2024-10-24 05:35:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339601368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:35:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:35:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:35:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452636443] [2024-10-24 05:35:41,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:35:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:35:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:35:41,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:35:41,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:35:41,240 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.4) internal successors, (70), 51 states have internal predecessors, (70), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-10-24 05:35:41,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:35:41,284 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2024-10-24 05:35:41,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:35:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 174 [2024-10-24 05:35:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:35:41,294 INFO L225 Difference]: With dead ends: 159 [2024-10-24 05:35:41,295 INFO L226 Difference]: Without dead ends: 79 [2024-10-24 05:35:41,298 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-10-24 05:35:41,302 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:35:41,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:35:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-24 05:35:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-24 05:35:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.3265306122448979) 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-10-24 05:35:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-10-24 05:35:41,348 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 174 [2024-10-24 05:35:41,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:35:41,350 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-10-24 05:35:41,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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-10-24 05:35:41,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-10-24 05:35:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-24 05:35:41,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:41,353 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] [2024-10-24 05:35:41,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:35:41,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash -154168090, now seen corresponding path program 1 times [2024-10-24 05:35:41,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:35:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962354055] [2024-10-24 05:35:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:35:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:35:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:35:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:35:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:35:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:35:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:35:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:35:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:35:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:35:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:35:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:35:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:35:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:35:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:35:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:35:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:35:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:35:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:35:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:35:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:35:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:35:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:35:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:35:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:35:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:35:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:35:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 05:35:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 05:35:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:35:42,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:35:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962354055] [2024-10-24 05:35:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962354055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:35:42,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:35:42,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:35:42,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516019292] [2024-10-24 05:35:42,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:35:42,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:35:42,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:35:42,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:35:42,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:35:42,222 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-10-24 05:35:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:35:42,329 INFO L93 Difference]: Finished difference Result 184 states and 281 transitions. [2024-10-24 05:35:42,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:35:42,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 174 [2024-10-24 05:35:42,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:35:42,334 INFO L225 Difference]: With dead ends: 184 [2024-10-24 05:35:42,334 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 05:35:42,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:35:42,338 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 29 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:35:42,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 317 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:35:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 05:35:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2024-10-24 05:35:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 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-10-24 05:35:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-10-24 05:35:42,357 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 174 [2024-10-24 05:35:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:35:42,358 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-10-24 05:35:42,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-10-24 05:35:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-10-24 05:35:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 05:35:42,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:42,363 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] [2024-10-24 05:35:42,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:35:42,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:42,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2050882045, now seen corresponding path program 1 times [2024-10-24 05:35:42,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:35:42,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551165514] [2024-10-24 05:35:42,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:35:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:35:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:35:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:35:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:35:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:35:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:35:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:35:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:35:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:35:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:35:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:35:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:35:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:35:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:35:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:35:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:35:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:35:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:35:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:35:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:35:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:35:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:35:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:35:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 05:35:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 05:35:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 05:35:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 05:35:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 05:35:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 05:35:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:35:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551165514] [2024-10-24 05:35:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551165514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:35:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:35:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:35:43,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617103842] [2024-10-24 05:35:43,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:35:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:35:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:35:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:35:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:35:43,069 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (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-10-24 05:35:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:35:43,289 INFO L93 Difference]: Finished difference Result 201 states and 307 transitions. [2024-10-24 05:35:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:35:43,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (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 175 [2024-10-24 05:35:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:35:43,291 INFO L225 Difference]: With dead ends: 201 [2024-10-24 05:35:43,291 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 05:35:43,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:35:43,293 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 69 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:35:43,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 371 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:35:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 05:35:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 79. [2024-10-24 05:35:43,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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-10-24 05:35:43,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-10-24 05:35:43,300 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 175 [2024-10-24 05:35:43,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:35:43,300 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-10-24 05:35:43,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (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-10-24 05:35:43,301 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-10-24 05:35:43,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-24 05:35:43,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:43,303 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-10-24 05:35:43,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:35:43,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:43,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1593706773, now seen corresponding path program 1 times [2024-10-24 05:35:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:35:43,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202383378] [2024-10-24 05:35:43,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:35:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:35:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425266358] [2024-10-24 05:35:43,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:35:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:35:43,357 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-10-24 05:35:43,358 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-10-24 05:35:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:35:43,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:35:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:35:43,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:35:43,758 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:35:43,759 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:35:43,772 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-10-24 05:35:43,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:35:43,970 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 05:35:44,061 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:35:44,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:35:44 BoogieIcfgContainer [2024-10-24 05:35:44,064 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:35:44,065 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:35:44,065 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:35:44,065 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:35:44,065 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:35:40" (3/4) ... [2024-10-24 05:35:44,067 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:35:44,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:35:44,068 INFO L158 Benchmark]: Toolchain (without parser) took 4159.47ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 114.3MB in the beginning and 100.6MB in the end (delta: 13.8MB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2024-10-24 05:35:44,070 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 132.9MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:35:44,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.72ms. Allocated memory is still 169.9MB. Free memory was 114.3MB in the beginning and 99.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 05:35:44,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.35ms. Allocated memory is still 169.9MB. Free memory was 99.1MB in the beginning and 96.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:35:44,070 INFO L158 Benchmark]: Boogie Preprocessor took 48.88ms. Allocated memory is still 169.9MB. Free memory was 96.1MB in the beginning and 92.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 05:35:44,070 INFO L158 Benchmark]: RCFGBuilder took 434.49ms. Allocated memory is still 169.9MB. Free memory was 92.7MB in the beginning and 68.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 05:35:44,071 INFO L158 Benchmark]: TraceAbstraction took 3342.94ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 68.2MB in the beginning and 100.6MB in the end (delta: -32.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2024-10-24 05:35:44,071 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 257.9MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:35:44,072 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.14ms. Allocated memory is still 169.9MB. Free memory was 133.0MB in the beginning and 132.9MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.72ms. Allocated memory is still 169.9MB. Free memory was 114.3MB in the beginning and 99.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.35ms. Allocated memory is still 169.9MB. Free memory was 99.1MB in the beginning and 96.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.88ms. Allocated memory is still 169.9MB. Free memory was 96.1MB in the beginning and 92.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.49ms. Allocated memory is still 169.9MB. Free memory was 92.7MB in the beginning and 68.9MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3342.94ms. Allocated memory was 169.9MB in the beginning and 257.9MB in the end (delta: 88.1MB). Free memory was 68.2MB in the beginning and 100.6MB in the end (delta: -32.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 257.9MB. Free memory is still 100.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] signed long int var_1_2 = -1; [L24] signed long int var_1_3 = -2; [L25] unsigned char var_1_4 = 0; [L26] unsigned long int var_1_5 = 3914692693; [L27] unsigned long int var_1_6 = 32; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 50; [L33] signed long int var_1_12 = 25; [L34] signed long int var_1_13 = 1; [L35] float var_1_15 = 4.75; [L36] unsigned char var_1_16 = 100; [L37] float var_1_17 = 50.1; [L38] float var_1_18 = 100.9; [L39] float var_1_19 = 8.5; [L40] float var_1_20 = 10.625; [L41] float var_1_21 = 0.0; [L42] float var_1_22 = 7.8; [L43] float var_1_23 = 8.25; [L44] double var_1_24 = 5.5; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_3 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] var_1_9 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L114] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0] [L115] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L119] var_1_12 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L120] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_13 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_17 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L130] var_1_19 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L135] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L136] var_1_22 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L138] var_1_23 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET updateVariables() [L153] CALL step() [L48] COND FALSE !(! (var_1_2 >= var_1_3)) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L57] signed long int stepLocal_1 = var_1_3; [L58] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] unsigned long int stepLocal_3 = 5u << (var_1_12 - var_1_13); [L65] unsigned long int stepLocal_2 = var_1_7; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L66] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_4)) [L77] var_1_11 = var_1_12 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L79] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L84] COND FALSE !(\read(var_1_10)) [L87] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] signed long int stepLocal_4 = var_1_12 - var_1_11; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, stepLocal_4=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND TRUE (~ var_1_3) <= stepLocal_4 [L91] var_1_24 = var_1_22 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144-L145] return ((((((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_11 > (var_1_6 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_3) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3221225470, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 806 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 465 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 208 IncrementalHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 341 mSDtfsCounter, 208 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 212 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 39 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 875 NumberOfCodeBlocks, 875 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 520 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 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-10-24 05:35:44,104 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:35:45,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:35:45,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:35:45,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:35:45,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:35:46,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:35:46,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:35:46,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:35:46,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:35:46,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:35:46,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:35:46,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:35:46,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:35:46,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:35:46,018 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:35:46,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:35:46,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:35:46,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:35:46,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:35:46,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:35:46,022 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:35:46,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:35:46,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:35:46,023 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:35:46,023 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:35:46,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:35:46,024 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:35:46,024 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:35:46,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:35:46,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:35:46,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:35:46,025 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:35:46,025 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:35:46,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:35:46,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:35:46,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:35:46,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:35:46,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:35:46,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:35:46,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:35:46,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:35:46,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:35:46,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:35:46,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:35:46,042 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:35:46,042 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2024-10-24 05:35:46,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:35:46,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:35:46,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:35:46,310 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:35:46,311 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:35:46,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-24 05:35:47,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:35:47,742 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:35:47,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2024-10-24 05:35:47,751 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6336da2e/a975cfab7ab947c288ea7b0cc9c4e67d/FLAG5e7733a43 [2024-10-24 05:35:47,766 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6336da2e/a975cfab7ab947c288ea7b0cc9c4e67d [2024-10-24 05:35:47,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:35:47,769 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:35:47,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:35:47,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:35:47,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:35:47,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:35:47" (1/1) ... [2024-10-24 05:35:47,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fef979f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:47, skipping insertion in model container [2024-10-24 05:35:47,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:35:47" (1/1) ... [2024-10-24 05:35:47,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:35:47,939 WARN L248 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_steplocals_file-74.i[917,930] [2024-10-24 05:35:47,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:35:48,021 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:35:48,032 WARN L248 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_steplocals_file-74.i[917,930] [2024-10-24 05:35:48,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:35:48,074 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:35:48,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48 WrapperNode [2024-10-24 05:35:48,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:35:48,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:35:48,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:35:48,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:35:48,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,126 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-10-24 05:35:48,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:35:48,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:35:48,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:35:48,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:35:48,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,157 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-10-24 05:35:48,158 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:35:48,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:35:48,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:35:48,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:35:48,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (1/1) ... [2024-10-24 05:35:48,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:35:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:35:48,209 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-10-24 05:35:48,212 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-10-24 05:35:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:35:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:35:48,247 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:35:48,247 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:35:48,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:35:48,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:35:48,321 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:35:48,322 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:35:50,497 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 05:35:50,497 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:35:50,537 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:35:50,537 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:35:50,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:35:50 BoogieIcfgContainer [2024-10-24 05:35:50,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:35:50,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:35:50,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:35:50,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:35:50,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:35:47" (1/3) ... [2024-10-24 05:35:50,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4588a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:35:50, skipping insertion in model container [2024-10-24 05:35:50,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:35:48" (2/3) ... [2024-10-24 05:35:50,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4588a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:35:50, skipping insertion in model container [2024-10-24 05:35:50,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:35:50" (3/3) ... [2024-10-24 05:35:50,547 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2024-10-24 05:35:50,560 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:35:50,560 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:35:50,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:35:50,616 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;@38f250d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:35:50,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:35:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 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-10-24 05:35:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:35:50,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:50,635 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] [2024-10-24 05:35:50,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:50,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:50,639 INFO L85 PathProgramCache]: Analyzing trace with hash -33743380, now seen corresponding path program 1 times [2024-10-24 05:35:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:35:50,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585393864] [2024-10-24 05:35:50,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:50,653 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-10-24 05:35:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:35:50,655 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-10-24 05:35:50,656 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-10-24 05:35:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:51,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:35:51,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:35:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-24 05:35:51,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:35:51,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:35:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585393864] [2024-10-24 05:35:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585393864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:35:51,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:35:51,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:35:51,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494449739] [2024-10-24 05:35:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:35:51,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:35:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:35:51,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:35:51,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:35:51,085 INFO L87 Difference]: Start difference. First operand has 72 states, 41 states have (on average 1.3902439024390243) internal successors, (57), 42 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) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-10-24 05:35:52,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:35:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:35:52,235 INFO L93 Difference]: Finished difference Result 141 states and 252 transitions. [2024-10-24 05:35:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:35:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 171 [2024-10-24 05:35:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:35:52,260 INFO L225 Difference]: With dead ends: 141 [2024-10-24 05:35:52,261 INFO L226 Difference]: Without dead ends: 70 [2024-10-24 05:35:52,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-10-24 05:35:52,265 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:35:52,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 05:35:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-24 05:35:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-24 05:35:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 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-10-24 05:35:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2024-10-24 05:35:52,306 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 171 [2024-10-24 05:35:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:35:52,307 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2024-10-24 05:35:52,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-10-24 05:35:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2024-10-24 05:35:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:35:52,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:52,310 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] [2024-10-24 05:35:52,323 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-10-24 05:35:52,510 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-10-24 05:35:52,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:52,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1501020576, now seen corresponding path program 1 times [2024-10-24 05:35:52,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:35:52,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415912989] [2024-10-24 05:35:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:52,512 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-10-24 05:35:52,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:35:52,514 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-10-24 05:35:52,514 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-10-24 05:35:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:52,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 05:35:52,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:35:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2024-10-24 05:35:53,167 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:35:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-24 05:35:53,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:35:53,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415912989] [2024-10-24 05:35:53,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415912989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 05:35:53,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:35:53,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 05:35:53,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730474685] [2024-10-24 05:35:53,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:35:53,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:35:53,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:35:53,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:35:53,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:35:53,531 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-24 05:35:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:35:55,383 INFO L93 Difference]: Finished difference Result 146 states and 220 transitions. [2024-10-24 05:35:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 05:35:55,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 171 [2024-10-24 05:35:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:35:55,403 INFO L225 Difference]: With dead ends: 146 [2024-10-24 05:35:55,403 INFO L226 Difference]: Without dead ends: 77 [2024-10-24 05:35:55,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 334 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 05:35:55,405 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 71 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 05:35:55,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 147 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 05:35:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-24 05:35:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-10-24 05:35:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-24 05:35:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2024-10-24 05:35:55,416 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 171 [2024-10-24 05:35:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:35:55,416 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2024-10-24 05:35:55,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2024-10-24 05:35:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2024-10-24 05:35:55,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:35:55,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:35:55,418 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] [2024-10-24 05:35:55,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 05:35:55,619 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-10-24 05:35:55,619 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:35:55,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:35:55,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1558278878, now seen corresponding path program 1 times [2024-10-24 05:35:55,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:35:55,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425273900] [2024-10-24 05:35:55,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:55,621 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-10-24 05:35:55,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:35:55,623 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-10-24 05:35:55,625 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-10-24 05:35:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:55,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 05:35:55,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:35:56,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1005 proven. 108 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-24 05:35:56,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:35:57,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:35:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425273900] [2024-10-24 05:35:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425273900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:35:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [243168123] [2024-10-24 05:35:57,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:35:57,167 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 05:35:57,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 05:35:57,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 05:35:57,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-24 05:35:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:35:58,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 05:35:58,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:35:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1005 proven. 108 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-24 05:35:58,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:35:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [243168123] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:35:59,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 05:35:59,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2024-10-24 05:35:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463700666] [2024-10-24 05:35:59,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 05:35:59,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 05:35:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:35:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 05:35:59,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-10-24 05:35:59,100 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-24 05:36:01,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:36:03,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 05:36:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:36:03,898 INFO L93 Difference]: Finished difference Result 203 states and 275 transitions. [2024-10-24 05:36:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-24 05:36:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 171 [2024-10-24 05:36:03,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:36:03,902 INFO L225 Difference]: With dead ends: 203 [2024-10-24 05:36:03,902 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 05:36:03,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2024-10-24 05:36:03,905 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 141 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:36:03,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 319 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 05:36:03,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 05:36:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 107. [2024-10-24 05:36:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:36:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 144 transitions. [2024-10-24 05:36:03,926 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 144 transitions. Word has length 171 [2024-10-24 05:36:03,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:36:03,927 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 144 transitions. [2024-10-24 05:36:03,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 states have internal predecessors, (49), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2024-10-24 05:36:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2024-10-24 05:36:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 05:36:03,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:36:03,932 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] [2024-10-24 05:36:03,947 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 (4)] Ended with exit code 0 [2024-10-24 05:36:04,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-24 05:36:04,332 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-24 05:36:04,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:36:04,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:36:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1558219296, now seen corresponding path program 1 times [2024-10-24 05:36:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:36:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889809659] [2024-10-24 05:36:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:36:04,334 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-10-24 05:36:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:36:04,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:36:04,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 05:36:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:36:04,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 05:36:04,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:36:37,403 WARN L286 SmtUtils]: Spent 11.18s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)