./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_floatingpointinfluence_no-floats_file-2.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_floatingpointinfluence_no-floats_file-2.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 4b12f47b6a9e6367516ff056d37b273ff79ef947ae35a3f55eb64f05e3d00fe1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:53:25,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:53:25,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:53:25,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:53:25,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:53:25,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:53:25,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:53:25,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:53:25,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:53:25,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:53:25,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:53:25,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:53:25,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:53:25,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:53:25,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:53:25,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:53:25,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:53:25,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:53:25,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:53:25,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:53:25,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:53:25,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:53:25,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:53:25,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:53:25,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:53:25,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:53:25,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:53:25,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:53:25,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:53:25,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:53:25,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:53:25,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:53:25,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:53:25,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:53:25,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:53:25,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:53:25,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:53:25,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:53:25,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:53:25,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:53:25,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:53:25,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:53:25,490 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 -> 4b12f47b6a9e6367516ff056d37b273ff79ef947ae35a3f55eb64f05e3d00fe1 [2024-10-11 10:53:25,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:53:25,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:53:25,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:53:25,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:53:25,724 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:53:25,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i [2024-10-11 10:53:27,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:53:27,344 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:53:27,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i [2024-10-11 10:53:27,356 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9a1d1a784/f01b274d39cf4e9893defe29d2478c1e/FLAGec446897c [2024-10-11 10:53:27,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9a1d1a784/f01b274d39cf4e9893defe29d2478c1e [2024-10-11 10:53:27,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:53:27,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:53:27,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:53:27,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:53:27,385 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:53:27,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe6fe95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27, skipping insertion in model container [2024-10-11 10:53:27,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:53:27,540 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_floatingpointinfluence_no-floats_file-2.i[915,928] [2024-10-11 10:53:27,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:53:27,592 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:53:27,602 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_floatingpointinfluence_no-floats_file-2.i[915,928] [2024-10-11 10:53:27,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:53:27,639 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:53:27,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27 WrapperNode [2024-10-11 10:53:27,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:53:27,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:53:27,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:53:27,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:53:27,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,656 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,687 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-11 10:53:27,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:53:27,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:53:27,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:53:27,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:53:27,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,724 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 10:53:27,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,790 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:53:27,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:53:27,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:53:27,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:53:27,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (1/1) ... [2024-10-11 10:53:27,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:53:27,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:53:27,830 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 10:53:27,833 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 10:53:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:53:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:53:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:53:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:53:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:53:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:53:27,948 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:53:27,950 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:53:28,158 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 10:53:28,158 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:53:28,202 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:53:28,202 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:53:28,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:53:28 BoogieIcfgContainer [2024-10-11 10:53:28,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:53:28,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:53:28,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:53:28,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:53:28,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:53:27" (1/3) ... [2024-10-11 10:53:28,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab5c4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:53:28, skipping insertion in model container [2024-10-11 10:53:28,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:53:27" (2/3) ... [2024-10-11 10:53:28,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab5c4f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:53:28, skipping insertion in model container [2024-10-11 10:53:28,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:53:28" (3/3) ... [2024-10-11 10:53:28,216 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-2.i [2024-10-11 10:53:28,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:53:28,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:53:28,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:53:28,297 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;@4fc882af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:53:28,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:53:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 10:53:28,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:28,316 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:28,317 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:28,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1804272360, now seen corresponding path program 1 times [2024-10-11 10:53:28,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:28,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021126553] [2024-10-11 10:53:28,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:28,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:29,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021126553] [2024-10-11 10:53:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021126553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:29,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:53:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672139713] [2024-10-11 10:53:29,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:29,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:53:29,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:29,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:53:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:53:29,630 INFO L87 Difference]: Start difference. First operand has 49 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:30,052 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2024-10-11 10:53:30,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:53:30,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-10-11 10:53:30,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:30,061 INFO L225 Difference]: With dead ends: 111 [2024-10-11 10:53:30,062 INFO L226 Difference]: Without dead ends: 63 [2024-10-11 10:53:30,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 10:53:30,068 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:30,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 135 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:53:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-10-11 10:53:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-10-11 10:53:30,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-10-11 10:53:30,103 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 87 [2024-10-11 10:53:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:30,105 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-10-11 10:53:30,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-10-11 10:53:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 10:53:30,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:30,108 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:30,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:53:30,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:30,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1681348310, now seen corresponding path program 1 times [2024-10-11 10:53:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:30,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303275668] [2024-10-11 10:53:30,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:30,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:30,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303275668] [2024-10-11 10:53:30,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303275668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:30,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:30,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:53:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904603832] [2024-10-11 10:53:30,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:30,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:53:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:30,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:53:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:53:30,482 INFO L87 Difference]: Start difference. First operand 53 states and 79 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:30,848 INFO L93 Difference]: Finished difference Result 106 states and 158 transitions. [2024-10-11 10:53:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:53:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-10-11 10:53:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:30,852 INFO L225 Difference]: With dead ends: 106 [2024-10-11 10:53:30,852 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 10:53:30,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 10:53:30,855 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:30,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 119 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:53:30,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 10:53:30,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2024-10-11 10:53:30,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:30,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2024-10-11 10:53:30,867 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 87 [2024-10-11 10:53:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2024-10-11 10:53:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2024-10-11 10:53:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 10:53:30,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:30,872 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:30,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:53:30,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:30,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:30,873 INFO L85 PathProgramCache]: Analyzing trace with hash 712265383, now seen corresponding path program 1 times [2024-10-11 10:53:30,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:30,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508059466] [2024-10-11 10:53:30,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:30,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508059466] [2024-10-11 10:53:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508059466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:53:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775140064] [2024-10-11 10:53:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:31,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:53:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:53:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:53:31,824 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:32,085 INFO L93 Difference]: Finished difference Result 90 states and 116 transitions. [2024-10-11 10:53:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:53:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-11 10:53:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:32,088 INFO L225 Difference]: With dead ends: 90 [2024-10-11 10:53:32,088 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 10:53:32,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:53:32,089 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 54 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:32,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 252 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:53:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 10:53:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2024-10-11 10:53:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.26) internal successors, (63), 51 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:53:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2024-10-11 10:53:32,102 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 89 [2024-10-11 10:53:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2024-10-11 10:53:32,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2024-10-11 10:53:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 10:53:32,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:32,107 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:53:32,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:32,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:32,108 INFO L85 PathProgramCache]: Analyzing trace with hash -173065847, now seen corresponding path program 1 times [2024-10-11 10:53:32,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:32,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934549119] [2024-10-11 10:53:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:32,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:33,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:33,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934549119] [2024-10-11 10:53:33,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934549119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:33,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:33,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:53:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968131016] [2024-10-11 10:53:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:33,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:53:33,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:53:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:53:33,148 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:33,563 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2024-10-11 10:53:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:53:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2024-10-11 10:53:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:33,566 INFO L225 Difference]: With dead ends: 115 [2024-10-11 10:53:33,566 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 10:53:33,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:53:33,567 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 74 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:33,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 333 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:53:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 10:53:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 66. [2024-10-11 10:53:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 48 states have internal predecessors, (59), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:53:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2024-10-11 10:53:33,579 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 90 [2024-10-11 10:53:33,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:33,580 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2024-10-11 10:53:33,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2024-10-11 10:53:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 10:53:33,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:33,582 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:33,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:53:33,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:33,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:33,583 INFO L85 PathProgramCache]: Analyzing trace with hash 980532706, now seen corresponding path program 1 times [2024-10-11 10:53:33,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:33,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898770708] [2024-10-11 10:53:33,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:33,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:33,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898770708] [2024-10-11 10:53:33,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898770708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:33,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:33,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:53:33,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761958164] [2024-10-11 10:53:33,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:33,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:53:33,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:33,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:53:33,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:53:33,654 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:33,707 INFO L93 Difference]: Finished difference Result 140 states and 190 transitions. [2024-10-11 10:53:33,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:53:33,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-10-11 10:53:33,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:33,710 INFO L225 Difference]: With dead ends: 140 [2024-10-11 10:53:33,710 INFO L226 Difference]: Without dead ends: 75 [2024-10-11 10:53:33,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 10:53:33,712 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:33,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:53:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-11 10:53:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2024-10-11 10:53:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 46 states have internal predecessors, (56), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 10:53:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2024-10-11 10:53:33,720 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 91 [2024-10-11 10:53:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:33,721 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2024-10-11 10:53:33,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2024-10-11 10:53:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 10:53:33,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:33,722 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:33,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:53:33,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:33,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:33,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1000098497, now seen corresponding path program 1 times [2024-10-11 10:53:33,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:33,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242985649] [2024-10-11 10:53:33,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242985649] [2024-10-11 10:53:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242985649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:53:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63154036] [2024-10-11 10:53:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:53:33,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:53:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:53:33,806 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:33,852 INFO L93 Difference]: Finished difference Result 129 states and 175 transitions. [2024-10-11 10:53:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:53:33,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-10-11 10:53:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:33,854 INFO L225 Difference]: With dead ends: 129 [2024-10-11 10:53:33,854 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 10:53:33,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 10:53:33,855 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 23 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:33,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:53:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 10:53:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2024-10-11 10:53:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2024-10-11 10:53:33,864 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 91 [2024-10-11 10:53:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:33,864 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2024-10-11 10:53:33,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2024-10-11 10:53:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 10:53:33,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:33,865 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:33,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:53:33,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:33,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1584718980, now seen corresponding path program 1 times [2024-10-11 10:53:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029277201] [2024-10-11 10:53:33,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:34,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:34,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029277201] [2024-10-11 10:53:34,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029277201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:34,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:34,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:53:34,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030106321] [2024-10-11 10:53:34,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:34,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:53:34,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:34,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:53:34,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:53:34,562 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:34,918 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2024-10-11 10:53:34,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:53:34,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-11 10:53:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:34,919 INFO L225 Difference]: With dead ends: 97 [2024-10-11 10:53:34,919 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 10:53:34,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:53:34,920 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:34,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 402 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:53:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 10:53:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2024-10-11 10:53:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2024-10-11 10:53:34,929 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 93 [2024-10-11 10:53:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:34,929 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2024-10-11 10:53:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2024-10-11 10:53:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 10:53:34,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:34,930 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:34,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:53:34,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:34,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1632645654, now seen corresponding path program 1 times [2024-10-11 10:53:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:34,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162781324] [2024-10-11 10:53:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:34,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:35,592 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:35,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:35,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162781324] [2024-10-11 10:53:35,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162781324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:35,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:35,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:53:35,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024415062] [2024-10-11 10:53:35,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:35,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:53:35,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:35,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:53:35,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:53:35,593 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:36,121 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2024-10-11 10:53:36,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 10:53:36,121 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-11 10:53:36,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:36,122 INFO L225 Difference]: With dead ends: 103 [2024-10-11 10:53:36,122 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 10:53:36,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-10-11 10:53:36,123 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 40 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:36,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 454 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:53:36,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 10:53:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 64. [2024-10-11 10:53:36,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2024-10-11 10:53:36,134 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 94 [2024-10-11 10:53:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:36,134 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2024-10-11 10:53:36,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2024-10-11 10:53:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 10:53:36,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:36,135 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:53:36,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:36,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:36,136 INFO L85 PathProgramCache]: Analyzing trace with hash 735672193, now seen corresponding path program 1 times [2024-10-11 10:53:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936826091] [2024-10-11 10:53:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:37,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:37,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936826091] [2024-10-11 10:53:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936826091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:53:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883881736] [2024-10-11 10:53:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:37,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:53:37,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:37,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:53:37,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:53:37,152 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:37,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:37,498 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-10-11 10:53:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:53:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-11 10:53:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:37,500 INFO L225 Difference]: With dead ends: 85 [2024-10-11 10:53:37,500 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 10:53:37,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:53:37,501 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 42 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:37,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 409 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:53:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 10:53:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2024-10-11 10:53:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 10:53:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2024-10-11 10:53:37,512 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 94 [2024-10-11 10:53:37,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:37,512 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2024-10-11 10:53:37,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2024-10-11 10:53:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 10:53:37,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:53:37,513 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:37,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:53:37,513 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:53:37,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:53:37,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1580003973, now seen corresponding path program 1 times [2024-10-11 10:53:37,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:53:37,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130669521] [2024-10-11 10:53:37,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:53:37,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:53:37,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:53:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:53:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:53:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:53:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:53:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:53:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:53:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:53:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:53:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:53:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:53:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:53:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:53:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:53:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:53:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 10:53:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:53:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130669521] [2024-10-11 10:53:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130669521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:53:38,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:53:38,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:53:38,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606219675] [2024-10-11 10:53:38,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:53:38,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:53:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:53:38,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:53:38,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:53:38,133 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:38,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:53:38,497 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-10-11 10:53:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:53:38,498 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-10-11 10:53:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:53:38,498 INFO L225 Difference]: With dead ends: 93 [2024-10-11 10:53:38,499 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 10:53:38,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-11 10:53:38,499 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:53:38,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 471 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:53:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 10:53:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 10:53:38,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 10:53:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 10:53:38,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2024-10-11 10:53:38,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:53:38,501 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 10:53:38,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 10:53:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 10:53:38,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 10:53:38,503 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:53:38,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 10:53:38,506 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:53:38,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 10:53:39,812 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:53:39,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:53:39 BoogieIcfgContainer [2024-10-11 10:53:39,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:53:39,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:53:39,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:53:39,824 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:53:39,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:53:28" (3/4) ... [2024-10-11 10:53:39,825 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 10:53:39,828 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 10:53:39,832 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 10:53:39,832 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-11 10:53:39,832 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 10:53:39,832 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 10:53:39,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 10:53:39,915 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 10:53:39,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:53:39,916 INFO L158 Benchmark]: Toolchain (without parser) took 12539.19ms. Allocated memory was 161.5MB in the beginning and 488.6MB in the end (delta: 327.2MB). Free memory was 93.7MB in the beginning and 430.4MB in the end (delta: -336.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:53:39,916 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:53:39,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.76ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 79.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 10:53:39,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.18ms. Allocated memory is still 161.5MB. Free memory was 79.3MB in the beginning and 75.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:53:39,917 INFO L158 Benchmark]: Boogie Preprocessor took 101.87ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 133.8MB in the end (delta: -58.0MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-11 10:53:39,917 INFO L158 Benchmark]: RCFGBuilder took 415.31ms. Allocated memory is still 161.5MB. Free memory was 133.8MB in the beginning and 111.9MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 10:53:39,920 INFO L158 Benchmark]: TraceAbstraction took 11615.06ms. Allocated memory was 161.5MB in the beginning and 488.6MB in the end (delta: 327.2MB). Free memory was 111.1MB in the beginning and 435.7MB in the end (delta: -324.6MB). Peak memory consumption was 269.6MB. Max. memory is 16.1GB. [2024-10-11 10:53:39,920 INFO L158 Benchmark]: Witness Printer took 92.31ms. Allocated memory is still 488.6MB. Free memory was 435.7MB in the beginning and 430.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:53:39,921 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.13ms. Allocated memory is still 117.4MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.76ms. Allocated memory is still 161.5MB. Free memory was 93.5MB in the beginning and 79.3MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.18ms. Allocated memory is still 161.5MB. Free memory was 79.3MB in the beginning and 75.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.87ms. Allocated memory is still 161.5MB. Free memory was 75.8MB in the beginning and 133.8MB in the end (delta: -58.0MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * RCFGBuilder took 415.31ms. Allocated memory is still 161.5MB. Free memory was 133.8MB in the beginning and 111.9MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11615.06ms. Allocated memory was 161.5MB in the beginning and 488.6MB in the end (delta: 327.2MB). Free memory was 111.1MB in the beginning and 435.7MB in the end (delta: -324.6MB). Peak memory consumption was 269.6MB. Max. memory is 16.1GB. * Witness Printer took 92.31ms. Allocated memory is still 488.6MB. Free memory was 435.7MB in the beginning and 430.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.2s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 2783 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2135 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1690 IncrementalHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 648 mSDtfsCounter, 1690 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=3, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 192 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 911 NumberOfCodeBlocks, 911 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 6047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3640/3640 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 10:53:39,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE