./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_normal_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:22:10,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:22:10,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:22:10,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:22:10,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:22:10,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:22:10,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:22:10,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:22:10,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:22:10,317 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:22:10,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:22:10,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:22:10,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:22:10,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:22:10,318 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:22:10,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:22:10,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:22:10,320 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:22:10,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:22:10,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:22:10,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:22:10,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:22:10,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:22:10,323 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:22:10,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:22:10,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:22:10,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:22:10,324 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:22:10,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:22:10,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:22:10,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:22:10,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:22:10,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:22:10,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:22:10,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:22:10,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:22:10,327 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:22:10,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:22:10,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:22:10,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:22:10,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:22:10,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:22:10,328 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-clean/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-clean/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 -> bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf [2024-10-11 07:22:10,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:22:10,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:22:10,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:22:10,538 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:22:10,538 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:22:10,539 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2024-10-11 07:22:11,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:22:11,933 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:22:11,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2024-10-11 07:22:11,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ea815c26/c290eff7a36a4187bb34902249b8e10d/FLAG0cdd6e418 [2024-10-11 07:22:11,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ea815c26/c290eff7a36a4187bb34902249b8e10d [2024-10-11 07:22:11,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:22:11,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:22:11,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:22:11,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:22:11,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:22:11,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:11" (1/1) ... [2024-10-11 07:22:11,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27698a1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:11, skipping insertion in model container [2024-10-11 07:22:11,966 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:11" (1/1) ... [2024-10-11 07:22:11,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:22:12,135 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_normal_file-51.i[913,926] [2024-10-11 07:22:12,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:22:12,207 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:22:12,234 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_normal_file-51.i[913,926] [2024-10-11 07:22:12,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:22:12,304 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:22:12,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12 WrapperNode [2024-10-11 07:22:12,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:22:12,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:22:12,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:22:12,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:22:12,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,344 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2024-10-11 07:22:12,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:22:12,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:22:12,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:22:12,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:22:12,354 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,366 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-11 07:22:12,371 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,380 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:22:12,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:22:12,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:22:12,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:22:12,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (1/1) ... [2024-10-11 07:22:12,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:22:12,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:22:12,415 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:22:12,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:22:12,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:22:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:22:12,454 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:22:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:22:12,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:22:12,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:22:12,521 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:22:12,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:22:12,740 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:22:12,740 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:22:12,780 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:22:12,780 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:22:12,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:12 BoogieIcfgContainer [2024-10-11 07:22:12,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:22:12,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:22:12,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:22:12,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:22:12,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:22:11" (1/3) ... [2024-10-11 07:22:12,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e06fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:22:12, skipping insertion in model container [2024-10-11 07:22:12,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:12" (2/3) ... [2024-10-11 07:22:12,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48e06fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:22:12, skipping insertion in model container [2024-10-11 07:22:12,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:12" (3/3) ... [2024-10-11 07:22:12,789 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-51.i [2024-10-11 07:22:12,802 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:22:12,803 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:22:12,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:22:12,867 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;@7c1b28db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:22:12,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:22:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:22:12,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 07:22:12,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:22:12,887 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:22:12,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:22:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:22:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash -635921128, now seen corresponding path program 1 times [2024-10-11 07:22:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:22:12,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479249980] [2024-10-11 07:22:12,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:12,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:22:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:22:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:22:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:22:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:22:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:22:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:22:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:22:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:22:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:22:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:22:13,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:22:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:22:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:22:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:22:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:22:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:22:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:22:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:22:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:22:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:22:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:22:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:22:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:22:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:22:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 07:22:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:22:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 07:22:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:22:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:22:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 07:22:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 07:22:13,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:22:13,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479249980] [2024-10-11 07:22:13,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479249980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:22:13,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:22:13,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:22:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026073891] [2024-10-11 07:22:13,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:22:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:22:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:22:13,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:22:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:22:13,418 INFO L87 Difference]: Start difference. First operand has 72 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 07:22:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:22:13,508 INFO L93 Difference]: Finished difference Result 184 states and 346 transitions. [2024-10-11 07:22:13,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:22:13,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 178 [2024-10-11 07:22:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:22:13,518 INFO L225 Difference]: With dead ends: 184 [2024-10-11 07:22:13,519 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 07:22:13,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:22:13,527 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 62 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:22:13,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 209 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:22:13,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 07:22:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-10-11 07:22:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 07:22:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-11 07:22:13,586 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 178 [2024-10-11 07:22:13,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:22:13,587 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-11 07:22:13,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 07:22:13,588 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-11 07:22:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:22:13,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:22:13,593 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:22:13,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:22:13,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:22:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:22:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1510080036, now seen corresponding path program 1 times [2024-10-11 07:22:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:22:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408753903] [2024-10-11 07:22:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:22:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:22:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:22:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:22:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:22:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:22:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:22:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:22:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 07:22:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:22:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 07:22:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:22:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 07:22:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:22:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 07:22:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:22:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 07:22:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:22:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:22:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:22:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:22:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:22:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:22:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:22:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:22:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 07:22:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:22:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 07:22:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:22:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:22:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 07:22:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:22:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:22:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408753903] [2024-10-11 07:22:14,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408753903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:22:14,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455663080] [2024-10-11 07:22:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:22:14,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:22:14,123 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:22:14,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:22:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:14,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 07:22:14,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:22:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-11 07:22:14,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:22:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-11 07:22:14,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455663080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:22:14,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:22:14,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 07:22:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276283257] [2024-10-11 07:22:14,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:22:14,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:22:14,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:22:14,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:22:14,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:22:14,634 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2024-10-11 07:22:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:22:14,817 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2024-10-11 07:22:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:22:14,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 179 [2024-10-11 07:22:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:22:14,821 INFO L225 Difference]: With dead ends: 231 [2024-10-11 07:22:14,821 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 07:22:14,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:22:14,824 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:22:14,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 153 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:22:14,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 07:22:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-10-11 07:22:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 67 states have internal predecessors, (83), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 07:22:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 177 transitions. [2024-10-11 07:22:14,847 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 177 transitions. Word has length 179 [2024-10-11 07:22:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:22:14,848 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 177 transitions. [2024-10-11 07:22:14,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2024-10-11 07:22:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 177 transitions. [2024-10-11 07:22:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:22:14,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:22:14,851 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:22:14,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:22:15,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:22:15,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:22:15,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:22:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1009879898, now seen corresponding path program 1 times [2024-10-11 07:22:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:22:15,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842028040] [2024-10-11 07:22:15,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:15,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:22:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:22:15,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:22:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:22:15,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:22:15,271 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:22:15,274 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:22:15,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:22:15,278 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:22:15,367 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:22:15,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:22:15 BoogieIcfgContainer [2024-10-11 07:22:15,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:22:15,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:22:15,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:22:15,373 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:22:15,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:12" (3/4) ... [2024-10-11 07:22:15,376 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:22:15,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:22:15,378 INFO L158 Benchmark]: Toolchain (without parser) took 3419.12ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 96.3MB in the beginning and 158.1MB in the end (delta: -61.8MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-10-11 07:22:15,379 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:22:15,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.60ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 136.7MB in the end (delta: -40.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-10-11 07:22:15,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.67ms. Allocated memory is still 167.8MB. Free memory was 136.7MB in the beginning and 134.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:22:15,380 INFO L158 Benchmark]: Boogie Preprocessor took 40.78ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 130.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:22:15,380 INFO L158 Benchmark]: RCFGBuilder took 394.85ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 106.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 07:22:15,380 INFO L158 Benchmark]: TraceAbstraction took 2588.69ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 106.0MB in the beginning and 158.1MB in the end (delta: -52.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-10-11 07:22:15,380 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 239.1MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:22:15,381 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 167.8MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.60ms. Allocated memory is still 167.8MB. Free memory was 96.3MB in the beginning and 136.7MB in the end (delta: -40.4MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.67ms. Allocated memory is still 167.8MB. Free memory was 136.7MB in the beginning and 134.1MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.78ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 130.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 394.85ms. Allocated memory is still 167.8MB. Free memory was 130.3MB in the beginning and 106.8MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2588.69ms. Allocated memory was 167.8MB in the beginning and 239.1MB in the end (delta: 71.3MB). Free memory was 106.0MB in the beginning and 158.1MB in the end (delta: -52.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 239.1MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned long int var_1_2 = 32; [L24] unsigned long int var_1_3 = 128; [L25] double var_1_4 = 32.3; [L26] double var_1_5 = 0.25; [L27] double var_1_6 = 500.6; [L28] unsigned char var_1_7 = 2; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = 5; [L31] signed char var_1_10 = 4; [L32] signed char var_1_11 = 100; [L33] unsigned long int var_1_12 = 8; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L36] unsigned long int var_1_15 = 1114432789; [L37] unsigned long int var_1_16 = 2; [L38] double var_1_17 = 256.8; [L39] double var_1_18 = 1.25; [L40] unsigned long int var_1_19 = 16; [L41] unsigned char var_1_21 = 1; [L42] double var_1_22 = -0.5; [L43] unsigned char var_1_23 = 0; [L44] unsigned char var_1_24 = 1; [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] FCALL updateLastVariables() [L155] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L97] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L99] var_1_3 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L100] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_4 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_5 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] var_1_6 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L107] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L108] var_1_7 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L110] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L110] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L111] var_1_9 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L113] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L113] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L114] var_1_10 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=125, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L116] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L116] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=125, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L117] var_1_11 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L119] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L119] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L122] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L122] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L123] var_1_14 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L124] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L125] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L125] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L127] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L128] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L128] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L130] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L131] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L131] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L132] var_1_18 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L133] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L135] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L136] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L136] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L140] var_1_24 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L141] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L142] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L142] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=126] [L155] RET updateVariables() [L156] CALL step() [L48] COND FALSE !(32u >= var_1_2) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-10, var_1_9=126] [L57] COND TRUE ! (var_1_6 > var_1_5) [L58] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-1, var_1_9=126] [L62] COND TRUE var_1_13 && var_1_14 [L63] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-1, var_1_9=126] [L69] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-1, var_1_9=126] [L72] COND TRUE var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-1, var_1_9=126] [L73] COND FALSE !(var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) [L76] var_1_19 = var_1_11 VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=126, var_1_1=-2, var_1_21=1, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-1, var_1_9=126] [L81] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L92] var_1_21 = var_1_23 VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=126, var_1_1=-2, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-1, var_1_9=126] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((32u >= var_1_2) ? ((var_1_2 <= var_1_3) ? (((var_1_4 - var_1_5) >= var_1_6) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_6 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_13 && var_1_14) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_13 ? (var_1_12 == ((unsigned long int) (((((var_1_1) > ((var_1_11 + var_1_7))) ? (var_1_1) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_16)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18)) ? ((var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) ? (var_1_19 == ((unsigned long int) var_1_16)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) var_1_16)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_2 < var_1_3) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=126, var_1_1=-2, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=-2, var_1_8=-1, var_1_9=126] [L19] reach_error() VAL [isInitial=1, var_1_10=125, var_1_11=126, var_1_12=126, var_1_13=1, var_1_14=1, var_1_15=-3221225473, var_1_16=-3221225473, var_1_17=1284/5, var_1_19=126, var_1_1=-2, var_1_21=-256, var_1_23=-256, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=-2, var_1_8=-1, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 122 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 362 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 187 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 177 mSDtfsCounter, 187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 486 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 1131 SizeOfPredicates, 3 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 6816/6960 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-11 07:22:15,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:22:17,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:22:17,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:22:17,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:22:17,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:22:17,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:22:17,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:22:17,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:22:17,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:22:17,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:22:17,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:22:17,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:22:17,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:22:17,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:22:17,329 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:22:17,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:22:17,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:22:17,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:22:17,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:22:17,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:22:17,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:22:17,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:22:17,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:22:17,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:22:17,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:22:17,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:22:17,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:22:17,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:22:17,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:22:17,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:22:17,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:22:17,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:22:17,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:22:17,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:22:17,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:22:17,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:22:17,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:22:17,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:22:17,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:22:17,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:22:17,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:22:17,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:22:17,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:22:17,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:22:17,336 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:22:17,336 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-clean/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-clean/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 -> bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf [2024-10-11 07:22:17,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:22:17,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:22:17,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:22:17,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:22:17,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:22:17,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2024-10-11 07:22:18,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:22:19,070 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:22:19,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2024-10-11 07:22:19,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/132e895bd/34bd4f16044b4827b3064edfbcbb1194/FLAG424b551c9 [2024-10-11 07:22:19,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/132e895bd/34bd4f16044b4827b3064edfbcbb1194 [2024-10-11 07:22:19,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:22:19,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:22:19,467 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:22:19,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:22:19,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:22:19,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dac585e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19, skipping insertion in model container [2024-10-11 07:22:19,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:22:19,644 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_normal_file-51.i[913,926] [2024-10-11 07:22:19,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:22:19,720 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:22:19,730 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_normal_file-51.i[913,926] [2024-10-11 07:22:19,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:22:19,782 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:22:19,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19 WrapperNode [2024-10-11 07:22:19,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:22:19,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:22:19,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:22:19,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:22:19,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,834 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2024-10-11 07:22:19,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:22:19,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:22:19,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:22:19,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:22:19,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,862 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-11 07:22:19,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:22:19,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:22:19,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:22:19,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:22:19,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (1/1) ... [2024-10-11 07:22:19,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:22:19,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:22:19,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:22:19,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:22:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:22:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:22:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:22:19,971 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:22:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:22:19,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:22:20,045 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:22:20,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:22:33,333 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:22:33,334 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:22:33,370 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:22:33,371 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:22:33,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:33 BoogieIcfgContainer [2024-10-11 07:22:33,371 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:22:33,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:22:33,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:22:33,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:22:33,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:22:19" (1/3) ... [2024-10-11 07:22:33,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cf706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:22:33, skipping insertion in model container [2024-10-11 07:22:33,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:22:19" (2/3) ... [2024-10-11 07:22:33,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61cf706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:22:33, skipping insertion in model container [2024-10-11 07:22:33,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:22:33" (3/3) ... [2024-10-11 07:22:33,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-51.i [2024-10-11 07:22:33,390 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:22:33,391 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:22:33,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:22:33,450 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;@57d0dd57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:22:33,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:22:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 07:22:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 07:22:33,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:22:33,472 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:22:33,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:22:33,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:22:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -635921128, now seen corresponding path program 1 times [2024-10-11 07:22:33,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:22:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129708031] [2024-10-11 07:22:33,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:33,487 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-11 07:22:33,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:22:33,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 07:22:33,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:22:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:34,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 07:22:34,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:22:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-11 07:22:36,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:22:36,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:22:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129708031] [2024-10-11 07:22:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129708031] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:22:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1366203517] [2024-10-11 07:22:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:36,961 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 07:22:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 07:22:36,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 07:22:36,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-10-11 07:22:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:37,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:22:37,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:22:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 07:22:37,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:22:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1366203517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:22:37,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 07:22:37,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-11 07:22:37,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603931570] [2024-10-11 07:22:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:22:37,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:22:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:22:37,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:22:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:22:37,485 INFO L87 Difference]: Start difference. First operand has 72 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 07:22:41,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:22:45,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:22:49,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:22:49,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:22:49,384 INFO L93 Difference]: Finished difference Result 184 states and 346 transitions. [2024-10-11 07:22:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:22:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 178 [2024-10-11 07:22:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:22:49,394 INFO L225 Difference]: With dead ends: 184 [2024-10-11 07:22:49,395 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 07:22:49,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:22:49,399 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 62 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:22:49,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 208 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 11.9s Time] [2024-10-11 07:22:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 07:22:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-10-11 07:22:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.3166666666666667) internal successors, (79), 61 states have internal predecessors, (79), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 07:22:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-11 07:22:49,450 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 178 [2024-10-11 07:22:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:22:49,452 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-11 07:22:49,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 07:22:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-11 07:22:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:22:49,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:22:49,457 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:22:49,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:22:49,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-10-11 07:22:49,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 07:22:49,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:22:49,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:22:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1510080036, now seen corresponding path program 1 times [2024-10-11 07:22:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:22:49,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118843432] [2024-10-11 07:22:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:49,861 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-11 07:22:49,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:22:49,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 07:22:49,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:22:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:50,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 07:22:50,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:22:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-11 07:22:52,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:22:52,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:22:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118843432] [2024-10-11 07:22:52,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118843432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:22:52,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246157354] [2024-10-11 07:22:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:22:52,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 07:22:52,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 07:22:52,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 07:22:52,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-11 07:22:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:22:54,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:22:54,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:22:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-11 07:22:56,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:22:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1246157354] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:22:56,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:22:56,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-10-11 07:22:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723329259] [2024-10-11 07:22:56,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:22:56,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:22:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:22:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:22:56,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:22:56,541 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:23:02,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:23:06,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:23:09,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:23:09,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:23:09,606 INFO L93 Difference]: Finished difference Result 231 states and 355 transitions. [2024-10-11 07:23:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:23:09,693 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), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 179 [2024-10-11 07:23:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:23:09,696 INFO L225 Difference]: With dead ends: 231 [2024-10-11 07:23:09,696 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 07:23:09,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:23:09,698 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 47 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:23:09,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 151 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 12.8s Time] [2024-10-11 07:23:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 07:23:09,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2024-10-11 07:23:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 67 states have internal predecessors, (83), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 07:23:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 177 transitions. [2024-10-11 07:23:09,713 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 177 transitions. Word has length 179 [2024-10-11 07:23:09,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:23:09,714 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 177 transitions. [2024-10-11 07:23:09,714 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), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 07:23:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 177 transitions. [2024-10-11 07:23:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 07:23:09,716 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:23:09,716 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 07:23:09,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-10-11 07:23:09,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 07:23:10,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,4 /storage/repos/ultimate-clean/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-11 07:23:10,117 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:23:10,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:23:10,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1009879898, now seen corresponding path program 1 times [2024-10-11 07:23:10,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:23:10,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54312436] [2024-10-11 07:23:10,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:23:10,119 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-11 07:23:10,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:23:10,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 07:23:10,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 07:23:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:23:10,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-11 07:23:10,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:23:29,305 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 07:23:37,697 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 07:23:46,081 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 07:23:54,474 WARN L286 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)