./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_fillercode_fillercodestructure_filler-ps-co_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:36:47,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:36:47,607 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:36:47,613 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:36:47,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:36:47,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:36:47,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:36:47,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:36:47,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:36:47,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:36:47,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:36:47,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:36:47,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:36:47,668 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:36:47,670 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:36:47,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:36:47,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:36:47,671 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:36:47,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:36:47,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:36:47,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:36:47,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:36:47,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:36:47,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:36:47,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:36:47,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:36:47,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:36:47,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:36:47,679 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:36:47,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:36:47,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:36:47,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:36:47,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:36:47,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:36:47,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:36:47,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:36:47,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:36:47,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:36:47,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:36:47,682 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:36:47,682 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:36:47,682 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:36:47,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a [2024-10-14 10:36:47,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:36:48,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:36:48,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:36:48,022 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:36:48,023 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:36:48,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2024-10-14 10:36:49,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:36:49,727 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:36:49,728 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2024-10-14 10:36:49,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86e4948c/8cbd4f164a914d92b2caee800bd93c57/FLAG9f197ac91 [2024-10-14 10:36:49,759 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86e4948c/8cbd4f164a914d92b2caee800bd93c57 [2024-10-14 10:36:49,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:36:49,763 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:36:49,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:36:49,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:36:49,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:36:49,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:36:49" (1/1) ... [2024-10-14 10:36:49,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8160d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:49, skipping insertion in model container [2024-10-14 10:36:49,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:36:49" (1/1) ... [2024-10-14 10:36:49,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:36:49,956 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_fillercode_fillercodestructure_filler-ps-co_file-89.i[919,932] [2024-10-14 10:36:50,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:36:50,053 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:36:50,066 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_fillercode_fillercodestructure_filler-ps-co_file-89.i[919,932] [2024-10-14 10:36:50,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:36:50,154 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:36:50,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50 WrapperNode [2024-10-14 10:36:50,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:36:50,160 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:36:50,160 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:36:50,160 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:36:50,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,236 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-14 10:36:50,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:36:50,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:36:50,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:36:50,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:36:50,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,293 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-14 10:36:50,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:36:50,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:36:50,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:36:50,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:36:50,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (1/1) ... [2024-10-14 10:36:50,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:36:50,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:36:50,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:36:50,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:36:50,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:36:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:36:50,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:36:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:36:50,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:36:50,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:36:50,507 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:36:50,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:36:50,975 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:36:50,976 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:36:51,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:36:51,058 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:36:51,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:36:51 BoogieIcfgContainer [2024-10-14 10:36:51,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:36:51,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:36:51,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:36:51,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:36:51,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:36:49" (1/3) ... [2024-10-14 10:36:51,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22739b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:36:51, skipping insertion in model container [2024-10-14 10:36:51,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:50" (2/3) ... [2024-10-14 10:36:51,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22739b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:36:51, skipping insertion in model container [2024-10-14 10:36:51,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:36:51" (3/3) ... [2024-10-14 10:36:51,072 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2024-10-14 10:36:51,089 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:36:51,089 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:36:51,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:36:51,163 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;@605b4d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:36:51,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:36:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 55 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:36:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 10:36:51,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:36:51,182 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:36:51,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:36:51,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:36:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash 246601907, now seen corresponding path program 1 times [2024-10-14 10:36:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:36:51,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103923738] [2024-10-14 10:36:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:36:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:36:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:36:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:36:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:36:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:36:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:36:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:36:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:36:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:36:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:36:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:36:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:36:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:36:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:36:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:36:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:36:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:36:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:36:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:36:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:36:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:36:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:36:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:36:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:36:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103923738] [2024-10-14 10:36:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103923738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:36:51,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:36:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:36:51,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407810160] [2024-10-14 10:36:51,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:36:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:36:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:36:51,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:36:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:36:51,752 INFO L87 Difference]: Start difference. First operand has 79 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 55 states have internal predecessors, (87), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:36:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:36:51,804 INFO L93 Difference]: Finished difference Result 155 states and 282 transitions. [2024-10-14 10:36:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:36:51,808 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-10-14 10:36:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:36:51,815 INFO L225 Difference]: With dead ends: 155 [2024-10-14 10:36:51,815 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 10:36:51,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:36:51,824 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:36:51,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:36:51,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 10:36:51,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 10:36:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 53 states have internal predecessors, (82), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:36:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 126 transitions. [2024-10-14 10:36:51,879 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 126 transitions. Word has length 144 [2024-10-14 10:36:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:36:51,881 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 126 transitions. [2024-10-14 10:36:51,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:36:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 126 transitions. [2024-10-14 10:36:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 10:36:51,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:36:51,885 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:36:51,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:36:51,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:36:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:36:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1303271155, now seen corresponding path program 1 times [2024-10-14 10:36:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:36:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846888411] [2024-10-14 10:36:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:51,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:36:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:36:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:36:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:36:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:36:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:36:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:36:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:36:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:36:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:36:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:36:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:36:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:36:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:36:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:36:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:36:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:36:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:36:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:36:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:36:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:36:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:36:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:36:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:36:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:36:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846888411] [2024-10-14 10:36:52,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846888411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:36:52,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:36:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:36:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786230408] [2024-10-14 10:36:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:36:52,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:36:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:36:52,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:36:52,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:36:52,297 INFO L87 Difference]: Start difference. First operand 77 states and 126 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:36:52,413 INFO L93 Difference]: Finished difference Result 223 states and 364 transitions. [2024-10-14 10:36:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:36:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 10:36:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:36:52,416 INFO L225 Difference]: With dead ends: 223 [2024-10-14 10:36:52,417 INFO L226 Difference]: Without dead ends: 147 [2024-10-14 10:36:52,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-14 10:36:52,419 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 110 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:36:52,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 288 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:36:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-14 10:36:52,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 143. [2024-10-14 10:36:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.4583333333333333) internal successors, (140), 96 states have internal predecessors, (140), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:36:52,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 228 transitions. [2024-10-14 10:36:52,461 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 228 transitions. Word has length 144 [2024-10-14 10:36:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:36:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 228 transitions. [2024-10-14 10:36:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 228 transitions. [2024-10-14 10:36:52,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 10:36:52,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:36:52,465 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:36:52,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:36:52,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:36:52,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:36:52,467 INFO L85 PathProgramCache]: Analyzing trace with hash -292643661, now seen corresponding path program 1 times [2024-10-14 10:36:52,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:36:52,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317621910] [2024-10-14 10:36:52,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:36:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:36:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:36:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:36:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:36:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:36:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:36:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:36:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:36:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:36:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:36:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:36:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:36:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:36:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:36:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:36:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:36:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:36:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:36:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:36:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:36:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:36:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:36:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:36:52,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:36:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317621910] [2024-10-14 10:36:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317621910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:36:52,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:36:52,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:36:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655099365] [2024-10-14 10:36:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:36:52,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:36:52,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:36:52,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:36:52,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:36:52,761 INFO L87 Difference]: Start difference. First operand 143 states and 228 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:52,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:36:52,872 INFO L93 Difference]: Finished difference Result 292 states and 466 transitions. [2024-10-14 10:36:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:36:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 10:36:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:36:52,878 INFO L225 Difference]: With dead ends: 292 [2024-10-14 10:36:52,879 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 10:36:52,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-14 10:36:52,881 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:36:52,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 217 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:36:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 10:36:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2024-10-14 10:36:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:36:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 227 transitions. [2024-10-14 10:36:52,921 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 227 transitions. Word has length 144 [2024-10-14 10:36:52,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:36:52,924 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 227 transitions. [2024-10-14 10:36:52,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:52,925 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 227 transitions. [2024-10-14 10:36:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 10:36:52,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:36:52,927 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:36:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:36:52,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:36:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:36:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1296134415, now seen corresponding path program 1 times [2024-10-14 10:36:52,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:36:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635918676] [2024-10-14 10:36:52,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:52,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:36:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:36:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:36:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:36:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:36:53,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:36:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:36:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:36:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:36:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:36:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:36:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:36:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:36:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:36:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:36:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:36:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:36:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:36:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:36:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:36:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:36:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:36:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:36:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,322 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:36:53,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:36:53,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635918676] [2024-10-14 10:36:53,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635918676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:36:53,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:36:53,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:36:53,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809926552] [2024-10-14 10:36:53,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:36:53,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:36:53,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:36:53,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:36:53,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:36:53,325 INFO L87 Difference]: Start difference. First operand 146 states and 227 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:53,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:36:53,397 INFO L93 Difference]: Finished difference Result 347 states and 540 transitions. [2024-10-14 10:36:53,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:36:53,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 10:36:53,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:36:53,401 INFO L225 Difference]: With dead ends: 347 [2024-10-14 10:36:53,401 INFO L226 Difference]: Without dead ends: 202 [2024-10-14 10:36:53,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:36:53,405 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 49 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:36:53,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 335 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:36:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-14 10:36:53,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 191. [2024-10-14 10:36:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 121 states have (on average 1.3636363636363635) internal successors, (165), 121 states have internal predecessors, (165), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:36:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 297 transitions. [2024-10-14 10:36:53,449 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 297 transitions. Word has length 144 [2024-10-14 10:36:53,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:36:53,450 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 297 transitions. [2024-10-14 10:36:53,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 297 transitions. [2024-10-14 10:36:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 10:36:53,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:36:53,456 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:36:53,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:36:53,456 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:36:53,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:36:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1956442861, now seen corresponding path program 1 times [2024-10-14 10:36:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:36:53,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829830365] [2024-10-14 10:36:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:36:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:36:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:36:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:36:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:36:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 10:36:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:36:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 10:36:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:36:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 10:36:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:36:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 10:36:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:36:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:36:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:36:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:36:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:36:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:36:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:36:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:36:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:36:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:36:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:36:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:36:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:36:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:36:53,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829830365] [2024-10-14 10:36:53,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829830365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:36:53,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:36:53,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:36:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11493471] [2024-10-14 10:36:53,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:36:53,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:36:53,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:36:53,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:36:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:36:53,882 INFO L87 Difference]: Start difference. First operand 191 states and 297 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:53,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:36:53,997 INFO L93 Difference]: Finished difference Result 485 states and 755 transitions. [2024-10-14 10:36:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:36:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-14 10:36:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:36:54,004 INFO L225 Difference]: With dead ends: 485 [2024-10-14 10:36:54,004 INFO L226 Difference]: Without dead ends: 336 [2024-10-14 10:36:54,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-14 10:36:54,007 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 83 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:36:54,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 202 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:36:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-14 10:36:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 329. [2024-10-14 10:36:54,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 213 states have (on average 1.3615023474178405) internal successors, (290), 213 states have internal predecessors, (290), 110 states have call successors, (110), 5 states have call predecessors, (110), 5 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-14 10:36:54,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 510 transitions. [2024-10-14 10:36:54,072 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 510 transitions. Word has length 145 [2024-10-14 10:36:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:36:54,073 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 510 transitions. [2024-10-14 10:36:54,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:36:54,073 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 510 transitions. [2024-10-14 10:36:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-14 10:36:54,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:36:54,075 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:36:54,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:36:54,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:36:54,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:36:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash 291157632, now seen corresponding path program 1 times [2024-10-14 10:36:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:36:54,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294786531] [2024-10-14 10:36:54,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:36:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:36:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [923980424] [2024-10-14 10:36:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:36:54,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:36:54,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:36:54,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:36:54,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:36:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:36:54,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:36:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:36:54,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:36:54,460 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:36:54,461 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:36:54,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 10:36:54,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 10:36:54,666 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 10:36:54,798 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:36:54,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:36:54 BoogieIcfgContainer [2024-10-14 10:36:54,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:36:54,802 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:36:54,802 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:36:54,802 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:36:54,803 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:36:51" (3/4) ... [2024-10-14 10:36:54,805 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:36:54,806 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:36:54,807 INFO L158 Benchmark]: Toolchain (without parser) took 5043.81ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 127.0MB in the beginning and 89.2MB in the end (delta: 37.8MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. [2024-10-14 10:36:54,807 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:36:54,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.62ms. Allocated memory is still 184.5MB. Free memory was 126.9MB in the beginning and 110.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 10:36:54,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.53ms. Allocated memory is still 184.5MB. Free memory was 110.2MB in the beginning and 106.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:36:54,808 INFO L158 Benchmark]: Boogie Preprocessor took 100.57ms. Allocated memory is still 184.5MB. Free memory was 106.0MB in the beginning and 99.6MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:36:54,808 INFO L158 Benchmark]: RCFGBuilder took 719.72ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 99.6MB in the beginning and 227.4MB in the end (delta: -127.7MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-10-14 10:36:54,809 INFO L158 Benchmark]: TraceAbstraction took 3738.68ms. Allocated memory is still 264.2MB. Free memory was 226.3MB in the beginning and 90.2MB in the end (delta: 136.1MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. [2024-10-14 10:36:54,811 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 264.2MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:36:54,812 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.18ms. Allocated memory is still 184.5MB. Free memory is still 151.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.62ms. Allocated memory is still 184.5MB. Free memory was 126.9MB in the beginning and 110.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.53ms. Allocated memory is still 184.5MB. Free memory was 110.2MB in the beginning and 106.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.57ms. Allocated memory is still 184.5MB. Free memory was 106.0MB in the beginning and 99.6MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 719.72ms. Allocated memory was 184.5MB in the beginning and 264.2MB in the end (delta: 79.7MB). Free memory was 99.6MB in the beginning and 227.4MB in the end (delta: -127.7MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3738.68ms. Allocated memory is still 264.2MB. Free memory was 226.3MB in the beginning and 90.2MB in the end (delta: 136.1MB). Peak memory consumption was 136.1MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 264.2MB. Free memory is still 89.2MB. 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 188, overapproximation of someBinaryFLOATComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] unsigned char var_1_23 = 16; [L36] signed short int var_1_24 = -1; [L37] signed short int var_1_25 = 2; [L38] unsigned char var_1_26 = 100; [L39] unsigned char var_1_29 = 128; [L40] unsigned char var_1_30 = 64; [L41] signed char var_1_31 = -1; [L42] unsigned short int var_1_32 = 100; [L43] unsigned long int var_1_33 = 0; [L44] float var_1_36 = 16.8; [L45] signed char var_1_38 = 0; [L46] signed long int var_1_39 = -4; [L47] unsigned short int var_1_40 = 256; [L48] signed long int last_1_var_1_1 = 32; [L49] unsigned char last_1_var_1_12 = 32; [L50] signed short int last_1_var_1_18 = -64; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_18 = var_1_18 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L150] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L150] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L151] var_1_9 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L152] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L155] var_1_10 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L158] var_1_13 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L159] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L162] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L169] var_1_25 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] CALL assume_abort_if_not(var_1_25 <= 9) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] RET assume_abort_if_not(var_1_25 <= 9) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L172] var_1_29 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_29 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L173] RET assume_abort_if_not(var_1_29 >= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L175] var_1_30 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_30 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L176] RET assume_abort_if_not(var_1_30 >= 63) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L177] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L177] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L178] var_1_36 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L179] RET assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L180] CALL assume_abort_if_not(var_1_36 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L180] RET assume_abort_if_not(var_1_36 != 0.0F) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L196] RET updateVariables() [L197] CALL step() [L54] EXPR var_1_12 & var_1_1 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L54] COND TRUE (var_1_12 & var_1_1) >= var_1_8 [L55] var_1_19 = var_1_23 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L57] EXPR var_1_18 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L57] COND TRUE ((((var_1_12) < (25)) ? (var_1_12) : (25))) > (var_1_18 >> ((((var_1_25) < (1)) ? (var_1_25) : (1)))) [L58] COND TRUE var_1_8 >= var_1_23 [L59] var_1_24 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L64] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L67] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L72] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L81] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L85] COND FALSE !(var_1_23 > var_1_1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L90] var_1_38 = var_1_25 [L91] var_1_39 = var_1_30 [L92] var_1_40 = var_1_30 [L93] signed long int stepLocal_1 = last_1_var_1_18; [L94] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L95] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L102] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L104] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L105] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L116] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L117] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L128] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L133] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L140] COND FALSE !(\read(var_1_14)) [L143] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=32, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 1165 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 643 mSDtfsCounter, 122 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=5, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 716 ConstructedInterpolants, 0 QuantifiedInterpolants, 1278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 4620/4620 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-14 10:36:54,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:36:57,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:36:57,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:36:57,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:36:57,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:36:57,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:36:57,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:36:57,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:36:57,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:36:57,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:36:57,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:36:57,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:36:57,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:36:57,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:36:57,220 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:36:57,220 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:36:57,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:36:57,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:36:57,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:36:57,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:36:57,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:36:57,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:36:57,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:36:57,222 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:36:57,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:36:57,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:36:57,225 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:36:57,225 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:36:57,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:36:57,226 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:36:57,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:36:57,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:36:57,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:36:57,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:36:57,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:36:57,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:36:57,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:36:57,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:36:57,238 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:36:57,238 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:36:57,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:36:57,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:36:57,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:36:57,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:36:57,239 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:36:57,239 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f94795b0f3f196f896b0d5b400dc38ed7472f9ce0750288d10d137d9782004a [2024-10-14 10:36:57,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:36:57,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:36:57,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:36:57,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:36:57,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:36:57,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2024-10-14 10:36:59,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:36:59,507 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:36:59,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2024-10-14 10:36:59,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d54e53a/666b86c4b52c41d2867a24e7dc0d2e53/FLAGb4cb248ea [2024-10-14 10:36:59,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d54e53a/666b86c4b52c41d2867a24e7dc0d2e53 [2024-10-14 10:36:59,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:36:59,532 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:36:59,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:36:59,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:36:59,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:36:59,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:36:59,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a8b7b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59, skipping insertion in model container [2024-10-14 10:36:59,539 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:36:59,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:36:59,754 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_fillercode_fillercodestructure_filler-ps-co_file-89.i[919,932] [2024-10-14 10:36:59,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:36:59,877 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:36:59,888 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_fillercode_fillercodestructure_filler-ps-co_file-89.i[919,932] [2024-10-14 10:36:59,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:36:59,952 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:36:59,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59 WrapperNode [2024-10-14 10:36:59,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:36:59,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:36:59,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:36:59,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:36:59,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:36:59,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,029 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-14 10:37:00,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:37:00,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:37:00,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:37:00,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:37:00,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,073 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-14 10:37:00,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,114 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:37:00,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:37:00,115 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:37:00,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:37:00,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (1/1) ... [2024-10-14 10:37:00,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:37:00,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:37:00,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:37:00,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:37:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:37:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:37:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:37:00,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:37:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:37:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:37:00,303 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:37:00,305 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:37:06,824 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:37:06,824 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:37:06,920 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:37:06,924 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:37:06,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:37:06 BoogieIcfgContainer [2024-10-14 10:37:06,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:37:06,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:37:06,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:37:06,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:37:06,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:36:59" (1/3) ... [2024-10-14 10:37:06,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4157f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:37:06, skipping insertion in model container [2024-10-14 10:37:06,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:36:59" (2/3) ... [2024-10-14 10:37:06,937 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e4157f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:37:06, skipping insertion in model container [2024-10-14 10:37:06,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:37:06" (3/3) ... [2024-10-14 10:37:06,940 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-89.i [2024-10-14 10:37:06,958 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:37:06,958 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:37:07,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:37:07,032 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;@7ee4d913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:37:07,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:37:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 50 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:37:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 10:37:07,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:37:07,056 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:37:07,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:37:07,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:37:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -592238707, now seen corresponding path program 1 times [2024-10-14 10:37:07,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:37:07,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224675244] [2024-10-14 10:37:07,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:37:07,079 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-14 10:37:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:37:07,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:37:07,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:37:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:37:07,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:37:07,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:37:07,495 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-14 10:37:07,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:37:07,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:37:07,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224675244] [2024-10-14 10:37:07,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224675244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:37:07,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:37:07,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:37:07,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649955570] [2024-10-14 10:37:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:37:07,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:37:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:37:07,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:37:07,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:37:07,538 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 50 states have internal predecessors, (79), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:37:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:37:07,711 INFO L93 Difference]: Finished difference Result 145 states and 266 transitions. [2024-10-14 10:37:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:37:07,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-10-14 10:37:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:37:07,731 INFO L225 Difference]: With dead ends: 145 [2024-10-14 10:37:07,731 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 10:37:07,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:37:07,738 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:37:07,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:37:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 10:37:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 10:37:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 48 states have internal predecessors, (74), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 10:37:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 118 transitions. [2024-10-14 10:37:07,812 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 118 transitions. Word has length 142 [2024-10-14 10:37:07,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:37:07,813 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 118 transitions. [2024-10-14 10:37:07,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:37:07,813 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 118 transitions. [2024-10-14 10:37:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 10:37:07,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:37:07,820 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:37:07,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 10:37:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:37:08,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:37:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:37:08,023 INFO L85 PathProgramCache]: Analyzing trace with hash 351876557, now seen corresponding path program 1 times [2024-10-14 10:37:08,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:37:08,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096542648] [2024-10-14 10:37:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:37:08,025 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-14 10:37:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:37:08,030 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:37:08,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 10:37:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:37:08,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:37:08,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:37:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:37:14,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:37:14,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:37:14,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096542648] [2024-10-14 10:37:14,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096542648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:37:14,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:37:14,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:37:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417518700] [2024-10-14 10:37:14,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:37:14,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:37:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:37:14,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:37:14,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:37:14,540 INFO L87 Difference]: Start difference. First operand 72 states and 118 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:37:18,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:37:23,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:37:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:37:23,662 INFO L93 Difference]: Finished difference Result 197 states and 324 transitions. [2024-10-14 10:37:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:37:23,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-14 10:37:23,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:37:23,744 INFO L225 Difference]: With dead ends: 197 [2024-10-14 10:37:23,744 INFO L226 Difference]: Without dead ends: 126 [2024-10-14 10:37:23,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:37:23,746 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:37:23,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 199 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-10-14 10:37:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-14 10:37:23,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 112. [2024-10-14 10:37:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 10:37:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 180 transitions. [2024-10-14 10:37:23,774 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 180 transitions. Word has length 142 [2024-10-14 10:37:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:37:23,774 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 180 transitions. [2024-10-14 10:37:23,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:37:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 180 transitions. [2024-10-14 10:37:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 10:37:23,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:37:23,777 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:37:23,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 10:37:23,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:37:23,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:37:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:37:23,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1214501224, now seen corresponding path program 1 times [2024-10-14 10:37:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:37:23,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403690861] [2024-10-14 10:37:23,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:37:23,980 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-14 10:37:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:37:23,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:37:23,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:37:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:37:24,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:37:24,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:37:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 10:37:24,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:37:24,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:37:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403690861] [2024-10-14 10:37:24,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403690861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:37:24,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:37:24,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:37:24,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553538055] [2024-10-14 10:37:24,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:37:24,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:37:24,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:37:24,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:37:24,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:37:24,359 INFO L87 Difference]: Start difference. First operand 112 states and 180 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:37:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:37:24,837 INFO L93 Difference]: Finished difference Result 248 states and 402 transitions. [2024-10-14 10:37:24,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:37:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-14 10:37:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:37:24,844 INFO L225 Difference]: With dead ends: 248 [2024-10-14 10:37:24,844 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 10:37:24,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 141 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-14 10:37:24,850 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 98 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:37:24,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 202 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:37:24,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 10:37:24,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-10-14 10:37:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 103 states have internal predecessors, (141), 66 states have call successors, (66), 3 states have call predecessors, (66), 3 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:37:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 273 transitions. [2024-10-14 10:37:24,904 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 273 transitions. Word has length 143 [2024-10-14 10:37:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:37:24,904 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 273 transitions. [2024-10-14 10:37:24,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 10:37:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 273 transitions. [2024-10-14 10:37:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 10:37:24,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:37:24,907 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:37:24,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:37:25,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:37:25,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:37:25,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:37:25,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1384904346, now seen corresponding path program 1 times [2024-10-14 10:37:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:37:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086854219] [2024-10-14 10:37:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:37:25,122 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-14 10:37:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:37:25,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:37:25,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 10:37:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:37:25,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 10:37:25,454 INFO L278 TraceCheckSpWp]: Computing forward predicates...