./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-66.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-66.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 ec19acff02761ce4cb6bd833355f9203a252d8e9565b5d08ccbe5e49c9ce80f5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:58:17,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:58:17,138 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:58:17,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:58:17,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:58:17,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:58:17,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:58:17,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:58:17,181 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:58:17,182 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:58:17,182 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:58:17,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:58:17,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:58:17,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:58:17,185 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:58:17,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:58:17,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:58:17,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:58:17,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:58:17,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:58:17,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:58:17,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:58:17,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:58:17,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:58:17,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:58:17,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:58:17,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:58:17,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:58:17,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:58:17,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:58:17,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:58:17,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:58:17,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:17,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:58:17,196 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:58:17,196 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:58:17,196 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:58:17,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:58:17,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:58:17,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:58:17,198 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:58:17,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:58:17,198 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 -> ec19acff02761ce4cb6bd833355f9203a252d8e9565b5d08ccbe5e49c9ce80f5 [2024-10-11 10:58:17,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:58:17,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:58:17,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:58:17,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:58:17,468 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:58:17,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i [2024-10-11 10:58:18,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:58:19,092 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:58:19,095 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i [2024-10-11 10:58:19,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af0cd2456/fb4fe87f1da4421a9fedce9196d663ce/FLAG8fbf16c97 [2024-10-11 10:58:19,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af0cd2456/fb4fe87f1da4421a9fedce9196d663ce [2024-10-11 10:58:19,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:58:19,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:58:19,119 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:19,119 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:58:19,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:58:19,124 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@608a561f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19, skipping insertion in model container [2024-10-11 10:58:19,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:58:19,295 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i[916,929] [2024-10-11 10:58:19,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:19,359 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:58:19,373 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-66.i[916,929] [2024-10-11 10:58:19,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:58:19,426 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:58:19,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19 WrapperNode [2024-10-11 10:58:19,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:58:19,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:19,428 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:58:19,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:58:19,435 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:58:19" (1/1) ... [2024-10-11 10:58:19,442 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:58:19" (1/1) ... [2024-10-11 10:58:19,472 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-11 10:58:19,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:58:19,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:58:19,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:58:19,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:58:19,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,515 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:58:19,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:58:19,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:58:19,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:58:19,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:58:19,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (1/1) ... [2024-10-11 10:58:19,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:58:19,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:58:19,579 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:58:19,584 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:58:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:58:19,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:58:19,622 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:58:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:58:19,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:58:19,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:58:19,689 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:58:19,691 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:58:19,952 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:58:19,953 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:58:20,000 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:58:20,001 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:58:20,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:20 BoogieIcfgContainer [2024-10-11 10:58:20,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:58:20,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:58:20,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:58:20,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:58:20,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:58:19" (1/3) ... [2024-10-11 10:58:20,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c8b736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:20, skipping insertion in model container [2024-10-11 10:58:20,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:58:19" (2/3) ... [2024-10-11 10:58:20,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c8b736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:58:20, skipping insertion in model container [2024-10-11 10:58:20,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:58:20" (3/3) ... [2024-10-11 10:58:20,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-66.i [2024-10-11 10:58:20,030 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:58:20,031 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:58:20,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:58:20,091 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;@ec99b50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:58:20,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:58:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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:58:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 10:58:20,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:20,105 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] [2024-10-11 10:58:20,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:20,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1944780512, now seen corresponding path program 1 times [2024-10-11 10:58:20,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296330052] [2024-10-11 10:58:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,473 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:58:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:20,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296330052] [2024-10-11 10:58:20,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296330052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:20,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:20,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:58:20,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414348296] [2024-10-11 10:58:20,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:20,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:58:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:58:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:58:20,542 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 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 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:58:20,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:20,573 INFO L93 Difference]: Finished difference Result 75 states and 132 transitions. [2024-10-11 10:58:20,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:58:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2024-10-11 10:58:20,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:20,613 INFO L225 Difference]: With dead ends: 75 [2024-10-11 10:58:20,613 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 10:58:20,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:58:20,620 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:20,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:58:20,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 10:58:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-11 10:58:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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:58:20,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2024-10-11 10:58:20,664 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 85 [2024-10-11 10:58:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:20,664 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2024-10-11 10:58:20,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:58:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2024-10-11 10:58:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 10:58:20,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:20,670 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] [2024-10-11 10:58:20,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:58:20,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:20,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1661919200, now seen corresponding path program 1 times [2024-10-11 10:58:20,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:20,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373882256] [2024-10-11 10:58:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,062 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:58:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:21,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373882256] [2024-10-11 10:58:21,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373882256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:21,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:21,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:58:21,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947813413] [2024-10-11 10:58:21,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:58:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:58:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:58:21,067 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:58:21,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:21,127 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2024-10-11 10:58:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:58:21,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 85 [2024-10-11 10:58:21,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:21,135 INFO L225 Difference]: With dead ends: 109 [2024-10-11 10:58:21,135 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 10:58:21,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:58:21,139 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:21,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:58:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 10:58:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-10-11 10:58:21,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:58:21,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2024-10-11 10:58:21,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 85 [2024-10-11 10:58:21,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:21,165 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2024-10-11 10:58:21,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:58:21,165 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2024-10-11 10:58:21,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 10:58:21,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:21,167 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] [2024-10-11 10:58:21,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:58:21,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:21,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash -20088315, now seen corresponding path program 1 times [2024-10-11 10:58:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528396238] [2024-10-11 10:58:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:21,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:21,741 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:58:21,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:21,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528396238] [2024-10-11 10:58:21,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528396238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:21,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:21,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:58:21,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286830827] [2024-10-11 10:58:21,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:21,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:58:21,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:21,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:58:21,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:58:21,745 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:58:21,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:21,976 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2024-10-11 10:58:21,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:58:21,977 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2024-10-11 10:58:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:21,980 INFO L225 Difference]: With dead ends: 183 [2024-10-11 10:58:21,980 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 10:58:21,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:58:21,982 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:21,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 162 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:58:21,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 10:58:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2024-10-11 10:58:22,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:22,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2024-10-11 10:58:22,023 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 86 [2024-10-11 10:58:22,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:22,024 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2024-10-11 10:58:22,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:58:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2024-10-11 10:58:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 10:58:22,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:22,029 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] [2024-10-11 10:58:22,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:58:22,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:22,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:22,030 INFO L85 PathProgramCache]: Analyzing trace with hash -20147897, now seen corresponding path program 1 times [2024-10-11 10:58:22,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:22,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526646860] [2024-10-11 10:58:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:22,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:24,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:25,006 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:58:25,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:25,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526646860] [2024-10-11 10:58:25,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526646860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:25,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:25,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:25,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508352129] [2024-10-11 10:58:25,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:25,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:25,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:25,009 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:25,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:25,632 INFO L93 Difference]: Finished difference Result 120 states and 173 transitions. [2024-10-11 10:58:25,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:58:25,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 86 [2024-10-11 10:58:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:25,634 INFO L225 Difference]: With dead ends: 120 [2024-10-11 10:58:25,634 INFO L226 Difference]: Without dead ends: 118 [2024-10-11 10:58:25,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-10-11 10:58:25,636 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 53 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:25,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 241 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:25,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-11 10:58:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2024-10-11 10:58:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-10-11 10:58:25,660 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 86 [2024-10-11 10:58:25,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:25,660 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-10-11 10:58:25,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:25,661 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-10-11 10:58:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 10:58:25,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:25,666 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] [2024-10-11 10:58:25,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:58:25,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:25,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1204557765, now seen corresponding path program 1 times [2024-10-11 10:58:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:25,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617707039] [2024-10-11 10:58:25,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:25,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,008 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:58:29,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:29,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617707039] [2024-10-11 10:58:29,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617707039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:29,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:29,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389302145] [2024-10-11 10:58:29,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:29,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:29,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:29,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:29,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:29,012 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:29,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:29,746 INFO L93 Difference]: Finished difference Result 141 states and 193 transitions. [2024-10-11 10:58:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:58:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 86 [2024-10-11 10:58:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:29,750 INFO L225 Difference]: With dead ends: 141 [2024-10-11 10:58:29,750 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 10:58:29,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-11 10:58:29,751 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 65 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:29,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 244 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:58:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 10:58:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2024-10-11 10:58:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 163 transitions. [2024-10-11 10:58:29,789 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 163 transitions. Word has length 86 [2024-10-11 10:58:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 163 transitions. [2024-10-11 10:58:29,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 163 transitions. [2024-10-11 10:58:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 10:58:29,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:29,793 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] [2024-10-11 10:58:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:58:29,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1206404807, now seen corresponding path program 1 times [2024-10-11 10:58:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245986149] [2024-10-11 10:58:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:29,943 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:58:29,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:29,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245986149] [2024-10-11 10:58:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245986149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:29,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:58:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585325718] [2024-10-11 10:58:29,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:58:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:29,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:58:29,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:58:29,949 INFO L87 Difference]: Start difference. First operand 112 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:58:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:30,093 INFO L93 Difference]: Finished difference Result 185 states and 260 transitions. [2024-10-11 10:58:30,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:58:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 86 [2024-10-11 10:58:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:30,095 INFO L225 Difference]: With dead ends: 185 [2024-10-11 10:58:30,095 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 10:58:30,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:58:30,097 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:30,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 140 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:58:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 10:58:30,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 125. [2024-10-11 10:58:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2024-10-11 10:58:30,117 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 86 [2024-10-11 10:58:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2024-10-11 10:58:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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:58:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2024-10-11 10:58:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 10:58:30,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:30,120 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] [2024-10-11 10:58:30,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:58:30,121 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:30,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1261816067, now seen corresponding path program 1 times [2024-10-11 10:58:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384026304] [2024-10-11 10:58:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:34,822 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:58:34,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384026304] [2024-10-11 10:58:34,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384026304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:34,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:34,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769846853] [2024-10-11 10:58:34,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:34,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:34,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:34,824 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:35,422 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2024-10-11 10:58:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:58:35,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 86 [2024-10-11 10:58:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:35,424 INFO L225 Difference]: With dead ends: 200 [2024-10-11 10:58:35,424 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 10:58:35,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:58:35,426 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 67 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:35,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 234 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:58:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 10:58:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2024-10-11 10:58:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2024-10-11 10:58:35,457 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 86 [2024-10-11 10:58:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:35,457 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2024-10-11 10:58:35,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2024-10-11 10:58:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 10:58:35,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:35,459 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] [2024-10-11 10:58:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:58:35,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:35,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1263663109, now seen corresponding path program 1 times [2024-10-11 10:58:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:35,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215486521] [2024-10-11 10:58:35,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,961 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:58:37,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:37,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215486521] [2024-10-11 10:58:37,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215486521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:37,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:37,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:37,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852229801] [2024-10-11 10:58:37,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:37,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:37,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:37,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:37,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:37,964 INFO L87 Difference]: Start difference. First operand 126 states and 174 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:38,391 INFO L93 Difference]: Finished difference Result 151 states and 202 transitions. [2024-10-11 10:58:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:58:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 86 [2024-10-11 10:58:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:38,393 INFO L225 Difference]: With dead ends: 151 [2024-10-11 10:58:38,393 INFO L226 Difference]: Without dead ends: 149 [2024-10-11 10:58:38,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:58:38,394 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 63 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:38,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 226 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:38,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-11 10:58:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2024-10-11 10:58:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2024-10-11 10:58:38,412 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 86 [2024-10-11 10:58:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:38,413 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2024-10-11 10:58:38,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:58:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2024-10-11 10:58:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 10:58:38,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:38,414 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:58:38,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:58:38,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:38,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1313450494, now seen corresponding path program 1 times [2024-10-11 10:58:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21183142] [2024-10-11 10:58:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:40,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:40,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:40,424 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:58:40,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:40,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21183142] [2024-10-11 10:58:40,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21183142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:40,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:40,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:58:40,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485171256] [2024-10-11 10:58:40,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:40,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:58:40,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:40,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:58:40,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:58:40,427 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:58:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:41,183 INFO L93 Difference]: Finished difference Result 152 states and 202 transitions. [2024-10-11 10:58:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:58:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 87 [2024-10-11 10:58:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:41,186 INFO L225 Difference]: With dead ends: 152 [2024-10-11 10:58:41,186 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 10:58:41,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-11 10:58:41,187 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 91 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:41,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 210 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 10:58:41,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 127. [2024-10-11 10:58:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2024-10-11 10:58:41,210 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 87 [2024-10-11 10:58:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:41,211 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2024-10-11 10:58:41,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 10:58:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2024-10-11 10:58:41,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 10:58:41,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:41,213 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:58:41,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:58:41,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:41,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 461556868, now seen corresponding path program 1 times [2024-10-11 10:58:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763764239] [2024-10-11 10:58:41,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:46,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:46,035 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:58:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763764239] [2024-10-11 10:58:46,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763764239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:46,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:58:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256925245] [2024-10-11 10:58:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:58:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:58:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:58:46,037 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:58:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:46,513 INFO L93 Difference]: Finished difference Result 156 states and 207 transitions. [2024-10-11 10:58:46,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:58:46,513 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:58:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:46,514 INFO L225 Difference]: With dead ends: 156 [2024-10-11 10:58:46,514 INFO L226 Difference]: Without dead ends: 154 [2024-10-11 10:58:46,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 10:58:46,515 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 65 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:46,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 227 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-11 10:58:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2024-10-11 10:58:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.1818181818181819) internal successors, (91), 77 states have internal predecessors, (91), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2024-10-11 10:58:46,532 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 87 [2024-10-11 10:58:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:46,533 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2024-10-11 10:58:46,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:58:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2024-10-11 10:58:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 10:58:46,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:46,534 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:58:46,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 10:58:46,534 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:46,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:46,534 INFO L85 PathProgramCache]: Analyzing trace with hash 518815170, now seen corresponding path program 1 times [2024-10-11 10:58:46,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:46,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124476873] [2024-10-11 10:58:46,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:46,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:49,433 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:58:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124476873] [2024-10-11 10:58:49,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124476873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:49,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:49,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 10:58:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631039908] [2024-10-11 10:58:49,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:49,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:58:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:49,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:58:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:58:49,435 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:58:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:49,946 INFO L93 Difference]: Finished difference Result 152 states and 203 transitions. [2024-10-11 10:58:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:58:49,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:58:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:49,948 INFO L225 Difference]: With dead ends: 152 [2024-10-11 10:58:49,948 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 10:58:49,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 10:58:49,949 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 60 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:49,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 234 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 10:58:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2024-10-11 10:58:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 75 states have (on average 1.1733333333333333) internal successors, (88), 75 states have internal predecessors, (88), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:49,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 172 transitions. [2024-10-11 10:58:49,972 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 172 transitions. Word has length 87 [2024-10-11 10:58:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:49,972 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 172 transitions. [2024-10-11 10:58:49,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 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:58:49,973 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 172 transitions. [2024-10-11 10:58:49,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-10-11 10:58:49,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:49,975 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:58:49,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 10:58:49,975 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:49,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:49,976 INFO L85 PathProgramCache]: Analyzing trace with hash 324235561, now seen corresponding path program 1 times [2024-10-11 10:58:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:49,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270405770] [2024-10-11 10:58:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:50,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:58:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:58:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:58:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:58:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:58:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:58:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:58:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:58:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:58:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:58:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:58:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:58:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:58:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:58:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1534 trivial. 0 not checked. [2024-10-11 10:58:52,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270405770] [2024-10-11 10:58:52,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270405770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:58:52,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272701269] [2024-10-11 10:58:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:58:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:58:52,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:58:52,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:58:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:53,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:58:53,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:58:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 785 proven. 33 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-10-11 10:58:53,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:58:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 70 proven. 33 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2024-10-11 10:58:53,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272701269] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:58:53,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:58:53,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2024-10-11 10:58:53,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686577596] [2024-10-11 10:58:53,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:58:53,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 10:58:53,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 10:58:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:58:53,564 INFO L87 Difference]: Start difference. First operand 125 states and 172 transitions. Second operand has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-11 10:58:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:54,744 INFO L93 Difference]: Finished difference Result 238 states and 312 transitions. [2024-10-11 10:58:54,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 10:58:54,744 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 170 [2024-10-11 10:58:54,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:54,746 INFO L225 Difference]: With dead ends: 238 [2024-10-11 10:58:54,746 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 10:58:54,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2024-10-11 10:58:54,747 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 113 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:54,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 144 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 10:58:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 10:58:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 140. [2024-10-11 10:58:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 87 states have internal predecessors, (100), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 10:58:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 184 transitions. [2024-10-11 10:58:54,770 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 184 transitions. Word has length 170 [2024-10-11 10:58:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:54,771 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 184 transitions. [2024-10-11 10:58:54,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.214285714285714) internal successors, (59), 14 states have internal predecessors, (59), 3 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-11 10:58:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 184 transitions. [2024-10-11 10:58:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 10:58:54,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:54,773 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:58:54,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:58:54,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 10:58:54,978 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:54,978 INFO L85 PathProgramCache]: Analyzing trace with hash -774169141, now seen corresponding path program 1 times [2024-10-11 10:58:54,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:54,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894866078] [2024-10-11 10:58:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:58:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:58:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:58:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:58:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 10:58:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 10:58:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:58:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:58:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:58:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:58:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:58:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:58:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:58:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:58:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:58:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:58:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:58:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:58:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:58:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:58:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-10-11 10:58:57,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894866078] [2024-10-11 10:58:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894866078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:58:57,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150212744] [2024-10-11 10:58:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:58:57,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:58:57,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:58:57,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:58:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:57,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 10:58:57,922 INFO L278 TraceCheckSpWp]: Computing forward predicates...