./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-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:07:07,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:07:08,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:07:08,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:07:08,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:07:08,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:07:08,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:07:08,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:07:08,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:07:08,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:07:08,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:07:08,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:07:08,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:07:08,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:07:08,096 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:07:08,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:07:08,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:07:08,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:07:08,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:07:08,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:07:08,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:07:08,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:07:08,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:07:08,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:07:08,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:07:08,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:07:08,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:07:08,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:07:08,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:07:08,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:07:08,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:07:08,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:07:08,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:07:08,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:07:08,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:07:08,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:07:08,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:07:08,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:07:08,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:07:08,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:07:08,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:07:08,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:07:08,114 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a [2024-10-11 12:07:08,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:07:08,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:07:08,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:07:08,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:07:08,444 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:07:08,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-10-11 12:07:10,192 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:07:10,427 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:07:10,427 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-10-11 12:07:10,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/afe91c7d2/66e8e20939d040afa2013532ab7472d6/FLAG3a5f430d5 [2024-10-11 12:07:10,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/afe91c7d2/66e8e20939d040afa2013532ab7472d6 [2024-10-11 12:07:10,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:07:10,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:07:10,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:07:10,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:07:10,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:07:10,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:07:10" (1/1) ... [2024-10-11 12:07:10,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f27bc6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:10, skipping insertion in model container [2024-10-11 12:07:10,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:07:10" (1/1) ... [2024-10-11 12:07:10,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:07:11,077 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-11.i[916,929] [2024-10-11 12:07:11,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:07:11,242 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:07:11,258 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-11.i[916,929] [2024-10-11 12:07:11,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:07:11,317 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:07:11,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11 WrapperNode [2024-10-11 12:07:11,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:07:11,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:07:11,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:07:11,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:07:11,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,409 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 292 [2024-10-11 12:07:11,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:07:11,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:07:11,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:07:11,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:07:11,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:07:11,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,496 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:07:11,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:07:11,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:07:11,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:07:11,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (1/1) ... [2024-10-11 12:07:11,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:07:11,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:07:11,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:07:11,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:07:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:07:11,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:07:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:07:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:07:11,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:07:11,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:07:11,707 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:07:11,709 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:07:12,375 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-10-11 12:07:12,375 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:07:12,422 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:07:12,423 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:07:12,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:07:12 BoogieIcfgContainer [2024-10-11 12:07:12,423 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:07:12,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:07:12,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:07:12,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:07:12,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:07:10" (1/3) ... [2024-10-11 12:07:12,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450295dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:07:12, skipping insertion in model container [2024-10-11 12:07:12,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:11" (2/3) ... [2024-10-11 12:07:12,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450295dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:07:12, skipping insertion in model container [2024-10-11 12:07:12,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:07:12" (3/3) ... [2024-10-11 12:07:12,433 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-11.i [2024-10-11 12:07:12,452 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:07:12,452 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:07:12,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:07:12,622 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;@43ce669b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:07:12,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:07:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 87 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:07:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 12:07:12,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:12,644 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:12,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:12,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:12,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1591859976, now seen corresponding path program 1 times [2024-10-11 12:07:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349913262] [2024-10-11 12:07:12,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:12,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:12,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349913262] [2024-10-11 12:07:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349913262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:13,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:07:13,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378880587] [2024-10-11 12:07:13,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:13,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:07:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:13,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:07:13,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:07:13,199 INFO L87 Difference]: Start difference. First operand has 109 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 87 states have internal predecessors, (133), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 12:07:13,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:13,269 INFO L93 Difference]: Finished difference Result 215 states and 364 transitions. [2024-10-11 12:07:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:07:13,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-10-11 12:07:13,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:13,290 INFO L225 Difference]: With dead ends: 215 [2024-10-11 12:07:13,290 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 12:07:13,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11 12:07:13,301 INFO L432 NwaCegarLoop]: 165 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, 165 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-11 12:07:13,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:07:13,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 12:07:13,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-11 12:07:13,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 85 states have internal predecessors, (128), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:07:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-10-11 12:07:13,373 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 144 [2024-10-11 12:07:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:13,376 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-10-11 12:07:13,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 12:07:13,378 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-10-11 12:07:13,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 12:07:13,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:13,384 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:13,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:07:13,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:13,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1183324800, now seen corresponding path program 1 times [2024-10-11 12:07:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:13,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694844813] [2024-10-11 12:07:13,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:13,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:14,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:14,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694844813] [2024-10-11 12:07:14,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694844813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:14,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:14,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:07:14,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102833594] [2024-10-11 12:07:14,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:14,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:14,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:14,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:14,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:14,065 INFO L87 Difference]: Start difference. First operand 107 states and 168 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:14,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:14,130 INFO L93 Difference]: Finished difference Result 214 states and 337 transitions. [2024-10-11 12:07:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2024-10-11 12:07:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:14,134 INFO L225 Difference]: With dead ends: 214 [2024-10-11 12:07:14,134 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 12:07:14,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:14,136 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:14,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 475 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:07:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 12:07:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 12:07:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.5) internal successors, (129), 86 states have internal predecessors, (129), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:07:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2024-10-11 12:07:14,154 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 144 [2024-10-11 12:07:14,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:14,155 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2024-10-11 12:07:14,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:14,156 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2024-10-11 12:07:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 12:07:14,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:14,158 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:14,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:07:14,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1048625896, now seen corresponding path program 1 times [2024-10-11 12:07:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126650473] [2024-10-11 12:07:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:14,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:14,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126650473] [2024-10-11 12:07:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126650473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:14,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:07:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161612655] [2024-10-11 12:07:14,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:14,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 12:07:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 12:07:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:07:14,417 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:14,483 INFO L93 Difference]: Finished difference Result 253 states and 393 transitions. [2024-10-11 12:07:14,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 12:07:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 12:07:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:14,490 INFO L225 Difference]: With dead ends: 253 [2024-10-11 12:07:14,490 INFO L226 Difference]: Without dead ends: 146 [2024-10-11 12:07:14,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 12:07:14,496 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 56 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:14,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 358 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:07:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-11 12:07:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2024-10-11 12:07:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.5053763440860215) internal successors, (140), 93 states have internal predecessors, (140), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:07:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 180 transitions. [2024-10-11 12:07:14,515 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 180 transitions. Word has length 145 [2024-10-11 12:07:14,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:14,538 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 180 transitions. [2024-10-11 12:07:14,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 180 transitions. [2024-10-11 12:07:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 12:07:14,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:14,542 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:14,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:07:14,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:14,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -27557542, now seen corresponding path program 1 times [2024-10-11 12:07:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262387216] [2024-10-11 12:07:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:14,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:15,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:15,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:15,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:15,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262387216] [2024-10-11 12:07:15,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262387216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:15,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:15,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:07:15,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670293301] [2024-10-11 12:07:15,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:15,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:07:15,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:15,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:07:15,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:07:15,261 INFO L87 Difference]: Start difference. First operand 115 states and 180 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:15,610 INFO L93 Difference]: Finished difference Result 504 states and 784 transitions. [2024-10-11 12:07:15,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:07:15,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 12:07:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:15,615 INFO L225 Difference]: With dead ends: 504 [2024-10-11 12:07:15,615 INFO L226 Difference]: Without dead ends: 390 [2024-10-11 12:07:15,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:07:15,618 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 517 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:15,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 669 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:07:15,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-11 12:07:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 229. [2024-10-11 12:07:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 186 states have (on average 1.510752688172043) internal successors, (281), 186 states have internal predecessors, (281), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 12:07:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 361 transitions. [2024-10-11 12:07:15,667 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 361 transitions. Word has length 145 [2024-10-11 12:07:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 361 transitions. [2024-10-11 12:07:15,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:15,668 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 361 transitions. [2024-10-11 12:07:15,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 12:07:15,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:15,670 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:15,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:07:15,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 34482072, now seen corresponding path program 1 times [2024-10-11 12:07:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246069638] [2024-10-11 12:07:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:15,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246069638] [2024-10-11 12:07:16,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246069638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:16,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:16,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:07:16,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720851721] [2024-10-11 12:07:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:16,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:16,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:16,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:16,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:16,017 INFO L87 Difference]: Start difference. First operand 229 states and 361 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:16,185 INFO L93 Difference]: Finished difference Result 618 states and 972 transitions. [2024-10-11 12:07:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 12:07:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:16,190 INFO L225 Difference]: With dead ends: 618 [2024-10-11 12:07:16,192 INFO L226 Difference]: Without dead ends: 389 [2024-10-11 12:07:16,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-11 12:07:16,196 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 137 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:16,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 472 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:07:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-11 12:07:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 278. [2024-10-11 12:07:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 214 states have (on average 1.4813084112149533) internal successors, (317), 214 states have internal predecessors, (317), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:07:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 437 transitions. [2024-10-11 12:07:16,250 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 437 transitions. Word has length 145 [2024-10-11 12:07:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:16,251 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 437 transitions. [2024-10-11 12:07:16,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 437 transitions. [2024-10-11 12:07:16,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 12:07:16,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:16,254 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:16,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:07:16,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:16,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:16,255 INFO L85 PathProgramCache]: Analyzing trace with hash 621306458, now seen corresponding path program 1 times [2024-10-11 12:07:16,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394256160] [2024-10-11 12:07:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:16,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:16,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394256160] [2024-10-11 12:07:16,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394256160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:16,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:16,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:07:16,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234416200] [2024-10-11 12:07:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:16,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:07:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:07:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:07:16,731 INFO L87 Difference]: Start difference. First operand 278 states and 437 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 12:07:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:17,217 INFO L93 Difference]: Finished difference Result 862 states and 1336 transitions. [2024-10-11 12:07:17,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 12:07:17,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 145 [2024-10-11 12:07:17,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:17,224 INFO L225 Difference]: With dead ends: 862 [2024-10-11 12:07:17,224 INFO L226 Difference]: Without dead ends: 634 [2024-10-11 12:07:17,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 12:07:17,227 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 680 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:17,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 817 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:07:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-10-11 12:07:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 530. [2024-10-11 12:07:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 418 states have (on average 1.4736842105263157) internal successors, (616), 418 states have internal predecessors, (616), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 12:07:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 816 transitions. [2024-10-11 12:07:17,299 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 816 transitions. Word has length 145 [2024-10-11 12:07:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:17,300 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 816 transitions. [2024-10-11 12:07:17,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 12:07:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 816 transitions. [2024-10-11 12:07:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 12:07:17,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:17,302 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:17,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:07:17,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:17,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash -196341992, now seen corresponding path program 1 times [2024-10-11 12:07:17,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:17,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102343709] [2024-10-11 12:07:17,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:17,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:18,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:18,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102343709] [2024-10-11 12:07:18,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102343709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:18,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:18,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:07:18,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371649690] [2024-10-11 12:07:18,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:18,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:07:18,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:07:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:07:18,061 INFO L87 Difference]: Start difference. First operand 530 states and 816 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:18,594 INFO L93 Difference]: Finished difference Result 1700 states and 2608 transitions. [2024-10-11 12:07:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:07:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-10-11 12:07:18,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:18,601 INFO L225 Difference]: With dead ends: 1700 [2024-10-11 12:07:18,602 INFO L226 Difference]: Without dead ends: 1228 [2024-10-11 12:07:18,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:07:18,605 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 550 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:18,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 685 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 12:07:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-10-11 12:07:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 946. [2024-10-11 12:07:18,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 788 states have (on average 1.5038071065989849) internal successors, (1185), 788 states have internal predecessors, (1185), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-11 12:07:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1465 transitions. [2024-10-11 12:07:18,734 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1465 transitions. Word has length 145 [2024-10-11 12:07:18,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:18,734 INFO L471 AbstractCegarLoop]: Abstraction has 946 states and 1465 transitions. [2024-10-11 12:07:18,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1465 transitions. [2024-10-11 12:07:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 12:07:18,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:18,738 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:18,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 12:07:18,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:18,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1238392330, now seen corresponding path program 1 times [2024-10-11 12:07:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:18,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132725610] [2024-10-11 12:07:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:18,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132725610] [2024-10-11 12:07:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132725610] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:19,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:07:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315905232] [2024-10-11 12:07:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:19,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:07:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:07:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:07:19,138 INFO L87 Difference]: Start difference. First operand 946 states and 1465 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:19,525 INFO L93 Difference]: Finished difference Result 2187 states and 3391 transitions. [2024-10-11 12:07:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:07:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-10-11 12:07:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:19,533 INFO L225 Difference]: With dead ends: 2187 [2024-10-11 12:07:19,533 INFO L226 Difference]: Without dead ends: 1299 [2024-10-11 12:07:19,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:07:19,537 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 170 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:19,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 670 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 12:07:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-10-11 12:07:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 956. [2024-10-11 12:07:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 798 states have (on average 1.505012531328321) internal successors, (1201), 798 states have internal predecessors, (1201), 140 states have call successors, (140), 17 states have call predecessors, (140), 17 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-11 12:07:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1481 transitions. [2024-10-11 12:07:19,645 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1481 transitions. Word has length 146 [2024-10-11 12:07:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:19,645 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1481 transitions. [2024-10-11 12:07:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1481 transitions. [2024-10-11 12:07:19,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-11 12:07:19,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:19,648 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:07:19,648 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:19,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -979943114, now seen corresponding path program 1 times [2024-10-11 12:07:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956064185] [2024-10-11 12:07:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:20,225 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:20,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:20,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956064185] [2024-10-11 12:07:20,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956064185] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:20,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:07:20,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107476530] [2024-10-11 12:07:20,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:20,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:20,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:20,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:20,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:20,228 INFO L87 Difference]: Start difference. First operand 956 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:20,669 INFO L93 Difference]: Finished difference Result 2787 states and 4334 transitions. [2024-10-11 12:07:20,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:20,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-10-11 12:07:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:20,684 INFO L225 Difference]: With dead ends: 2787 [2024-10-11 12:07:20,684 INFO L226 Difference]: Without dead ends: 1883 [2024-10-11 12:07:20,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-11 12:07:20,689 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 231 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:20,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 526 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:07:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2024-10-11 12:07:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1659. [2024-10-11 12:07:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1434 states have (on average 1.5132496513249651) internal successors, (2170), 1434 states have internal predecessors, (2170), 200 states have call successors, (200), 24 states have call predecessors, (200), 24 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-10-11 12:07:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2570 transitions. [2024-10-11 12:07:20,922 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2570 transitions. Word has length 146 [2024-10-11 12:07:20,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:20,923 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2570 transitions. [2024-10-11 12:07:20,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2570 transitions. [2024-10-11 12:07:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-11 12:07:20,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:20,929 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:20,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 12:07:20,929 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:20,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:20,930 INFO L85 PathProgramCache]: Analyzing trace with hash 8378255, now seen corresponding path program 1 times [2024-10-11 12:07:20,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:20,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294109822] [2024-10-11 12:07:20,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:20,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:21,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294109822] [2024-10-11 12:07:21,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294109822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:21,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:21,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:07:21,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681572440] [2024-10-11 12:07:21,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:21,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:21,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:21,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:21,223 INFO L87 Difference]: Start difference. First operand 1659 states and 2570 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:21,639 INFO L93 Difference]: Finished difference Result 4856 states and 7553 transitions. [2024-10-11 12:07:21,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:21,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2024-10-11 12:07:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:21,656 INFO L225 Difference]: With dead ends: 4856 [2024-10-11 12:07:21,657 INFO L226 Difference]: Without dead ends: 3249 [2024-10-11 12:07:21,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-11 12:07:21,663 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 233 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:21,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 546 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:07:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2024-10-11 12:07:21,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3047. [2024-10-11 12:07:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 2688 states have (on average 1.5197172619047619) internal successors, (4085), 2688 states have internal predecessors, (4085), 320 states have call successors, (320), 38 states have call predecessors, (320), 38 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2024-10-11 12:07:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 4725 transitions. [2024-10-11 12:07:21,943 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 4725 transitions. Word has length 148 [2024-10-11 12:07:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:21,944 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 4725 transitions. [2024-10-11 12:07:21,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 4725 transitions. [2024-10-11 12:07:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-11 12:07:21,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:21,949 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:21,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 12:07:21,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:21,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash -753200804, now seen corresponding path program 1 times [2024-10-11 12:07:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:21,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795718937] [2024-10-11 12:07:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:22,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:22,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795718937] [2024-10-11 12:07:22,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795718937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:22,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:22,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:07:22,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490760939] [2024-10-11 12:07:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:22,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:22,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:22,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:22,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:22,493 INFO L87 Difference]: Start difference. First operand 3047 states and 4725 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:22,974 INFO L93 Difference]: Finished difference Result 6854 states and 10567 transitions. [2024-10-11 12:07:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2024-10-11 12:07:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:22,996 INFO L225 Difference]: With dead ends: 6854 [2024-10-11 12:07:22,997 INFO L226 Difference]: Without dead ends: 3883 [2024-10-11 12:07:23,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:07:23,007 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 156 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:23,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 422 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:07:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2024-10-11 12:07:23,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3733. [2024-10-11 12:07:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3733 states, 3374 states have (on average 1.5056312981624185) internal successors, (5080), 3374 states have internal predecessors, (5080), 320 states have call successors, (320), 38 states have call predecessors, (320), 38 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2024-10-11 12:07:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3733 states to 3733 states and 5720 transitions. [2024-10-11 12:07:23,341 INFO L78 Accepts]: Start accepts. Automaton has 3733 states and 5720 transitions. Word has length 150 [2024-10-11 12:07:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:23,342 INFO L471 AbstractCegarLoop]: Abstraction has 3733 states and 5720 transitions. [2024-10-11 12:07:23,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3733 states and 5720 transitions. [2024-10-11 12:07:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 12:07:23,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:23,347 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 12:07:23,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash -98259335, now seen corresponding path program 1 times [2024-10-11 12:07:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985164066] [2024-10-11 12:07:23,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:23,787 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:23,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:23,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985164066] [2024-10-11 12:07:23,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985164066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:23,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:23,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:07:23,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498925889] [2024-10-11 12:07:23,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:23,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:23,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:23,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:23,789 INFO L87 Difference]: Start difference. First operand 3733 states and 5720 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:24,001 INFO L93 Difference]: Finished difference Result 7493 states and 11481 transitions. [2024-10-11 12:07:24,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:24,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2024-10-11 12:07:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:24,022 INFO L225 Difference]: With dead ends: 7493 [2024-10-11 12:07:24,022 INFO L226 Difference]: Without dead ends: 3813 [2024-10-11 12:07:24,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:24,032 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 2 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:24,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 481 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:07:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2024-10-11 12:07:24,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3813. [2024-10-11 12:07:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3813 states, 3454 states have (on average 1.499131441806601) internal successors, (5178), 3454 states have internal predecessors, (5178), 320 states have call successors, (320), 38 states have call predecessors, (320), 38 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2024-10-11 12:07:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 5818 transitions. [2024-10-11 12:07:24,338 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 5818 transitions. Word has length 152 [2024-10-11 12:07:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:24,339 INFO L471 AbstractCegarLoop]: Abstraction has 3813 states and 5818 transitions. [2024-10-11 12:07:24,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 5818 transitions. [2024-10-11 12:07:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-11 12:07:24,343 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:24,343 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:24,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 12:07:24,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:24,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:24,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1952724663, now seen corresponding path program 1 times [2024-10-11 12:07:24,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:24,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391621075] [2024-10-11 12:07:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:07:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:07:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:07:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:07:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 12:07:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:07:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:07:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:07:24,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:07:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 12:07:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:07:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:07:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:07:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 12:07:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 12:07:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 12:07:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 12:07:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 12:07:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 12:07:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 12:07:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 12:07:24,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:07:24,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391621075] [2024-10-11 12:07:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391621075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:07:24,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617733349] [2024-10-11 12:07:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:24,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:07:24,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:07:24,750 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:07:24,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:07:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:24,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 12:07:24,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:07:25,153 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-10-11 12:07:25,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:07:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 12:07:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617733349] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:07:25,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:07:25,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 12:07:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498341133] [2024-10-11 12:07:25,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:07:25,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:07:25,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:07:25,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:07:25,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:07:25,307 INFO L87 Difference]: Start difference. First operand 3813 states and 5818 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 12:07:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:25,702 INFO L93 Difference]: Finished difference Result 7643 states and 11599 transitions. [2024-10-11 12:07:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:07:25,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 152 [2024-10-11 12:07:25,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:25,724 INFO L225 Difference]: With dead ends: 7643 [2024-10-11 12:07:25,724 INFO L226 Difference]: Without dead ends: 3883 [2024-10-11 12:07:25,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:07:25,735 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 226 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:25,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 343 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:07:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3883 states. [2024-10-11 12:07:26,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3883 to 3797. [2024-10-11 12:07:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3797 states, 3422 states have (on average 1.477790765634132) internal successors, (5057), 3422 states have internal predecessors, (5057), 320 states have call successors, (320), 54 states have call predecessors, (320), 54 states have return successors, (320), 320 states have call predecessors, (320), 320 states have call successors, (320) [2024-10-11 12:07:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 5697 transitions. [2024-10-11 12:07:26,063 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 5697 transitions. Word has length 152 [2024-10-11 12:07:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:26,063 INFO L471 AbstractCegarLoop]: Abstraction has 3797 states and 5697 transitions. [2024-10-11 12:07:26,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 12:07:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 5697 transitions. [2024-10-11 12:07:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-10-11 12:07:26,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:26,067 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:26,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:07:26,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 12:07:26,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:26,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:26,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1950761497, now seen corresponding path program 1 times [2024-10-11 12:07:26,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:07:26,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642047150] [2024-10-11 12:07:26,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:26,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:07:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 12:07:26,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121129178] [2024-10-11 12:07:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:26,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:07:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:07:26,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:07:26,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:07:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:07:26,644 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:07:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:07:26,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:07:26,849 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:07:26,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:07:26,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 12:07:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:07:27,057 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:27,168 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:07:27,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:07:27 BoogieIcfgContainer [2024-10-11 12:07:27,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:07:27,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:07:27,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:07:27,176 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:07:27,176 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:07:12" (3/4) ... [2024-10-11 12:07:27,178 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:07:27,182 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:07:27,182 INFO L158 Benchmark]: Toolchain (without parser) took 16389.87ms. Allocated memory was 134.2MB in the beginning and 486.5MB in the end (delta: 352.3MB). Free memory was 65.1MB in the beginning and 297.5MB in the end (delta: -232.4MB). Peak memory consumption was 121.9MB. Max. memory is 16.1GB. [2024-10-11 12:07:27,182 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 134.2MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:07:27,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.67ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 64.9MB in the beginning and 147.0MB in the end (delta: -82.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-11 12:07:27,183 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.23ms. Allocated memory is still 182.5MB. Free memory was 147.0MB in the beginning and 140.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 12:07:27,183 INFO L158 Benchmark]: Boogie Preprocessor took 94.43ms. Allocated memory is still 182.5MB. Free memory was 140.7MB in the beginning and 132.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 12:07:27,184 INFO L158 Benchmark]: RCFGBuilder took 917.95ms. Allocated memory is still 182.5MB. Free memory was 132.3MB in the beginning and 87.4MB in the end (delta: 44.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 12:07:27,184 INFO L158 Benchmark]: TraceAbstraction took 14749.52ms. Allocated memory was 182.5MB in the beginning and 486.5MB in the end (delta: 304.1MB). Free memory was 87.4MB in the beginning and 297.5MB in the end (delta: -210.1MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2024-10-11 12:07:27,185 INFO L158 Benchmark]: Witness Printer took 6.19ms. Allocated memory is still 486.5MB. Free memory is still 297.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:07:27,186 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.23ms. Allocated memory is still 134.2MB. Free memory is still 99.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.67ms. Allocated memory was 134.2MB in the beginning and 182.5MB in the end (delta: 48.2MB). Free memory was 64.9MB in the beginning and 147.0MB in the end (delta: -82.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.23ms. Allocated memory is still 182.5MB. Free memory was 147.0MB in the beginning and 140.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.43ms. Allocated memory is still 182.5MB. Free memory was 140.7MB in the beginning and 132.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 917.95ms. Allocated memory is still 182.5MB. Free memory was 132.3MB in the beginning and 87.4MB in the end (delta: 44.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 14749.52ms. Allocated memory was 182.5MB in the beginning and 486.5MB in the end (delta: 304.1MB). Free memory was 87.4MB in the beginning and 297.5MB in the end (delta: -210.1MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. * Witness Printer took 6.19ms. Allocated memory is still 486.5MB. Free memory is still 297.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 189, overapproximation of bitwiseOr at line 189, overapproximation of bitwiseAnd at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 4.75; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_6 = -4; [L25] double var_1_7 = 49.8; [L26] double var_1_8 = 255.625; [L27] unsigned short int var_1_9 = 10; [L28] unsigned short int var_1_11 = 10000; [L29] signed char var_1_12 = 100; [L30] signed char var_1_13 = 16; [L31] unsigned long int var_1_14 = 4; [L32] signed short int var_1_15 = -16; [L33] unsigned char var_1_17 = 5; [L34] double var_1_18 = 64.75; [L35] double var_1_19 = 99.5; [L36] unsigned long int var_1_20 = 32; [L37] unsigned long int var_1_22 = 32; [L38] unsigned long int var_1_23 = 2461517415; [L39] unsigned long int var_1_24 = 1399914902; [L40] unsigned char var_1_25 = 2; [L41] signed long int var_1_26 = 4; [L42] unsigned char var_1_27 = 0; [L43] unsigned short int var_1_28 = 32; [L44] unsigned short int var_1_29 = 36457; [L45] double last_1_var_1_1 = 4.75; [L46] unsigned short int last_1_var_1_9 = 10; [L47] unsigned short int last_1_var_1_11 = 10000; [L48] unsigned long int last_1_var_1_14 = 4; [L49] signed short int last_1_var_1_15 = -16; [L50] unsigned char last_1_var_1_17 = 5; [L51] double last_1_var_1_18 = 64.75; [L52] unsigned long int last_1_var_1_20 = 32; [L53] unsigned long int last_1_var_1_22 = 32; [L54] unsigned char last_1_var_1_25 = 2; [L55] signed long int last_1_var_1_26 = 4; [L56] unsigned short int last_1_var_1_28 = 32; [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_11 = var_1_11 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_15 = var_1_15 [L180] last_1_var_1_17 = var_1_17 [L181] last_1_var_1_18 = var_1_18 [L182] last_1_var_1_20 = var_1_20 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_25 = var_1_25 [L185] last_1_var_1_26 = var_1_26 [L186] last_1_var_1_28 = var_1_28 [L196] RET updateLastVariables() [L197] CALL updateVariables() [L142] var_1_2 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L143] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L144] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=-4, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L145] var_1_6 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L146] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L147] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L148] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_7=249/5, var_1_8=2045/8, var_1_9=10] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_8=2045/8, var_1_9=10] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=100, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L153] var_1_12 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L154] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L155] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=16, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L156] var_1_13 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L157] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L158] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_19=199/2, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L159] var_1_19 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L160] RET assume_abort_if_not((var_1_19 >= -922337.2036854765600e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2461517415, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L161] var_1_23 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L162] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L163] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=1399914902, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L164] var_1_24 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_24 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L165] RET assume_abort_if_not(var_1_24 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] CALL assume_abort_if_not(var_1_24 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L166] RET assume_abort_if_not(var_1_24 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L167] var_1_27 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] CALL assume_abort_if_not(var_1_27 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L169] RET assume_abort_if_not(var_1_27 <= 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=36457, var_1_2=0, var_1_6=10000, var_1_9=10] [L170] var_1_29 = __VERIFIER_nondet_ushort() [L171] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L171] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L172] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L197] RET updateVariables() [L198] CALL step() [L60] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L60] signed long int stepLocal_0 = var_1_6 & 10000; [L61] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_0=10000, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=19/4, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_9=10] [L61] COND TRUE ((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < stepLocal_0 [L62] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L66] COND TRUE last_1_var_1_14 <= last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=4, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L67] COND TRUE ((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13))) [L68] var_1_14 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L75] COND FALSE !(last_1_var_1_20 > last_1_var_1_15) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=10] [L80] COND TRUE last_1_var_1_14 <= 16 [L81] var_1_9 = last_1_var_1_25 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L84] unsigned long int stepLocal_5 = (3423867512u - var_1_13) - var_1_24; [L85] signed long int stepLocal_4 = 8; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] EXPR last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_4=8, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L86] COND TRUE stepLocal_4 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25)))) [L87] COND FALSE !(var_1_8 >= last_1_var_1_18) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] EXPR last_1_var_1_11 >> var_1_14 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L95] COND FALSE !(! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) [L98] signed char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_1=0, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=259/4, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_9=2] [L99] COND TRUE (var_1_9 + var_1_25) >= stepLocal_1 [L100] var_1_18 = ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L102] var_1_17 = var_1_13 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=32, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L103] COND TRUE ! var_1_2 [L104] var_1_22 = (var_1_23 - var_1_25) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-16, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L108] COND TRUE var_1_7 >= 4.5 [L109] var_1_15 = (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L111] var_1_28 = (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) [L112] unsigned long int stepLocal_3 = var_1_22; [L113] signed char stepLocal_2 = var_1_13; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_2=0, stepLocal_3=2147483645, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=32, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L114] COND TRUE stepLocal_2 == (var_1_6 * (var_1_12 - 64)) [L115] var_1_20 = var_1_17 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=2147483645, stepLocal_5=6645092985, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L125] unsigned long int stepLocal_7 = var_1_14; [L126] unsigned long int stepLocal_6 = var_1_23; VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=2147483645, stepLocal_5=6645092985, stepLocal_6=2147483647, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L127] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, stepLocal_3=2147483645, stepLocal_5=6645092985, stepLocal_6=2147483647, stepLocal_7=0, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L198] RET step() [L199] CALL, EXPR property() [L189] EXPR (last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR var_1_6 & 10000 VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR (((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189] EXPR ((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13))) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L189-L190] return ((((((((((((((last_1_var_1_20 + last_1_var_1_15) | last_1_var_1_9) < (var_1_6 & 10000)) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))))) && ((last_1_var_1_20 > last_1_var_1_15) ? ((last_1_var_1_1 < var_1_7) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1) : ((last_1_var_1_14 <= 16) ? (var_1_9 == ((unsigned short int) last_1_var_1_25)) : 1))) && ((! ((var_1_12 - var_1_13) <= (last_1_var_1_11 >> var_1_14))) ? (var_1_11 == ((unsigned short int) var_1_13)) : 1)) && ((last_1_var_1_14 <= last_1_var_1_15) ? ((((last_1_var_1_26 % var_1_6) * (last_1_var_1_17 / 1000000000u)) >= ((((10u) < (var_1_13)) ? (10u) : (var_1_13)))) ? (var_1_14 == ((unsigned long int) var_1_13)) : (var_1_14 == ((unsigned long int) last_1_var_1_22))) : (var_1_14 == ((unsigned long int) last_1_var_1_26)))) && ((var_1_7 >= 4.5) ? (var_1_15 == ((signed short int) (((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) - ((((var_1_13) > (var_1_25)) ? (var_1_13) : (var_1_25)))))) : 1)) && (var_1_17 == ((unsigned char) var_1_13))) && (((var_1_9 + var_1_25) >= var_1_13) ? (var_1_18 == ((double) ((((var_1_7) > (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19))))) ? (var_1_7) : (((((var_1_8) > (var_1_19)) ? (var_1_8) : (var_1_19)))))))) : 1)) && ((var_1_13 == (var_1_6 * (var_1_12 - 64))) ? (var_1_20 == ((unsigned long int) var_1_17)) : ((! (var_1_7 <= (var_1_1 * var_1_8))) ? ((var_1_28 < var_1_22) ? (var_1_20 == ((unsigned long int) var_1_9)) : (var_1_20 == ((unsigned long int) var_1_9))) : 1))) && ((! var_1_2) ? (var_1_22 == ((unsigned long int) (var_1_23 - var_1_25))) : (var_1_22 == ((unsigned long int) (var_1_17 + (var_1_24 - var_1_9)))))) && ((8 > (last_1_var_1_17 & ((((last_1_var_1_25) < 0 ) ? -(last_1_var_1_25) : (last_1_var_1_25))))) ? ((var_1_8 >= last_1_var_1_18) ? ((((last_1_var_1_28 | last_1_var_1_25) + last_1_var_1_11) < ((3423867512u - var_1_13) - var_1_24)) ? (var_1_25 == ((unsigned char) var_1_13)) : 1) : 1) : (var_1_25 == ((unsigned char) var_1_13)))) && (var_1_2 ? ((var_1_23 >= var_1_25) ? (((var_1_25 - 10) <= var_1_14) ? (var_1_27 ? (var_1_26 == ((signed long int) (((((((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) < (var_1_17)) ? (((((var_1_25) < (var_1_22)) ? (var_1_25) : (var_1_22)))) : (var_1_17))) + var_1_17))) : 1) : (var_1_26 == ((signed long int) ((((var_1_12) < (var_1_17)) ? (var_1_12) : (var_1_17)))))) : (var_1_26 == ((signed long int) ((-32 + var_1_22) + var_1_14)))) : 1)) && (var_1_28 == ((unsigned short int) (var_1_29 - (var_1_13 + ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))))) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=10000, last_1_var_1_14=4, last_1_var_1_15=-16, last_1_var_1_17=5, last_1_var_1_18=259/4, last_1_var_1_1=19/4, last_1_var_1_20=32, last_1_var_1_22=32, last_1_var_1_25=2, last_1_var_1_26=4, last_1_var_1_28=32, last_1_var_1_9=10, var_1_11=10000, var_1_12=64, var_1_13=0, var_1_14=0, var_1_15=-2, var_1_17=0, var_1_18=2, var_1_19=0, var_1_1=2, var_1_20=0, var_1_22=2147483645, var_1_23=2147483647, var_1_24=-3221225473, var_1_25=2, var_1_26=4, var_1_27=0, var_1_28=32765, var_1_29=32767, var_1_2=0, var_1_6=10000, var_1_7=2, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 14, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2964 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2962 mSDsluCounter, 6629 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4274 mSDsCounter, 665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 665 mSolverCounterUnsat, 2355 mSDtfsCounter, 1069 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3813occurred in iteration=12, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 1694 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2367 NumberOfCodeBlocks, 2367 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2196 ConstructedInterpolants, 0 QuantifiedInterpolants, 6628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 11265/11400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:07:27,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:07:29,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:07:29,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:07:29,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:07:29,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:07:29,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:07:29,955 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:07:29,955 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:07:29,956 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:07:29,958 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:07:29,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:07:29,959 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:07:29,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:07:29,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:07:29,962 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:07:29,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:07:29,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:07:29,963 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:07:29,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:07:29,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:07:29,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:07:29,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:07:29,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:07:29,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:07:29,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:07:29,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:07:29,970 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:07:29,970 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:07:29,970 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:07:29,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:07:29,971 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:07:29,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:07:29,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:07:29,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:07:29,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:07:29,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:07:29,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:07:29,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:07:29,975 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:07:29,976 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:07:29,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:07:29,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:07:29,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:07:29,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:07:29,979 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:07:29,979 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b670c0ce186fd09c40b80582419dd7d06ef4a420fd0c29de5d521d6799e6a1a [2024-10-11 12:07:30,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:07:30,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:07:30,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:07:30,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:07:30,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:07:30,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-10-11 12:07:32,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:07:32,375 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:07:32,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-11.i [2024-10-11 12:07:32,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3442504a/87df641e7ebe4c7aadc3b3d2335d4529/FLAG77e226199 [2024-10-11 12:07:32,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f3442504a/87df641e7ebe4c7aadc3b3d2335d4529 [2024-10-11 12:07:32,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:07:32,719 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:07:32,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:07:32,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:07:32,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:07:32,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:07:32" (1/1) ... [2024-10-11 12:07:32,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714b1f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:32, skipping insertion in model container [2024-10-11 12:07:32,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:07:32" (1/1) ... [2024-10-11 12:07:32,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:07:32,992 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-11.i[916,929] [2024-10-11 12:07:33,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:07:33,086 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:07:33,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-11.i[916,929] [2024-10-11 12:07:33,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:07:33,190 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:07:33,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33 WrapperNode [2024-10-11 12:07:33,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:07:33,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:07:33,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:07:33,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:07:33,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,243 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-10-11 12:07:33,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:07:33,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:07:33,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:07:33,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:07:33,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,263 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,287 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:07:33,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,326 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:07:33,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:07:33,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:07:33,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:07:33,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (1/1) ... [2024-10-11 12:07:33,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:07:33,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:07:33,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:07:33,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:07:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:07:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:07:33,460 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:07:33,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:07:33,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:07:33,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:07:33,550 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:07:33,553 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:07:41,884 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 12:07:41,885 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:07:41,953 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:07:41,953 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:07:41,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:07:41 BoogieIcfgContainer [2024-10-11 12:07:41,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:07:41,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:07:41,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:07:41,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:07:41,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:07:32" (1/3) ... [2024-10-11 12:07:41,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffb6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:07:41, skipping insertion in model container [2024-10-11 12:07:41,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:07:33" (2/3) ... [2024-10-11 12:07:41,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ffb6e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:07:41, skipping insertion in model container [2024-10-11 12:07:41,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:07:41" (3/3) ... [2024-10-11 12:07:41,963 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-11.i [2024-10-11 12:07:41,981 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:07:41,981 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:07:42,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:07:42,062 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;@183bff39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:07:42,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:07:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:07:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 12:07:42,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:42,085 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:42,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:42,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:42,093 INFO L85 PathProgramCache]: Analyzing trace with hash 391274119, now seen corresponding path program 1 times [2024-10-11 12:07:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:07:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867554596] [2024-10-11 12:07:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:07:42,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:07:42,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:07:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:07:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:42,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:07:42,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:07:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-11 12:07:42,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:07:42,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:07:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867554596] [2024-10-11 12:07:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867554596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:42,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:42,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:07:42,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347254920] [2024-10-11 12:07:42,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:42,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:07:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:07:42,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:07:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:07:42,725 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 12:07:45,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:07:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:45,598 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-11 12:07:45,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:07:45,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-10-11 12:07:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:45,664 INFO L225 Difference]: With dead ends: 135 [2024-10-11 12:07:45,664 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 12:07:45,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-11 12:07:45,670 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:45,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 12:07:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 12:07:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 12:07:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 12:07:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 106 transitions. [2024-10-11 12:07:45,711 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 106 transitions. Word has length 132 [2024-10-11 12:07:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 106 transitions. [2024-10-11 12:07:45,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 12:07:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 106 transitions. [2024-10-11 12:07:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 12:07:45,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:45,717 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:45,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:07:45,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:07:45,922 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:45,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1277340431, now seen corresponding path program 1 times [2024-10-11 12:07:45,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:07:45,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512279742] [2024-10-11 12:07:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:45,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:07:45,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:07:45,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:07:45,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:07:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:46,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:07:46,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:07:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:07:49,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:07:49,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:07:49,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512279742] [2024-10-11 12:07:49,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512279742] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:07:49,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:07:49,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:07:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963468568] [2024-10-11 12:07:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:07:49,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:07:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:07:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:07:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:07:49,857 INFO L87 Difference]: Start difference. First operand 67 states and 106 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:53,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:07:57,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:07:57,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:07:57,773 INFO L93 Difference]: Finished difference Result 200 states and 317 transitions. [2024-10-11 12:07:57,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:07:57,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-10-11 12:07:57,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:07:57,832 INFO L225 Difference]: With dead ends: 200 [2024-10-11 12:07:57,836 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 12:07:57,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:07:57,838 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 65 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 42 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:07:57,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 283 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 32 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2024-10-11 12:07:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 12:07:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 108. [2024-10-11 12:07:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 12:07:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2024-10-11 12:07:57,887 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 132 [2024-10-11 12:07:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:07:57,891 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2024-10-11 12:07:57,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:07:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2024-10-11 12:07:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 12:07:57,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:07:57,894 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:07:57,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 12:07:58,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:07:58,096 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:07:58,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:07:58,097 INFO L85 PathProgramCache]: Analyzing trace with hash 602377574, now seen corresponding path program 1 times [2024-10-11 12:07:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:07:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125828994] [2024-10-11 12:07:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:07:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:07:58,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:07:58,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:07:58,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:07:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:07:58,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:07:58,548 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:08:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:08:01,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:08:01,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:08:01,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125828994] [2024-10-11 12:08:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125828994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:08:01,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:08:01,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 12:08:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179706696] [2024-10-11 12:08:01,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:08:01,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:08:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:08:01,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:08:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:08:01,771 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:08:06,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:08:08,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:08:12,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:08:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:08:12,926 INFO L93 Difference]: Finished difference Result 254 states and 399 transitions. [2024-10-11 12:08:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:08:12,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-10-11 12:08:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:08:12,930 INFO L225 Difference]: With dead ends: 254 [2024-10-11 12:08:12,930 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 12:08:12,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 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-11 12:08:12,932 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 102 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:08:12,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 314 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2024-10-11 12:08:12,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 12:08:12,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2024-10-11 12:08:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 106 states have (on average 1.3867924528301887) internal successors, (147), 106 states have internal predecessors, (147), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 12:08:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 267 transitions. [2024-10-11 12:08:12,974 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 267 transitions. Word has length 133 [2024-10-11 12:08:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:08:12,975 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 267 transitions. [2024-10-11 12:08:12,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:08:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 267 transitions. [2024-10-11 12:08:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 12:08:12,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:08:12,980 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:08:12,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 12:08:13,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:08:13,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:08:13,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:08:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1245352858, now seen corresponding path program 1 times [2024-10-11 12:08:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:08:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635337887] [2024-10-11 12:08:13,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:08:13,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:08:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:08:13,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:08:13,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:08:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:08:13,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:08:13,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:08:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 12:08:15,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:08:15,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:08:15,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635337887] [2024-10-11 12:08:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635337887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:08:15,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:08:15,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:08:15,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900346423] [2024-10-11 12:08:15,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:08:15,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:08:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:08:15,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:08:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:08:15,177 INFO L87 Difference]: Start difference. First operand 170 states and 267 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 12:08:20,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:08:24,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:08:28,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 12:08:32,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []