./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:57:01,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:57:01,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:57:01,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:57:01,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:57:01,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:57:01,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:57:01,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:57:01,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:57:01,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:57:01,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:57:01,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:57:01,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:57:01,267 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:57:01,268 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:57:01,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:57:01,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:57:01,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:57:01,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:57:01,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:57:01,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:57:01,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:57:01,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:57:01,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:57:01,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:57:01,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:57:01,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:57:01,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:57:01,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:57:01,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:57:01,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:57:01,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:57:01,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:57:01,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:57:01,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:57:01,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:57:01,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:57:01,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:57:01,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:57:01,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:57:01,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:57:01,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:57:01,276 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bbfdf3f22061e77485b28b33d06a9820d2c4b7aa22afc378a1743c2d746b69df [2024-10-12 19:57:01,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:57:01,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:57:01,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:57:01,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:57:01,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:57:01,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-10-12 19:57:02,656 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:57:02,824 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:57:02,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.06.cil.c [2024-10-12 19:57:02,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e57b3dae/4be487ecf4dd48969a4cd1af53216aee/FLAG59a3ed113 [2024-10-12 19:57:03,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e57b3dae/4be487ecf4dd48969a4cd1af53216aee [2024-10-12 19:57:03,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:57:03,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:57:03,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:57:03,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:57:03,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:57:03,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37027767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03, skipping insertion in model container [2024-10-12 19:57:03,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:57:03,413 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/systemc/transmitter.06.cil.c[706,719] [2024-10-12 19:57:03,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:57:03,479 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:57:03,487 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/systemc/transmitter.06.cil.c[706,719] [2024-10-12 19:57:03,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:57:03,539 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:57:03,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03 WrapperNode [2024-10-12 19:57:03,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:57:03,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:57:03,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:57:03,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:57:03,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,574 INFO L138 Inliner]: procedures = 40, calls = 48, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 505 [2024-10-12 19:57:03,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:57:03,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:57:03,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:57:03,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:57:03,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,597 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-12 19:57:03,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,614 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:57:03,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:57:03,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:57:03,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:57:03,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (1/1) ... [2024-10-12 19:57:03,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:57:03,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:57:03,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:57:03,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:57:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:57:03,686 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:57:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:57:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:57:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:57:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 19:57:03,687 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 19:57:03,687 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:57:03,688 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:57:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:57:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:57:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:57:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:57:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:57:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:57:03,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:57:03,765 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:57:03,766 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:57:04,199 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-12 19:57:04,200 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:57:04,238 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:57:04,238 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-12 19:57:04,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:57:04 BoogieIcfgContainer [2024-10-12 19:57:04,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:57:04,240 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:57:04,240 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:57:04,242 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:57:04,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:57:03" (1/3) ... [2024-10-12 19:57:04,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123591df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:57:04, skipping insertion in model container [2024-10-12 19:57:04,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:57:03" (2/3) ... [2024-10-12 19:57:04,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123591df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:57:04, skipping insertion in model container [2024-10-12 19:57:04,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:57:04" (3/3) ... [2024-10-12 19:57:04,244 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.06.cil.c [2024-10-12 19:57:04,256 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:57:04,257 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:57:04,303 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:57:04,308 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;@6d05c99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:57:04,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:57:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 180 states have internal predecessors, (305), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 19:57:04,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:04,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:04,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:04,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:04,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -148933588, now seen corresponding path program 1 times [2024-10-12 19:57:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:04,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754353237] [2024-10-12 19:57:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:04,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:04,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754353237] [2024-10-12 19:57:04,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754353237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:04,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:04,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:57:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519389439] [2024-10-12 19:57:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:04,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:57:04,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:57:04,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:57:04,739 INFO L87 Difference]: Start difference. First operand has 205 states, 178 states have (on average 1.7134831460674158) internal successors, (305), 180 states have internal predecessors, (305), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:05,632 INFO L93 Difference]: Finished difference Result 472 states and 796 transitions. [2024-10-12 19:57:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:57:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:05,645 INFO L225 Difference]: With dead ends: 472 [2024-10-12 19:57:05,646 INFO L226 Difference]: Without dead ends: 271 [2024-10-12 19:57:05,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:57:05,654 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 536 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:05,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 365 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:57:05,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-12 19:57:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 203. [2024-10-12 19:57:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 178 states have internal predecessors, (281), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-12 19:57:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 319 transitions. [2024-10-12 19:57:05,721 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 319 transitions. Word has length 103 [2024-10-12 19:57:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:05,722 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 319 transitions. [2024-10-12 19:57:05,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 319 transitions. [2024-10-12 19:57:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:05,725 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:05,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:05,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:57:05,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash 907797614, now seen corresponding path program 1 times [2024-10-12 19:57:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:05,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851503946] [2024-10-12 19:57:05,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:05,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:05,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:05,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851503946] [2024-10-12 19:57:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851503946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100123641] [2024-10-12 19:57:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:05,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:05,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:05,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:05,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:05,953 INFO L87 Difference]: Start difference. First operand 203 states and 319 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:07,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:07,133 INFO L93 Difference]: Finished difference Result 727 states and 1178 transitions. [2024-10-12 19:57:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:57:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:07,141 INFO L225 Difference]: With dead ends: 727 [2024-10-12 19:57:07,141 INFO L226 Difference]: Without dead ends: 536 [2024-10-12 19:57:07,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:07,143 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 796 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:07,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 684 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:57:07,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-12 19:57:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 401. [2024-10-12 19:57:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 354 states have (on average 1.5932203389830508) internal successors, (564), 356 states have internal predecessors, (564), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-10-12 19:57:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 633 transitions. [2024-10-12 19:57:07,215 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 633 transitions. Word has length 103 [2024-10-12 19:57:07,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:07,215 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 633 transitions. [2024-10-12 19:57:07,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 633 transitions. [2024-10-12 19:57:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:07,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:07,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:07,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:57:07,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1192356975, now seen corresponding path program 1 times [2024-10-12 19:57:07,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:07,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349327551] [2024-10-12 19:57:07,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:07,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:07,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:07,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:07,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:07,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349327551] [2024-10-12 19:57:07,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349327551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:07,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:07,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851291223] [2024-10-12 19:57:07,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:07,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:07,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:07,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:07,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:07,392 INFO L87 Difference]: Start difference. First operand 401 states and 633 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:09,239 INFO L93 Difference]: Finished difference Result 1279 states and 2050 transitions. [2024-10-12 19:57:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:09,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:09,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:09,244 INFO L225 Difference]: With dead ends: 1279 [2024-10-12 19:57:09,244 INFO L226 Difference]: Without dead ends: 890 [2024-10-12 19:57:09,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:09,246 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 862 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:09,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1156 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 19:57:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-12 19:57:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 585. [2024-10-12 19:57:09,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 517 states have (on average 1.5841392649903288) internal successors, (819), 520 states have internal predecessors, (819), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-10-12 19:57:09,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 918 transitions. [2024-10-12 19:57:09,287 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 918 transitions. Word has length 103 [2024-10-12 19:57:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:09,287 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 918 transitions. [2024-10-12 19:57:09,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 918 transitions. [2024-10-12 19:57:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:09,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:09,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:09,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:57:09,289 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:09,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2107916623, now seen corresponding path program 1 times [2024-10-12 19:57:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150784392] [2024-10-12 19:57:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:09,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:09,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:09,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150784392] [2024-10-12 19:57:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150784392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:09,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:09,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:09,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143289973] [2024-10-12 19:57:09,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:09,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:09,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:09,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:09,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:09,416 INFO L87 Difference]: Start difference. First operand 585 states and 918 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:11,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:11,189 INFO L93 Difference]: Finished difference Result 1969 states and 3145 transitions. [2024-10-12 19:57:11,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:11,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:11,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:11,199 INFO L225 Difference]: With dead ends: 1969 [2024-10-12 19:57:11,199 INFO L226 Difference]: Without dead ends: 1396 [2024-10-12 19:57:11,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:11,203 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 866 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:11,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1154 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:57:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-12 19:57:11,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 954. [2024-10-12 19:57:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.5758293838862558) internal successors, (1330), 849 states have internal predecessors, (1330), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-12 19:57:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1493 transitions. [2024-10-12 19:57:11,298 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1493 transitions. Word has length 103 [2024-10-12 19:57:11,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:11,298 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1493 transitions. [2024-10-12 19:57:11,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1493 transitions. [2024-10-12 19:57:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:11,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:11,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:11,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:57:11,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1521640401, now seen corresponding path program 1 times [2024-10-12 19:57:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160157184] [2024-10-12 19:57:11,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:11,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:11,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:11,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:11,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160157184] [2024-10-12 19:57:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160157184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:11,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:11,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744705528] [2024-10-12 19:57:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:11,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:11,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:11,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:11,448 INFO L87 Difference]: Start difference. First operand 954 states and 1493 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:12,134 INFO L93 Difference]: Finished difference Result 2242 states and 3572 transitions. [2024-10-12 19:57:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:12,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:12,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:12,139 INFO L225 Difference]: With dead ends: 2242 [2024-10-12 19:57:12,139 INFO L226 Difference]: Without dead ends: 1300 [2024-10-12 19:57:12,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:12,142 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 681 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:12,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 485 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:12,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2024-10-12 19:57:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 954. [2024-10-12 19:57:12,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.569905213270142) internal successors, (1325), 849 states have internal predecessors, (1325), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-12 19:57:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1488 transitions. [2024-10-12 19:57:12,188 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1488 transitions. Word has length 103 [2024-10-12 19:57:12,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:12,189 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1488 transitions. [2024-10-12 19:57:12,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:12,189 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1488 transitions. [2024-10-12 19:57:12,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:12,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:12,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:12,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:57:12,192 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:12,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash -896844077, now seen corresponding path program 1 times [2024-10-12 19:57:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:12,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801082530] [2024-10-12 19:57:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:12,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:12,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801082530] [2024-10-12 19:57:12,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801082530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:12,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:12,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209592842] [2024-10-12 19:57:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:12,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:12,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:12,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:12,311 INFO L87 Difference]: Start difference. First operand 954 states and 1488 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:12,941 INFO L93 Difference]: Finished difference Result 2236 states and 3545 transitions. [2024-10-12 19:57:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:12,947 INFO L225 Difference]: With dead ends: 2236 [2024-10-12 19:57:12,947 INFO L226 Difference]: Without dead ends: 1294 [2024-10-12 19:57:12,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:12,950 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 679 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:12,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 485 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2024-10-12 19:57:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 954. [2024-10-12 19:57:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 844 states have (on average 1.5639810426540284) internal successors, (1320), 849 states have internal predecessors, (1320), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-10-12 19:57:13,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1483 transitions. [2024-10-12 19:57:13,001 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1483 transitions. Word has length 103 [2024-10-12 19:57:13,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:13,001 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1483 transitions. [2024-10-12 19:57:13,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:13,001 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1483 transitions. [2024-10-12 19:57:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:13,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:13,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:13,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:57:13,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:13,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:13,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1518992273, now seen corresponding path program 1 times [2024-10-12 19:57:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:13,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434006877] [2024-10-12 19:57:13,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:13,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434006877] [2024-10-12 19:57:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434006877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045865831] [2024-10-12 19:57:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:13,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:13,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:13,152 INFO L87 Difference]: Start difference. First operand 954 states and 1483 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:14,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:14,609 INFO L93 Difference]: Finished difference Result 3281 states and 5168 transitions. [2024-10-12 19:57:14,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:57:14,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:14,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:14,619 INFO L225 Difference]: With dead ends: 3281 [2024-10-12 19:57:14,620 INFO L226 Difference]: Without dead ends: 2339 [2024-10-12 19:57:14,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:57:14,624 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 848 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:14,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1154 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:57:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2024-10-12 19:57:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1708. [2024-10-12 19:57:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1514 states have (on average 1.5561426684280053) internal successors, (2356), 1523 states have internal predecessors, (2356), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-10-12 19:57:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2653 transitions. [2024-10-12 19:57:14,727 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2653 transitions. Word has length 103 [2024-10-12 19:57:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:14,728 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2653 transitions. [2024-10-12 19:57:14,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:14,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2653 transitions. [2024-10-12 19:57:14,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:14,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:14,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:14,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:57:14,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:14,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:14,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1451118829, now seen corresponding path program 1 times [2024-10-12 19:57:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:14,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819683285] [2024-10-12 19:57:14,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:14,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:14,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:14,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:14,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:14,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819683285] [2024-10-12 19:57:14,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819683285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:14,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:14,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:14,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496366560] [2024-10-12 19:57:14,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:14,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:14,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:14,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:14,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:14,852 INFO L87 Difference]: Start difference. First operand 1708 states and 2653 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:16,643 INFO L93 Difference]: Finished difference Result 6501 states and 10230 transitions. [2024-10-12 19:57:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:16,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:16,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:16,661 INFO L225 Difference]: With dead ends: 6501 [2024-10-12 19:57:16,661 INFO L226 Difference]: Without dead ends: 4805 [2024-10-12 19:57:16,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:16,667 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 894 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:16,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1135 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:57:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2024-10-12 19:57:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 3193. [2024-10-12 19:57:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2839 states have (on average 1.5533638605142657) internal successors, (4410), 2856 states have internal predecessors, (4410), 235 states have call successors, (235), 102 states have call predecessors, (235), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-10-12 19:57:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4977 transitions. [2024-10-12 19:57:16,845 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4977 transitions. Word has length 103 [2024-10-12 19:57:16,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:16,846 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4977 transitions. [2024-10-12 19:57:16,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:16,847 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4977 transitions. [2024-10-12 19:57:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:16,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:16,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:16,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:57:16,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:16,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:16,851 INFO L85 PathProgramCache]: Analyzing trace with hash 115639121, now seen corresponding path program 1 times [2024-10-12 19:57:16,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:16,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954468365] [2024-10-12 19:57:16,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:16,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:16,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:16,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954468365] [2024-10-12 19:57:16,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954468365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:16,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:16,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:16,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531678434] [2024-10-12 19:57:16,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:16,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:16,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:16,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:16,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:16,964 INFO L87 Difference]: Start difference. First operand 3193 states and 4977 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:17,710 INFO L93 Difference]: Finished difference Result 7336 states and 11598 transitions. [2024-10-12 19:57:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:17,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:17,725 INFO L225 Difference]: With dead ends: 7336 [2024-10-12 19:57:17,725 INFO L226 Difference]: Without dead ends: 4155 [2024-10-12 19:57:17,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:17,734 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 591 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:17,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 579 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2024-10-12 19:57:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3193. [2024-10-12 19:57:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 2839 states have (on average 1.5473758365621697) internal successors, (4393), 2856 states have internal predecessors, (4393), 235 states have call successors, (235), 102 states have call predecessors, (235), 118 states have return successors, (332), 250 states have call predecessors, (332), 235 states have call successors, (332) [2024-10-12 19:57:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 4960 transitions. [2024-10-12 19:57:17,904 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 4960 transitions. Word has length 103 [2024-10-12 19:57:17,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:17,904 INFO L471 AbstractCegarLoop]: Abstraction has 3193 states and 4960 transitions. [2024-10-12 19:57:17,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:17,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 4960 transitions. [2024-10-12 19:57:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:17,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:17,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:17,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:57:17,908 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:17,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -942198957, now seen corresponding path program 1 times [2024-10-12 19:57:17,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:17,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244524375] [2024-10-12 19:57:17,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:17,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:17,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:18,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:18,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:18,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244524375] [2024-10-12 19:57:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244524375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702289953] [2024-10-12 19:57:18,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:18,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:18,020 INFO L87 Difference]: Start difference. First operand 3193 states and 4960 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:19,768 INFO L93 Difference]: Finished difference Result 11902 states and 18696 transitions. [2024-10-12 19:57:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:19,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:19,796 INFO L225 Difference]: With dead ends: 11902 [2024-10-12 19:57:19,796 INFO L226 Difference]: Without dead ends: 8721 [2024-10-12 19:57:19,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:19,803 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 958 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:19,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1135 Invalid, 2192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:57:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2024-10-12 19:57:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 6187. [2024-10-12 19:57:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6187 states, 5521 states have (on average 1.5441043289259193) internal successors, (8525), 5554 states have internal predecessors, (8525), 435 states have call successors, (435), 198 states have call predecessors, (435), 230 states have return successors, (710), 466 states have call predecessors, (710), 435 states have call successors, (710) [2024-10-12 19:57:20,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6187 states to 6187 states and 9670 transitions. [2024-10-12 19:57:20,150 INFO L78 Accepts]: Start accepts. Automaton has 6187 states and 9670 transitions. Word has length 103 [2024-10-12 19:57:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 6187 states and 9670 transitions. [2024-10-12 19:57:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:20,151 INFO L276 IsEmpty]: Start isEmpty. Operand 6187 states and 9670 transitions. [2024-10-12 19:57:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:20,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:20,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:20,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:57:20,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2084701423, now seen corresponding path program 1 times [2024-10-12 19:57:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87645240] [2024-10-12 19:57:20,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:20,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:20,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87645240] [2024-10-12 19:57:20,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87645240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:20,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:20,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:20,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757203155] [2024-10-12 19:57:20,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:20,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:20,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:20,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:20,282 INFO L87 Difference]: Start difference. First operand 6187 states and 9670 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:22,405 INFO L93 Difference]: Finished difference Result 22718 states and 35888 transitions. [2024-10-12 19:57:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:22,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:22,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:22,456 INFO L225 Difference]: With dead ends: 22718 [2024-10-12 19:57:22,457 INFO L226 Difference]: Without dead ends: 16543 [2024-10-12 19:57:22,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:22,506 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 864 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:22,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 1135 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:57:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16543 states. [2024-10-12 19:57:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16543 to 12172. [2024-10-12 19:57:23,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12172 states, 10898 states have (on average 1.5429436593870436) internal successors, (16815), 10963 states have internal predecessors, (16815), 819 states have call successors, (819), 390 states have call predecessors, (819), 454 states have return successors, (1612), 882 states have call predecessors, (1612), 819 states have call successors, (1612) [2024-10-12 19:57:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12172 states to 12172 states and 19246 transitions. [2024-10-12 19:57:23,228 INFO L78 Accepts]: Start accepts. Automaton has 12172 states and 19246 transitions. Word has length 103 [2024-10-12 19:57:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 12172 states and 19246 transitions. [2024-10-12 19:57:23,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12172 states and 19246 transitions. [2024-10-12 19:57:23,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:23,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:23,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:23,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:57:23,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:23,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:23,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1844461677, now seen corresponding path program 1 times [2024-10-12 19:57:23,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:23,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268294670] [2024-10-12 19:57:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:23,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:23,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:23,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268294670] [2024-10-12 19:57:23,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268294670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:23,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:23,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:23,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140435822] [2024-10-12 19:57:23,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:23,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:23,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:23,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:23,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:23,338 INFO L87 Difference]: Start difference. First operand 12172 states and 19246 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:26,565 INFO L93 Difference]: Finished difference Result 43035 states and 68802 transitions. [2024-10-12 19:57:26,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:57:26,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:26,673 INFO L225 Difference]: With dead ends: 43035 [2024-10-12 19:57:26,673 INFO L226 Difference]: Without dead ends: 30875 [2024-10-12 19:57:26,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:26,713 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 838 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 2384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:26,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1135 Invalid, 2384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 19:57:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30875 states. [2024-10-12 19:57:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30875 to 24206. [2024-10-12 19:57:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24206 states, 21748 states have (on average 1.5443718962663233) internal successors, (33587), 21877 states have internal predecessors, (33587), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-12 19:57:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24206 states to 24206 states and 39012 transitions. [2024-10-12 19:57:27,979 INFO L78 Accepts]: Start accepts. Automaton has 24206 states and 39012 transitions. Word has length 103 [2024-10-12 19:57:27,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:27,980 INFO L471 AbstractCegarLoop]: Abstraction has 24206 states and 39012 transitions. [2024-10-12 19:57:27,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 24206 states and 39012 transitions. [2024-10-12 19:57:28,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:28,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:28,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:28,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:57:28,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:28,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1817396075, now seen corresponding path program 1 times [2024-10-12 19:57:28,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:28,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096969289] [2024-10-12 19:57:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:28,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096969289] [2024-10-12 19:57:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096969289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:28,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034987104] [2024-10-12 19:57:28,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:28,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:28,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:28,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:28,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:28,092 INFO L87 Difference]: Start difference. First operand 24206 states and 39012 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:30,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:30,441 INFO L93 Difference]: Finished difference Result 53303 states and 86366 transitions. [2024-10-12 19:57:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:57:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:30,542 INFO L225 Difference]: With dead ends: 53303 [2024-10-12 19:57:30,542 INFO L226 Difference]: Without dead ends: 29110 [2024-10-12 19:57:30,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:57:30,599 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 267 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:30,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 652 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:57:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29110 states. [2024-10-12 19:57:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29110 to 24208. [2024-10-12 19:57:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24208 states, 21750 states have (on average 1.5384367816091955) internal successors, (33461), 21879 states have internal predecessors, (33461), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-12 19:57:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24208 states to 24208 states and 38886 transitions. [2024-10-12 19:57:32,165 INFO L78 Accepts]: Start accepts. Automaton has 24208 states and 38886 transitions. Word has length 103 [2024-10-12 19:57:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:32,165 INFO L471 AbstractCegarLoop]: Abstraction has 24208 states and 38886 transitions. [2024-10-12 19:57:32,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 24208 states and 38886 transitions. [2024-10-12 19:57:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:32,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:32,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:32,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:57:32,187 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:32,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:32,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1984945047, now seen corresponding path program 1 times [2024-10-12 19:57:32,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:32,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124824205] [2024-10-12 19:57:32,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:32,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:32,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:32,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:32,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124824205] [2024-10-12 19:57:32,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124824205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:32,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:32,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568500162] [2024-10-12 19:57:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:32,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:32,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:32,436 INFO L87 Difference]: Start difference. First operand 24208 states and 38886 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:34,409 INFO L93 Difference]: Finished difference Result 53565 states and 86501 transitions. [2024-10-12 19:57:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:57:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:34,490 INFO L225 Difference]: With dead ends: 53565 [2024-10-12 19:57:34,491 INFO L226 Difference]: Without dead ends: 29370 [2024-10-12 19:57:34,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:57:34,534 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 278 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:34,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 652 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:57:34,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29370 states. [2024-10-12 19:57:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29370 to 24466. [2024-10-12 19:57:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24466 states, 22008 states have (on average 1.5321246819338423) internal successors, (33719), 22137 states have internal predecessors, (33719), 1555 states have call successors, (1555), 774 states have call predecessors, (1555), 902 states have return successors, (3870), 1682 states have call predecessors, (3870), 1555 states have call successors, (3870) [2024-10-12 19:57:36,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24466 states to 24466 states and 39144 transitions. [2024-10-12 19:57:36,353 INFO L78 Accepts]: Start accepts. Automaton has 24466 states and 39144 transitions. Word has length 103 [2024-10-12 19:57:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:36,354 INFO L471 AbstractCegarLoop]: Abstraction has 24466 states and 39144 transitions. [2024-10-12 19:57:36,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24466 states and 39144 transitions. [2024-10-12 19:57:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:36,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:36,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:36,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:57:36,379 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:36,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:36,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1930552149, now seen corresponding path program 1 times [2024-10-12 19:57:36,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:36,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656233114] [2024-10-12 19:57:36,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:36,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:36,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:36,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:36,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656233114] [2024-10-12 19:57:36,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656233114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:36,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:36,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:57:36,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369302279] [2024-10-12 19:57:36,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:36,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:57:36,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:36,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:57:36,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:57:36,537 INFO L87 Difference]: Start difference. First operand 24466 states and 39144 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:57:44,185 INFO L93 Difference]: Finished difference Result 136801 states and 223349 transitions. [2024-10-12 19:57:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:57:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 103 [2024-10-12 19:57:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:57:44,578 INFO L225 Difference]: With dead ends: 136801 [2024-10-12 19:57:44,578 INFO L226 Difference]: Without dead ends: 112348 [2024-10-12 19:57:44,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:57:44,661 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 2091 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2107 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:57:44,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2107 Valid, 1064 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:57:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112348 states. [2024-10-12 19:57:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112348 to 93299. [2024-10-12 19:57:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93299 states, 83999 states have (on average 1.5267443660043571) internal successors, (128245), 84512 states have internal predecessors, (128245), 5691 states have call successors, (5691), 3096 states have call predecessors, (5691), 3608 states have return successors, (16707), 5818 states have call predecessors, (16707), 5691 states have call successors, (16707) [2024-10-12 19:57:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93299 states to 93299 states and 150643 transitions. [2024-10-12 19:57:50,663 INFO L78 Accepts]: Start accepts. Automaton has 93299 states and 150643 transitions. Word has length 103 [2024-10-12 19:57:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:57:50,664 INFO L471 AbstractCegarLoop]: Abstraction has 93299 states and 150643 transitions. [2024-10-12 19:57:50,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 19:57:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 93299 states and 150643 transitions. [2024-10-12 19:57:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:57:50,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:57:50,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:57:50,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:57:50,683 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:57:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:57:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -544689228, now seen corresponding path program 1 times [2024-10-12 19:57:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:57:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614064866] [2024-10-12 19:57:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:57:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:57:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:50,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:57:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-12 19:57:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:57:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:57:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:57:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:57:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:57:50,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:57:50,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614064866] [2024-10-12 19:57:50,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614064866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:57:50,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:57:50,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:57:50,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307728864] [2024-10-12 19:57:50,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:57:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:57:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:57:50,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:57:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:57:50,775 INFO L87 Difference]: Start difference. First operand 93299 states and 150643 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)