./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_operatoramount_amount100_file-94.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_operatoramount_amount100_file-94.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 a2f8007215dd5007e19dfc037839fa4d3c0ead73f2f0a4d10669b6b4d770a5af --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:24:50,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:24:50,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:24:50,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:24:50,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:24:50,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:24:50,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:24:50,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:24:50,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:24:50,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:24:50,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:24:50,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:24:50,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:24:50,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:24:50,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:24:50,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:24:50,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:24:50,672 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:24:50,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:24:50,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:24:50,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:24:50,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:24:50,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:24:50,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:24:50,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:24:50,677 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:24:50,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:24:50,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:24:50,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:24:50,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:24:50,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:24:50,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:24:50,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:24:50,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:24:50,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:24:50,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:24:50,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:24:50,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:24:50,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:24:50,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:24:50,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:24:50,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:24:50,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 -> a2f8007215dd5007e19dfc037839fa4d3c0ead73f2f0a4d10669b6b4d770a5af [2024-10-14 12:24:51,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:24:51,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:24:51,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:24:51,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:24:51,148 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:24:51,149 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-94.i [2024-10-14 12:24:52,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:24:52,817 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:24:52,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-94.i [2024-10-14 12:24:52,832 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42baeecc7/8186b738189a48d9a6890d6c1a6e6cfa/FLAGb0fcf6056 [2024-10-14 12:24:52,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42baeecc7/8186b738189a48d9a6890d6c1a6e6cfa [2024-10-14 12:24:52,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:24:52,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:24:52,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:24:52,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:24:52,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:24:52,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:24:52" (1/1) ... [2024-10-14 12:24:52,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67879c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:52, skipping insertion in model container [2024-10-14 12:24:52,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:24:52" (1/1) ... [2024-10-14 12:24:52,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:24:53,012 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_operatoramount_amount100_file-94.i[916,929] [2024-10-14 12:24:53,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:24:53,088 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:24:53,100 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_operatoramount_amount100_file-94.i[916,929] [2024-10-14 12:24:53,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:24:53,228 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:24:53,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53 WrapperNode [2024-10-14 12:24:53,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:24:53,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:24:53,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:24:53,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:24:53,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,324 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-14 12:24:53,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:24:53,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:24:53,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:24:53,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:24:53,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,376 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 12:24:53,377 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,377 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:24:53,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:24:53,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:24:53,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:24:53,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (1/1) ... [2024-10-14 12:24:53,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:24:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:53,481 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 12:24:53,495 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 12:24:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:24:53,546 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:24:53,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:24:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:24:53,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:24:53,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:24:53,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:24:53,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:24:53,998 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-14 12:24:53,998 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:24:54,033 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:24:54,033 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:24:54,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:54 BoogieIcfgContainer [2024-10-14 12:24:54,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:24:54,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:24:54,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:24:54,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:24:54,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:24:52" (1/3) ... [2024-10-14 12:24:54,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5606f1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:24:54, skipping insertion in model container [2024-10-14 12:24:54,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:53" (2/3) ... [2024-10-14 12:24:54,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5606f1b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:24:54, skipping insertion in model container [2024-10-14 12:24:54,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:54" (3/3) ... [2024-10-14 12:24:54,046 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-94.i [2024-10-14 12:24:54,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:24:54,073 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:24:54,144 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:24:54,149 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;@73000b9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:24:54,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:24:54,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 12:24:54,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 12:24:54,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:54,168 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:54,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:54,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:54,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1124060509, now seen corresponding path program 1 times [2024-10-14 12:24:54,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:54,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429615327] [2024-10-14 12:24:54,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:54,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:54,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:24:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:24:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:24:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:24:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:24:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:24:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:24:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:24:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:24:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:24:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:24:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:24:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:24:54,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:24:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:24:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 12:24:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 12:24:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 12:24:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 12:24:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 12:24:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 12:24:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 12:24:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 12:24:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 12:24:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:24:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 12:24:54,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:54,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429615327] [2024-10-14 12:24:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429615327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:54,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:54,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:24:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370082335] [2024-10-14 12:24:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:54,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:24:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:54,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:24:54,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:24:54,672 INFO L87 Difference]: Start difference. First operand has 87 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 12:24:54,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:54,719 INFO L93 Difference]: Finished difference Result 171 states and 301 transitions. [2024-10-14 12:24:54,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:24:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-10-14 12:24:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:54,730 INFO L225 Difference]: With dead ends: 171 [2024-10-14 12:24:54,732 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 12:24:54,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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 12:24:54,738 INFO L432 NwaCegarLoop]: 130 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, 130 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 12:24:54,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:24:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 12:24:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-14 12:24:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 56 states have internal predecessors, (79), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 12:24:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 133 transitions. [2024-10-14 12:24:54,781 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 133 transitions. Word has length 175 [2024-10-14 12:24:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:54,781 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 133 transitions. [2024-10-14 12:24:54,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 12:24:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 133 transitions. [2024-10-14 12:24:54,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-14 12:24:54,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:54,788 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:54,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:24:54,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:54,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:54,789 INFO L85 PathProgramCache]: Analyzing trace with hash -54149729, now seen corresponding path program 1 times [2024-10-14 12:24:54,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:54,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139940348] [2024-10-14 12:24:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:24:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:24:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:24:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:24:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:24:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:24:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:24:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:24:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:24:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:24:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:24:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:24:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:24:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:24:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:24:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 12:24:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 12:24:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 12:24:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 12:24:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 12:24:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 12:24:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 12:24:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 12:24:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 12:24:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:24:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 12:24:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139940348] [2024-10-14 12:24:55,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139940348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:24:55,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60052634] [2024-10-14 12:24:55,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:55,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:24:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:55,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:24:55,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:24:55,196 INFO L87 Difference]: Start difference. First operand 85 states and 133 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:24:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:55,404 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-10-14 12:24:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:24:55,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-14 12:24:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:55,409 INFO L225 Difference]: With dead ends: 199 [2024-10-14 12:24:55,410 INFO L226 Difference]: Without dead ends: 115 [2024-10-14 12:24:55,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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 12:24:55,413 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 85 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:55,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 362 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:24:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-14 12:24:55,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-10-14 12:24:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 69 states have internal predecessors, (90), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 12:24:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 176 transitions. [2024-10-14 12:24:55,436 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 176 transitions. Word has length 175 [2024-10-14 12:24:55,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:55,437 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 176 transitions. [2024-10-14 12:24:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:24:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 176 transitions. [2024-10-14 12:24:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 12:24:55,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:55,440 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:55,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:24:55,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1637020727, now seen corresponding path program 1 times [2024-10-14 12:24:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:55,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954603875] [2024-10-14 12:24:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:55,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:24:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:24:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:24:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:24:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:24:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:24:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:24:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:24:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:24:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:24:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:24:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:24:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:24:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:24:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:24:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 12:24:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 12:24:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 12:24:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 12:24:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 12:24:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 12:24:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 12:24:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 12:24:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 12:24:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:24:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 12:24:55,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:55,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954603875] [2024-10-14 12:24:55,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954603875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:55,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:55,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:24:55,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318075202] [2024-10-14 12:24:55,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:55,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:24:55,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:55,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:24:55,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:24:55,924 INFO L87 Difference]: Start difference. First operand 114 states and 176 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:24:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:56,120 INFO L93 Difference]: Finished difference Result 320 states and 489 transitions. [2024-10-14 12:24:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:24:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-10-14 12:24:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:56,127 INFO L225 Difference]: With dead ends: 320 [2024-10-14 12:24:56,128 INFO L226 Difference]: Without dead ends: 232 [2024-10-14 12:24:56,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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 12:24:56,130 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 170 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:56,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 369 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:24:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-14 12:24:56,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 198. [2024-10-14 12:24:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 124 states have internal predecessors, (161), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 12:24:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 301 transitions. [2024-10-14 12:24:56,167 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 301 transitions. Word has length 176 [2024-10-14 12:24:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:56,168 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 301 transitions. [2024-10-14 12:24:56,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:24:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 301 transitions. [2024-10-14 12:24:56,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 12:24:56,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:56,172 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:56,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:24:56,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:56,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1771034233, now seen corresponding path program 1 times [2024-10-14 12:24:56,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:56,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112703715] [2024-10-14 12:24:56,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:56,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 12:24:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 12:24:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 12:24:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 12:24:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 12:24:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 12:24:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 12:24:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 12:24:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 12:24:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 12:24:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 12:24:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 12:24:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 12:24:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 12:24:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 12:24:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 12:24:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 12:24:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 12:24:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 12:24:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 12:24:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 12:24:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 12:24:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 12:24:56,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 12:24:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 12:24:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 12:24:56,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:56,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112703715] [2024-10-14 12:24:56,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112703715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:56,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:24:56,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279088830] [2024-10-14 12:24:56,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:24:56,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:56,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:24:56,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:24:56,668 INFO L87 Difference]: Start difference. First operand 198 states and 301 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:24:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:57,162 INFO L93 Difference]: Finished difference Result 624 states and 942 transitions. [2024-10-14 12:24:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 12:24:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 176 [2024-10-14 12:24:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:57,167 INFO L225 Difference]: With dead ends: 624 [2024-10-14 12:24:57,168 INFO L226 Difference]: Without dead ends: 452 [2024-10-14 12:24:57,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:24:57,170 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 218 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:57,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 685 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:24:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-10-14 12:24:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 272. [2024-10-14 12:24:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 185 states have internal predecessors, (251), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-14 12:24:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 413 transitions. [2024-10-14 12:24:57,206 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 413 transitions. Word has length 176 [2024-10-14 12:24:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:57,207 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 413 transitions. [2024-10-14 12:24:57,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:24:57,207 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 413 transitions. [2024-10-14 12:24:57,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 12:24:57,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:57,209 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:24:57,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:24:57,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:57,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:57,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1244069385, now seen corresponding path program 1 times [2024-10-14 12:24:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704865697] [2024-10-14 12:24:57,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:24:57,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [199818228] [2024-10-14 12:24:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:57,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:24:57,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:57,409 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 12:24:57,410 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 12:24:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:57,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 12:24:57,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:24:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 456 proven. 63 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-10-14 12:24:59,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 12:25:01,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:25:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704865697] [2024-10-14 12:25:01,126 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 12:25:01,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199818228] [2024-10-14 12:25:01,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199818228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:25:01,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 12:25:01,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-14 12:25:01,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299299530] [2024-10-14 12:25:01,127 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 12:25:01,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 12:25:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:25:01,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 12:25:01,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-14 12:25:01,129 INFO L87 Difference]: Start difference. First operand 272 states and 413 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 12:25:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:01,855 INFO L93 Difference]: Finished difference Result 619 states and 927 transitions. [2024-10-14 12:25:01,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 12:25:01,856 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 176 [2024-10-14 12:25:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:01,859 INFO L225 Difference]: With dead ends: 619 [2024-10-14 12:25:01,859 INFO L226 Difference]: Without dead ends: 447 [2024-10-14 12:25:01,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2024-10-14 12:25:01,861 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 328 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:01,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 570 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:25:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-10-14 12:25:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 392. [2024-10-14 12:25:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 294 states have (on average 1.3979591836734695) internal successors, (411), 296 states have internal predecessors, (411), 89 states have call successors, (89), 8 states have call predecessors, (89), 8 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-14 12:25:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 589 transitions. [2024-10-14 12:25:01,890 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 589 transitions. Word has length 176 [2024-10-14 12:25:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:01,891 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 589 transitions. [2024-10-14 12:25:01,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 12:25:01,891 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 589 transitions. [2024-10-14 12:25:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-14 12:25:01,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:01,892 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:01,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 12:25:02,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:25:02,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:02,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:02,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1924127755, now seen corresponding path program 1 times [2024-10-14 12:25:02,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:25:02,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451241786] [2024-10-14 12:25:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:25:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:25:02,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448542012] [2024-10-14 12:25:02,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:02,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:25:02,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:25:02,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:25:02,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 12:25:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:25:02,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:25:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:25:02,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:25:02,613 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:25:02,614 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:25:02,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 12:25:02,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 12:25:02,821 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 12:25:02,936 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:25:02,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:25:02 BoogieIcfgContainer [2024-10-14 12:25:02,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:25:02,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:25:02,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:25:02,940 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:25:02,940 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:54" (3/4) ... [2024-10-14 12:25:02,942 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:25:02,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:25:02,944 INFO L158 Benchmark]: Toolchain (without parser) took 10092.01ms. Allocated memory was 176.2MB in the beginning and 406.8MB in the end (delta: 230.7MB). Free memory was 107.3MB in the beginning and 319.4MB in the end (delta: -212.0MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-14 12:25:02,944 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory was 133.7MB in the beginning and 133.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:25:02,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.45ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 147.5MB in the end (delta: -40.3MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-10-14 12:25:02,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.29ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 140.9MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 12:25:02,945 INFO L158 Benchmark]: Boogie Preprocessor took 116.72ms. Allocated memory is still 176.2MB. Free memory was 140.9MB in the beginning and 130.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 12:25:02,945 INFO L158 Benchmark]: RCFGBuilder took 590.75ms. Allocated memory is still 176.2MB. Free memory was 130.5MB in the beginning and 94.0MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-14 12:25:02,945 INFO L158 Benchmark]: TraceAbstraction took 8903.54ms. Allocated memory was 176.2MB in the beginning and 406.8MB in the end (delta: 230.7MB). Free memory was 93.4MB in the beginning and 319.4MB in the end (delta: -226.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-10-14 12:25:02,945 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 406.8MB. Free memory is still 319.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:25:02,947 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.10ms. Allocated memory is still 176.2MB. Free memory was 133.7MB in the beginning and 133.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.45ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 147.5MB in the end (delta: -40.3MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.29ms. Allocated memory is still 176.2MB. Free memory was 146.8MB in the beginning and 140.9MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.72ms. Allocated memory is still 176.2MB. Free memory was 140.9MB in the beginning and 130.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 590.75ms. Allocated memory is still 176.2MB. Free memory was 130.5MB in the beginning and 94.0MB in the end (delta: 36.4MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8903.54ms. Allocated memory was 176.2MB in the beginning and 406.8MB in the end (delta: 230.7MB). Free memory was 93.4MB in the beginning and 319.4MB in the end (delta: -226.0MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 406.8MB. Free memory is still 319.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = -0.25; [L23] double var_1_2 = -0.125; [L24] double var_1_3 = 127.5; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 10; [L28] float var_1_7 = -0.2; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 0; [L34] unsigned char var_1_14 = 0; [L35] signed long int var_1_15 = -100000; [L36] signed char var_1_18 = 8; [L37] signed char var_1_19 = 64; [L38] signed short int var_1_20 = -16; [L39] signed long int var_1_22 = -1; [L40] double var_1_23 = 500.8; [L41] double var_1_24 = 9.8; [L42] unsigned short int var_1_25 = 16; [L43] unsigned short int var_1_26 = 41277; [L44] signed long int var_1_27 = 1000; [L45] double var_1_29 = 99.5; [L46] double var_1_30 = 99999999.6; [L47] unsigned long int var_1_31 = 4; [L48] unsigned short int var_1_32 = 10; [L49] unsigned short int var_1_33 = 52075; [L50] unsigned char last_1_var_1_4 = 4; [L51] unsigned char last_1_var_1_9 = 0; [L52] signed long int last_1_var_1_15 = -100000; [L53] signed short int last_1_var_1_20 = -16; [L54] signed long int last_1_var_1_22 = -1; [L55] unsigned short int last_1_var_1_32 = 10; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L180] last_1_var_1_4 = var_1_4 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_22 = var_1_22 [L185] last_1_var_1_32 = var_1_32 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L137] RET assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L138] var_1_3 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L139] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L143] var_1_6 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L146] var_1_10 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L147] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L148] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L161] var_1_19 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L162] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L163] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L164] var_1_24 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L165] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L167] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L168] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L173] var_1_30 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L174] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L175] var_1_33 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_33 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L176] RET assume_abort_if_not(var_1_33 >= 49150) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L196] RET updateVariables() [L197] CALL step() [L59] COND FALSE !(\read(last_1_var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L62] signed long int stepLocal_7 = ((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4)))); VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_7=4, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L63] COND TRUE stepLocal_7 >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15) [L64] var_1_31 = (last_1_var_1_32 + (1891941459u - last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L68] var_1_1 = ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) [L69] var_1_29 = ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30))) [L70] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L71] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L80] unsigned char stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L81] COND FALSE !(var_1_3 != var_1_29) [L88] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L90] signed char stepLocal_5 = var_1_18; [L91] signed char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L92] COND FALSE !(stepLocal_5 < var_1_19) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L95] COND FALSE !(((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == stepLocal_4) [L98] var_1_20 = -10 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L101] signed short int stepLocal_6 = var_1_20; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, stepLocal_6=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L102] COND FALSE !(stepLocal_6 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L109] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L114] COND FALSE !((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) [L117] var_1_25 = ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L119] EXPR var_1_4 >> var_1_18 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L119] COND FALSE !(var_1_6 >= (var_1_4 >> var_1_18)) [L122] unsigned char stepLocal_1 = var_1_6 <= var_1_31; [L123] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L124] COND FALSE !(stepLocal_0 > (var_1_25 * var_1_31)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L129] COND FALSE !(var_1_3 <= (- var_1_7)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR ((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L188-L189] return ((((((((((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1)) && ((var_1_3 != var_1_29) ? (((var_1_32 <= var_1_31) && var_1_9) ? (var_1_18 == ((signed char) var_1_19)) : (var_1_18 == ((signed char) var_1_19))) : (var_1_18 == ((signed char) var_1_19)))) && ((var_1_18 < var_1_19) ? (var_1_20 == ((signed short int) (var_1_31 + var_1_19))) : ((((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == var_1_18) ? (var_1_20 == ((signed short int) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_20 == ((signed short int) -10))))) && ((var_1_20 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) ? ((! var_1_12) ? (var_1_22 == ((signed long int) (var_1_31 - var_1_20))) : (var_1_22 == ((signed long int) 2))) : 1)) && ((var_1_3 <= (- var_1_7)) ? (var_1_9 ? (var_1_23 == ((double) (var_1_24 - 31.25))) : 1) : 1)) && (((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) ? (var_1_25 == ((unsigned short int) ((((var_1_6) > (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32))))) ? (var_1_6) : (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32)))))))) : (var_1_25 == ((unsigned short int) ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))))))) && (var_1_29 == ((double) ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30)))))) && (((((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))))) >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15)) ? (var_1_31 == ((unsigned long int) (last_1_var_1_32 + (1891941459u - last_1_var_1_15)))) : (var_1_31 == ((unsigned long int) ((((((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) > (var_1_26)) ? (((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) : (var_1_26))))))) && (last_1_var_1_9 ? (var_1_32 == ((unsigned short int) ((var_1_33 - last_1_var_1_15) - var_1_6))) : 1) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-1, var_1_27=1, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=49150, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 6, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 801 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 2116 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1387 mSDsCounter, 242 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1088 IncrementalHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 242 mSolverCounterUnsat, 729 mSDtfsCounter, 1088 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 597 GetRequests, 559 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=5, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 270 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1406 NumberOfCodeBlocks, 1406 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 5384 SizeOfPredicates, 11 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 6957/7020 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 12:25:02,976 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_operatoramount_amount100_file-94.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 a2f8007215dd5007e19dfc037839fa4d3c0ead73f2f0a4d10669b6b4d770a5af --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:25:05,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:25:05,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:25:05,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:25:05,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:25:05,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:25:05,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:25:05,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:25:05,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:25:05,833 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:25:05,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:25:05,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:25:05,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:25:05,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:25:05,835 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:25:05,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:25:05,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:25:05,837 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:25:05,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:25:05,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:25:05,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:25:05,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:25:05,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:25:05,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:25:05,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:25:05,842 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:25:05,842 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:25:05,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:25:05,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:25:05,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:25:05,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:25:05,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:25:05,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:25:05,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:25:05,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:25:05,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:25:05,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:25:05,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:25:05,844 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:25:05,844 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:25:05,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:25:05,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:25:05,845 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:25:05,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:25:05,846 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:25:05,846 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 -> a2f8007215dd5007e19dfc037839fa4d3c0ead73f2f0a4d10669b6b4d770a5af [2024-10-14 12:25:06,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:25:06,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:25:06,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:25:06,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:25:06,163 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:25:06,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-94.i [2024-10-14 12:25:07,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:25:07,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:25:07,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-94.i [2024-10-14 12:25:07,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4d35106/23d2e54516bc48169f52f460d879660f/FLAG79ad954a1 [2024-10-14 12:25:07,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef4d35106/23d2e54516bc48169f52f460d879660f [2024-10-14 12:25:07,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:25:07,982 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:25:07,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:25:07,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:25:07,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:25:07,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:25:07" (1/1) ... [2024-10-14 12:25:07,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb3fdba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:07, skipping insertion in model container [2024-10-14 12:25:07,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:25:07" (1/1) ... [2024-10-14 12:25:08,026 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:25:08,168 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_operatoramount_amount100_file-94.i[916,929] [2024-10-14 12:25:08,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:25:08,282 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:25:08,295 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_operatoramount_amount100_file-94.i[916,929] [2024-10-14 12:25:08,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:25:08,414 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:25:08,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08 WrapperNode [2024-10-14 12:25:08,415 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:25:08,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:25:08,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:25:08,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:25:08,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,459 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-14 12:25:08,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:25:08,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:25:08,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:25:08,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:25:08,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,500 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 12:25:08,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:25:08,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:25:08,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:25:08,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:25:08,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (1/1) ... [2024-10-14 12:25:08,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:25:08,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:25:08,581 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 12:25:08,585 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 12:25:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:25:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:25:08,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:25:08,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:25:08,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:25:08,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:25:08,736 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:25:08,738 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:25:13,845 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 12:25:13,845 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:25:13,892 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:25:13,892 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:25:13,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:25:13 BoogieIcfgContainer [2024-10-14 12:25:13,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:25:13,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:25:13,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:25:13,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:25:13,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:25:07" (1/3) ... [2024-10-14 12:25:13,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731585ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:25:13, skipping insertion in model container [2024-10-14 12:25:13,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:25:08" (2/3) ... [2024-10-14 12:25:13,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@731585ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:25:13, skipping insertion in model container [2024-10-14 12:25:13,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:25:13" (3/3) ... [2024-10-14 12:25:13,899 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-94.i [2024-10-14 12:25:13,915 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:25:13,915 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:25:13,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:25:13,987 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;@5d2e85f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:25:13,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:25:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 12:25:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 12:25:14,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:14,004 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:14,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:14,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:14,010 INFO L85 PathProgramCache]: Analyzing trace with hash 233829760, now seen corresponding path program 1 times [2024-10-14 12:25:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:25:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108635062] [2024-10-14 12:25:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:14,022 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 12:25:14,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:25:14,025 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 12:25:14,026 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 12:25:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:14,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:25:14,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:25:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-10-14 12:25:14,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:25:14,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:25:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108635062] [2024-10-14 12:25:14,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108635062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:25:14,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:25:14,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:25:14,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077834944] [2024-10-14 12:25:14,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:25:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:25:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:25:14,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:25:14,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:25:14,625 INFO L87 Difference]: Start difference. First operand has 80 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 12:25:18,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:25:18,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:18,407 INFO L93 Difference]: Finished difference Result 157 states and 281 transitions. [2024-10-14 12:25:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:25:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 172 [2024-10-14 12:25:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:18,454 INFO L225 Difference]: With dead ends: 157 [2024-10-14 12:25:18,454 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 12:25:18,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 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 12:25:18,459 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:18,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 12:25:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 12:25:18,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 12:25:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-14 12:25:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2024-10-14 12:25:18,500 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 172 [2024-10-14 12:25:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:18,501 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2024-10-14 12:25:18,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 12:25:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2024-10-14 12:25:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 12:25:18,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:18,504 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:18,520 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 12:25:18,708 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 12:25:18,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:18,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1480572030, now seen corresponding path program 1 times [2024-10-14 12:25:18,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:25:18,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898219976] [2024-10-14 12:25:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:18,711 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 12:25:18,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:25:18,716 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 12:25:18,718 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 12:25:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:19,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 12:25:19,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:25:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 12:25:20,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:25:20,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:25:20,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898219976] [2024-10-14 12:25:20,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898219976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:25:20,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:25:20,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:25:20,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889129934] [2024-10-14 12:25:20,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:25:20,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:25:20,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:25:20,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:25:20,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:25:20,822 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:25:25,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:25:29,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:25:34,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:25:38,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:25:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:39,212 INFO L93 Difference]: Finished difference Result 268 states and 422 transitions. [2024-10-14 12:25:39,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 12:25:39,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-14 12:25:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:39,216 INFO L225 Difference]: With dead ends: 268 [2024-10-14 12:25:39,219 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 12:25:39,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:25:39,221 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 139 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 64 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:39,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 291 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 93 Invalid, 3 Unknown, 0 Unchecked, 18.3s Time] [2024-10-14 12:25:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 12:25:39,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 151. [2024-10-14 12:25:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 94 states have (on average 1.372340425531915) internal successors, (129), 94 states have internal predecessors, (129), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 12:25:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 237 transitions. [2024-10-14 12:25:39,264 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 237 transitions. Word has length 172 [2024-10-14 12:25:39,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:39,265 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 237 transitions. [2024-10-14 12:25:39,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:25:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 237 transitions. [2024-10-14 12:25:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 12:25:39,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:39,270 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:39,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 12:25:39,474 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 12:25:39,475 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:39,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash 662923580, now seen corresponding path program 1 times [2024-10-14 12:25:39,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:25:39,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155619219] [2024-10-14 12:25:39,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:39,482 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 12:25:39,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:25:39,490 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 12:25:39,493 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 12:25:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:40,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 12:25:40,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:25:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-14 12:25:40,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:25:40,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:25:40,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155619219] [2024-10-14 12:25:40,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155619219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:25:40,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:25:40,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:25:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629401075] [2024-10-14 12:25:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:25:40,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:25:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:25:40,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:25:40,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:25:40,275 INFO L87 Difference]: Start difference. First operand 151 states and 237 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:25:44,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 12:25:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:45,646 INFO L93 Difference]: Finished difference Result 335 states and 521 transitions. [2024-10-14 12:25:45,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:25:45,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-10-14 12:25:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:45,652 INFO L225 Difference]: With dead ends: 335 [2024-10-14 12:25:45,652 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 12:25:45,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:25:45,655 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 75 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:45,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 351 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 1 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 12:25:45,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 12:25:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2024-10-14 12:25:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 109 states have (on average 1.3027522935779816) internal successors, (142), 110 states have internal predecessors, (142), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 12:25:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 282 transitions. [2024-10-14 12:25:45,693 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 282 transitions. Word has length 172 [2024-10-14 12:25:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:45,693 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 282 transitions. [2024-10-14 12:25:45,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-14 12:25:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 282 transitions. [2024-10-14 12:25:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 12:25:45,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:45,696 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:25:45,713 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 12:25:45,899 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 12:25:45,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1382685364, now seen corresponding path program 1 times [2024-10-14 12:25:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:25:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987389188] [2024-10-14 12:25:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:45,902 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 12:25:45,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:25:45,905 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 12:25:45,909 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 12:25:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:46,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 12:25:46,801 INFO L278 TraceCheckSpWp]: Computing forward predicates...