./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.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 35b23af90f01e46e9f818578c532dc01a817e343291a24c8592db5f0da05a3c7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:27:06,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:27:06,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:27:06,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:27:06,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:27:06,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:27:06,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:27:06,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:27:06,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:27:06,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:27:06,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:27:06,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:27:06,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:27:06,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:27:06,378 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:27:06,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:27:06,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:27:06,379 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:27:06,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:27:06,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:27:06,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:27:06,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:27:06,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:27:06,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:27:06,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:27:06,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:27:06,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:27:06,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:27:06,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:27:06,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:27:06,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:27:06,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:27:06,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:27:06,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:27:06,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:27:06,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:27:06,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:27:06,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:27:06,386 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:27:06,386 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:27:06,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:27:06,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:27:06,387 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 -> 35b23af90f01e46e9f818578c532dc01a817e343291a24c8592db5f0da05a3c7 [2024-10-14 03:27:06,640 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:27:06,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:27:06,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:27:06,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:27:06,671 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:27:06,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2024-10-14 03:27:08,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:27:08,376 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:27:08,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2024-10-14 03:27:08,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2e00a0a/64e769d24c9c4b37afb1a0cf308c1cc5/FLAG1e7c4ec3e [2024-10-14 03:27:08,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2e00a0a/64e769d24c9c4b37afb1a0cf308c1cc5 [2024-10-14 03:27:08,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:27:08,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:27:08,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:27:08,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:27:08,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:27:08,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:27:08" (1/1) ... [2024-10-14 03:27:08,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640f64d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:08, skipping insertion in model container [2024-10-14 03:27:08,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:27:08" (1/1) ... [2024-10-14 03:27:08,795 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:27:09,086 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/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c[12042,12055] [2024-10-14 03:27:09,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:27:09,110 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:27:09,166 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/seq-mthreaded/pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c[12042,12055] [2024-10-14 03:27:09,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:27:09,189 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:27:09,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09 WrapperNode [2024-10-14 03:27:09,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:27:09,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:27:09,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:27:09,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:27:09,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,249 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 429 [2024-10-14 03:27:09,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:27:09,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:27:09,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:27:09,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:27:09,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,297 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:27:09,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:27:09,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:27:09,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:27:09,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:27:09,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (1/1) ... [2024-10-14 03:27:09,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:27:09,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:09,376 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:27:09,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:27:09,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:27:09,435 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-10-14 03:27:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-10-14 03:27:09,435 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-14 03:27:09,435 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-14 03:27:09,435 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-10-14 03:27:09,436 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-10-14 03:27:09,437 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-10-14 03:27:09,438 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-10-14 03:27:09,438 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-10-14 03:27:09,438 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-10-14 03:27:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:27:09,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:27:09,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:27:09,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:27:09,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:27:10,282 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-10-14 03:27:10,282 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:27:10,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:27:10,328 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 03:27:10,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:10 BoogieIcfgContainer [2024-10-14 03:27:10,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:27:10,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:27:10,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:27:10,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:27:10,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:27:08" (1/3) ... [2024-10-14 03:27:10,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce84098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:27:10, skipping insertion in model container [2024-10-14 03:27:10,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:27:09" (2/3) ... [2024-10-14 03:27:10,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce84098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:27:10, skipping insertion in model container [2024-10-14 03:27:10,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:27:10" (3/3) ... [2024-10-14 03:27:10,339 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.ufo.BOUNDED-10.pals.c [2024-10-14 03:27:10,351 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:27:10,351 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:27:10,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:27:10,423 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;@610b8835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:27:10,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:27:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 137 states have internal predecessors, (216), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 03:27:10,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 03:27:10,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:10,435 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:10,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:10,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:10,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1464316671, now seen corresponding path program 1 times [2024-10-14 03:27:10,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:10,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875128730] [2024-10-14 03:27:10,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:10,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:10,763 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-14 03:27:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875128730] [2024-10-14 03:27:10,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875128730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:10,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:10,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257777118] [2024-10-14 03:27:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:10,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:10,803 INFO L87 Difference]: Start difference. First operand has 172 states, 133 states have (on average 1.6240601503759398) internal successors, (216), 137 states have internal predecessors, (216), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:27:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:10,969 INFO L93 Difference]: Finished difference Result 348 states and 597 transitions. [2024-10-14 03:27:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:10,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 03:27:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:10,984 INFO L225 Difference]: With dead ends: 348 [2024-10-14 03:27:10,985 INFO L226 Difference]: Without dead ends: 176 [2024-10-14 03:27:10,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:10,997 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:10,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 779 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-10-14 03:27:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-10-14 03:27:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5547445255474452) internal successors, (213), 140 states have internal predecessors, (213), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 03:27:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 277 transitions. [2024-10-14 03:27:11,061 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 277 transitions. Word has length 14 [2024-10-14 03:27:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:11,062 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 277 transitions. [2024-10-14 03:27:11,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:27:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 277 transitions. [2024-10-14 03:27:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 03:27:11,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:11,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:27:11,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:11,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1895232951, now seen corresponding path program 1 times [2024-10-14 03:27:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349738332] [2024-10-14 03:27:11,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:11,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,235 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-14 03:27:11,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:11,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349738332] [2024-10-14 03:27:11,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349738332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:11,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:11,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:11,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707178277] [2024-10-14 03:27:11,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:11,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:11,240 INFO L87 Difference]: Start difference. First operand 176 states and 277 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:27:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:11,366 INFO L93 Difference]: Finished difference Result 366 states and 578 transitions. [2024-10-14 03:27:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:11,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 03:27:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:11,370 INFO L225 Difference]: With dead ends: 366 [2024-10-14 03:27:11,370 INFO L226 Difference]: Without dead ends: 192 [2024-10-14 03:27:11,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:11,372 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:11,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 792 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:11,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-14 03:27:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-10-14 03:27:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5337837837837838) internal successors, (227), 151 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 03:27:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 293 transitions. [2024-10-14 03:27:11,391 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 293 transitions. Word has length 15 [2024-10-14 03:27:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 293 transitions. [2024-10-14 03:27:11,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:27:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 293 transitions. [2024-10-14 03:27:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 03:27:11,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:11,393 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] [2024-10-14 03:27:11,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:27:11,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:11,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:11,394 INFO L85 PathProgramCache]: Analyzing trace with hash -602557550, now seen corresponding path program 1 times [2024-10-14 03:27:11,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:11,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436162031] [2024-10-14 03:27:11,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:11,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,538 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-14 03:27:11,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:11,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436162031] [2024-10-14 03:27:11,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436162031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:11,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:27:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854367541] [2024-10-14 03:27:11,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:11,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:27:11,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:11,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:27:11,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:27:11,543 INFO L87 Difference]: Start difference. First operand 189 states and 293 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:27:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:11,584 INFO L93 Difference]: Finished difference Result 398 states and 624 transitions. [2024-10-14 03:27:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:27:11,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-10-14 03:27:11,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:11,589 INFO L225 Difference]: With dead ends: 398 [2024-10-14 03:27:11,591 INFO L226 Difference]: Without dead ends: 218 [2024-10-14 03:27:11,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:27:11,594 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:11,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 532 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-10-14 03:27:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 191. [2024-10-14 03:27:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.5266666666666666) internal successors, (229), 153 states have internal predecessors, (229), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 03:27:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 295 transitions. [2024-10-14 03:27:11,630 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 295 transitions. Word has length 22 [2024-10-14 03:27:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:11,631 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 295 transitions. [2024-10-14 03:27:11,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 03:27:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 295 transitions. [2024-10-14 03:27:11,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 03:27:11,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:11,635 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] [2024-10-14 03:27:11,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:27:11,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:11,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:11,637 INFO L85 PathProgramCache]: Analyzing trace with hash -73006397, now seen corresponding path program 1 times [2024-10-14 03:27:11,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:11,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563345481] [2024-10-14 03:27:11,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:11,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,765 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-14 03:27:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563345481] [2024-10-14 03:27:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563345481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715371154] [2024-10-14 03:27:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:11,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:11,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:11,768 INFO L87 Difference]: Start difference. First operand 191 states and 295 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:11,829 INFO L93 Difference]: Finished difference Result 429 states and 680 transitions. [2024-10-14 03:27:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:11,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-10-14 03:27:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:11,834 INFO L225 Difference]: With dead ends: 429 [2024-10-14 03:27:11,835 INFO L226 Difference]: Without dead ends: 288 [2024-10-14 03:27:11,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:11,838 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 120 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:11,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 788 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:11,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-14 03:27:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 191. [2024-10-14 03:27:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.5) internal successors, (225), 153 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 03:27:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 291 transitions. [2024-10-14 03:27:11,871 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 291 transitions. Word has length 30 [2024-10-14 03:27:11,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:11,871 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 291 transitions. [2024-10-14 03:27:11,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:11,872 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 291 transitions. [2024-10-14 03:27:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 03:27:11,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:11,876 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:27:11,877 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -363228684, now seen corresponding path program 1 times [2024-10-14 03:27:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817364394] [2024-10-14 03:27:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:27:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817364394] [2024-10-14 03:27:12,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817364394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:12,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:12,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457906046] [2024-10-14 03:27:12,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:12,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:12,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:12,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:12,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:12,031 INFO L87 Difference]: Start difference. First operand 191 states and 291 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:12,081 INFO L93 Difference]: Finished difference Result 373 states and 572 transitions. [2024-10-14 03:27:12,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:12,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-10-14 03:27:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:12,084 INFO L225 Difference]: With dead ends: 373 [2024-10-14 03:27:12,084 INFO L226 Difference]: Without dead ends: 193 [2024-10-14 03:27:12,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:12,086 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:12,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1048 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:12,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-14 03:27:12,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-10-14 03:27:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.4933333333333334) internal successors, (224), 153 states have internal predecessors, (224), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 03:27:12,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 290 transitions. [2024-10-14 03:27:12,099 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 290 transitions. Word has length 31 [2024-10-14 03:27:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 290 transitions. [2024-10-14 03:27:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:12,100 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 290 transitions. [2024-10-14 03:27:12,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 03:27:12,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:12,102 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:27:12,103 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:12,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash 424228152, now seen corresponding path program 1 times [2024-10-14 03:27:12,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:12,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384063446] [2024-10-14 03:27:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:27:12,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:12,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384063446] [2024-10-14 03:27:12,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384063446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:12,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391233037] [2024-10-14 03:27:12,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:12,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:12,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:12,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:27:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:27:12,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:27:12,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:12,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:27:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391233037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:12,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-14 03:27:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227754584] [2024-10-14 03:27:12,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:12,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:12,476 INFO L87 Difference]: Start difference. First operand 191 states and 290 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:27:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:12,533 INFO L93 Difference]: Finished difference Result 431 states and 668 transitions. [2024-10-14 03:27:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:12,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-10-14 03:27:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:12,536 INFO L225 Difference]: With dead ends: 431 [2024-10-14 03:27:12,537 INFO L226 Difference]: Without dead ends: 250 [2024-10-14 03:27:12,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:12,538 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 87 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:12,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 548 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:12,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-14 03:27:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2024-10-14 03:27:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 196 states have internal predecessors, (283), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-14 03:27:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 369 transitions. [2024-10-14 03:27:12,559 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 369 transitions. Word has length 34 [2024-10-14 03:27:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:12,559 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 369 transitions. [2024-10-14 03:27:12,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 03:27:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 369 transitions. [2024-10-14 03:27:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:27:12,562 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:12,563 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:12,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:12,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 03:27:12,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:12,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash 895414040, now seen corresponding path program 2 times [2024-10-14 03:27:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437477235] [2024-10-14 03:27:12,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 03:27:12,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:12,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437477235] [2024-10-14 03:27:12,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437477235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:12,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:12,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:12,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185275548] [2024-10-14 03:27:12,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:12,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:12,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:12,877 INFO L87 Difference]: Start difference. First operand 244 states and 369 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:12,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:12,935 INFO L93 Difference]: Finished difference Result 499 states and 765 transitions. [2024-10-14 03:27:12,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:12,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-10-14 03:27:12,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:12,938 INFO L225 Difference]: With dead ends: 499 [2024-10-14 03:27:12,938 INFO L226 Difference]: Without dead ends: 283 [2024-10-14 03:27:12,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:12,942 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 24 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:12,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 784 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-14 03:27:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 280. [2024-10-14 03:27:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 225 states have (on average 1.4222222222222223) internal successors, (320), 228 states have internal predecessors, (320), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 03:27:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 412 transitions. [2024-10-14 03:27:12,961 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 412 transitions. Word has length 56 [2024-10-14 03:27:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:12,961 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 412 transitions. [2024-10-14 03:27:12,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 412 transitions. [2024-10-14 03:27:12,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:27:12,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:12,962 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:27:12,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:12,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1856324599, now seen corresponding path program 1 times [2024-10-14 03:27:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797020248] [2024-10-14 03:27:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 03:27:13,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:13,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797020248] [2024-10-14 03:27:13,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797020248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:13,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:13,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:13,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286611462] [2024-10-14 03:27:13,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:13,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:13,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:13,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:13,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:13,051 INFO L87 Difference]: Start difference. First operand 280 states and 412 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:13,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:13,106 INFO L93 Difference]: Finished difference Result 534 states and 806 transitions. [2024-10-14 03:27:13,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:13,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2024-10-14 03:27:13,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:13,109 INFO L225 Difference]: With dead ends: 534 [2024-10-14 03:27:13,110 INFO L226 Difference]: Without dead ends: 287 [2024-10-14 03:27:13,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,111 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 8 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:13,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 766 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:13,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-14 03:27:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2024-10-14 03:27:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.41991341991342) internal successors, (328), 234 states have internal predecessors, (328), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 03:27:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 420 transitions. [2024-10-14 03:27:13,126 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 420 transitions. Word has length 56 [2024-10-14 03:27:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:13,126 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 420 transitions. [2024-10-14 03:27:13,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 03:27:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 420 transitions. [2024-10-14 03:27:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:27:13,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:13,128 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:13,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:27:13,128 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:13,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash 452708196, now seen corresponding path program 1 times [2024-10-14 03:27:13,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:13,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7022852] [2024-10-14 03:27:13,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:13,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:13,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-14 03:27:13,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:13,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7022852] [2024-10-14 03:27:13,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7022852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:13,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:13,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:13,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428445395] [2024-10-14 03:27:13,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:13,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:13,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:13,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:13,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,248 INFO L87 Difference]: Start difference. First operand 287 states and 420 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:27:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:13,288 INFO L93 Difference]: Finished difference Result 524 states and 780 transitions. [2024-10-14 03:27:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:13,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2024-10-14 03:27:13,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:13,291 INFO L225 Difference]: With dead ends: 524 [2024-10-14 03:27:13,291 INFO L226 Difference]: Without dead ends: 289 [2024-10-14 03:27:13,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,293 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:13,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1047 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-14 03:27:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2024-10-14 03:27:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.406926406926407) internal successors, (325), 234 states have internal predecessors, (325), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 03:27:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 417 transitions. [2024-10-14 03:27:13,307 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 417 transitions. Word has length 74 [2024-10-14 03:27:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:13,307 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 417 transitions. [2024-10-14 03:27:13,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:27:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 417 transitions. [2024-10-14 03:27:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 03:27:13,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:13,309 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:13,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:27:13,309 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1073627768, now seen corresponding path program 1 times [2024-10-14 03:27:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:13,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696212485] [2024-10-14 03:27:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-14 03:27:13,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:13,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696212485] [2024-10-14 03:27:13,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696212485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:13,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:13,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:13,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961329511] [2024-10-14 03:27:13,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:13,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:13,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:13,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:13,427 INFO L87 Difference]: Start difference. First operand 287 states and 417 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:27:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:13,494 INFO L93 Difference]: Finished difference Result 561 states and 836 transitions. [2024-10-14 03:27:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:13,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2024-10-14 03:27:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:13,499 INFO L225 Difference]: With dead ends: 561 [2024-10-14 03:27:13,499 INFO L226 Difference]: Without dead ends: 331 [2024-10-14 03:27:13,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,501 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 25 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:13,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 784 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:13,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-10-14 03:27:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2024-10-14 03:27:13,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 268 states have (on average 1.3694029850746268) internal successors, (367), 271 states have internal predecessors, (367), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-14 03:27:13,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 465 transitions. [2024-10-14 03:27:13,516 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 465 transitions. Word has length 103 [2024-10-14 03:27:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:13,517 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 465 transitions. [2024-10-14 03:27:13,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:27:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 465 transitions. [2024-10-14 03:27:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:27:13,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:13,518 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:13,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:27:13,519 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:13,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1618665253, now seen corresponding path program 1 times [2024-10-14 03:27:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649536365] [2024-10-14 03:27:13,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:13,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-10-14 03:27:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:13,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649536365] [2024-10-14 03:27:13,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649536365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:13,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:13,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621213821] [2024-10-14 03:27:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:13,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:13,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:13,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:13,692 INFO L87 Difference]: Start difference. First operand 328 states and 465 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:27:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:13,746 INFO L93 Difference]: Finished difference Result 587 states and 856 transitions. [2024-10-14 03:27:13,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:13,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-10-14 03:27:13,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:13,750 INFO L225 Difference]: With dead ends: 587 [2024-10-14 03:27:13,751 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 03:27:13,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,752 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 9 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:13,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 749 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 03:27:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-14 03:27:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.349809885931559) internal successors, (355), 266 states have internal predecessors, (355), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 03:27:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 451 transitions. [2024-10-14 03:27:13,769 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 451 transitions. Word has length 104 [2024-10-14 03:27:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:13,770 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 451 transitions. [2024-10-14 03:27:13,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 03:27:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 451 transitions. [2024-10-14 03:27:13,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-14 03:27:13,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:13,771 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:13,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:27:13,772 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:13,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1079619414, now seen corresponding path program 1 times [2024-10-14 03:27:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:13,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906523404] [2024-10-14 03:27:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:13,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-10-14 03:27:13,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:13,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906523404] [2024-10-14 03:27:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906523404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789615954] [2024-10-14 03:27:13,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:13,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:13,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:13,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,926 INFO L87 Difference]: Start difference. First operand 322 states and 451 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 03:27:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:13,962 INFO L93 Difference]: Finished difference Result 562 states and 805 transitions. [2024-10-14 03:27:13,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 123 [2024-10-14 03:27:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:13,965 INFO L225 Difference]: With dead ends: 562 [2024-10-14 03:27:13,965 INFO L226 Difference]: Without dead ends: 324 [2024-10-14 03:27:13,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:13,968 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:13,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1031 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-14 03:27:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2024-10-14 03:27:13,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.338403041825095) internal successors, (352), 266 states have internal predecessors, (352), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 03:27:13,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 448 transitions. [2024-10-14 03:27:13,983 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 448 transitions. Word has length 123 [2024-10-14 03:27:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:13,983 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 448 transitions. [2024-10-14 03:27:13,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 03:27:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 448 transitions. [2024-10-14 03:27:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 03:27:13,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:13,986 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:13,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:27:13,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:13,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash -955046142, now seen corresponding path program 1 times [2024-10-14 03:27:13,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:13,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748631072] [2024-10-14 03:27:13,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:13,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-14 03:27:14,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748631072] [2024-10-14 03:27:14,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748631072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:14,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:14,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:14,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850946037] [2024-10-14 03:27:14,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:14,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:14,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:14,127 INFO L87 Difference]: Start difference. First operand 322 states and 448 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 03:27:14,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:14,197 INFO L93 Difference]: Finished difference Result 525 states and 765 transitions. [2024-10-14 03:27:14,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:14,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 156 [2024-10-14 03:27:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:14,200 INFO L225 Difference]: With dead ends: 525 [2024-10-14 03:27:14,200 INFO L226 Difference]: Without dead ends: 320 [2024-10-14 03:27:14,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:14,201 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:14,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 717 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:14,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-14 03:27:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-10-14 03:27:14,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 262 states have (on average 1.3358778625954197) internal successors, (350), 265 states have internal predecessors, (350), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 03:27:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 444 transitions. [2024-10-14 03:27:14,219 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 444 transitions. Word has length 156 [2024-10-14 03:27:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:14,220 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 444 transitions. [2024-10-14 03:27:14,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-14 03:27:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 444 transitions. [2024-10-14 03:27:14,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-14 03:27:14,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:14,222 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:14,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:27:14,222 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:14,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1482802370, now seen corresponding path program 1 times [2024-10-14 03:27:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119828033] [2024-10-14 03:27:14,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-10-14 03:27:14,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:14,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119828033] [2024-10-14 03:27:14,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119828033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:14,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:14,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46109274] [2024-10-14 03:27:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:14,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:14,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:14,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:14,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:14,392 INFO L87 Difference]: Start difference. First operand 320 states and 444 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:27:14,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:14,466 INFO L93 Difference]: Finished difference Result 465 states and 661 transitions. [2024-10-14 03:27:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:14,467 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 171 [2024-10-14 03:27:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:14,469 INFO L225 Difference]: With dead ends: 465 [2024-10-14 03:27:14,470 INFO L226 Difference]: Without dead ends: 303 [2024-10-14 03:27:14,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:14,471 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 35 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:14,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 693 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-14 03:27:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-10-14 03:27:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 251 states have internal predecessors, (329), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 03:27:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2024-10-14 03:27:14,487 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 171 [2024-10-14 03:27:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2024-10-14 03:27:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:27:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2024-10-14 03:27:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-14 03:27:14,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:14,489 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:14,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:27:14,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 520522913, now seen corresponding path program 1 times [2024-10-14 03:27:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460060127] [2024-10-14 03:27:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:14,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,640 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-10-14 03:27:14,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:14,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460060127] [2024-10-14 03:27:14,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460060127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:14,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:14,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170605724] [2024-10-14 03:27:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:14,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:14,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:14,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:14,644 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:27:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:14,720 INFO L93 Difference]: Finished difference Result 448 states and 634 transitions. [2024-10-14 03:27:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 173 [2024-10-14 03:27:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:14,723 INFO L225 Difference]: With dead ends: 448 [2024-10-14 03:27:14,723 INFO L226 Difference]: Without dead ends: 284 [2024-10-14 03:27:14,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:14,724 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 30 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:14,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 697 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-14 03:27:14,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-14 03:27:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 232 states have (on average 1.3189655172413792) internal successors, (306), 235 states have internal predecessors, (306), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 03:27:14,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 388 transitions. [2024-10-14 03:27:14,738 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 388 transitions. Word has length 173 [2024-10-14 03:27:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:14,738 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 388 transitions. [2024-10-14 03:27:14,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 03:27:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 388 transitions. [2024-10-14 03:27:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-14 03:27:14,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:14,740 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:14,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:27:14,741 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1655232664, now seen corresponding path program 1 times [2024-10-14 03:27:14,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:14,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071250244] [2024-10-14 03:27:14,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:14,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-10-14 03:27:14,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:14,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071250244] [2024-10-14 03:27:14,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071250244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:14,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:14,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:14,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610604662] [2024-10-14 03:27:14,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:14,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:14,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:14,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:14,919 INFO L87 Difference]: Start difference. First operand 284 states and 388 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 03:27:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:14,957 INFO L93 Difference]: Finished difference Result 428 states and 604 transitions. [2024-10-14 03:27:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 174 [2024-10-14 03:27:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:14,960 INFO L225 Difference]: With dead ends: 428 [2024-10-14 03:27:14,960 INFO L226 Difference]: Without dead ends: 284 [2024-10-14 03:27:14,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:14,961 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:14,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1009 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-14 03:27:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-10-14 03:27:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 232 states have (on average 1.293103448275862) internal successors, (300), 235 states have internal predecessors, (300), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-14 03:27:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 382 transitions. [2024-10-14 03:27:14,973 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 382 transitions. Word has length 174 [2024-10-14 03:27:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:14,973 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 382 transitions. [2024-10-14 03:27:14,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 03:27:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 382 transitions. [2024-10-14 03:27:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-14 03:27:14,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:14,975 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:14,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:27:14,976 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:14,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1746472809, now seen corresponding path program 1 times [2024-10-14 03:27:14,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:14,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135738663] [2024-10-14 03:27:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:14,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-14 03:27:15,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:15,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135738663] [2024-10-14 03:27:15,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135738663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:15,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475861126] [2024-10-14 03:27:15,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:15,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:15,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:15,110 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:15,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:27:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:27:15,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-14 03:27:15,333 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-10-14 03:27:15,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475861126] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:15,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-14 03:27:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-10-14 03:27:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298490188] [2024-10-14 03:27:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:15,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:15,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:15,475 INFO L87 Difference]: Start difference. First operand 284 states and 382 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 03:27:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:15,528 INFO L93 Difference]: Finished difference Result 449 states and 626 transitions. [2024-10-14 03:27:15,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:15,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 181 [2024-10-14 03:27:15,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:15,531 INFO L225 Difference]: With dead ends: 449 [2024-10-14 03:27:15,531 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 03:27:15,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:15,532 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 30 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:15,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 477 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 03:27:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-10-14 03:27:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.2850467289719627) internal successors, (275), 217 states have internal predecessors, (275), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 03:27:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 351 transitions. [2024-10-14 03:27:15,545 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 351 transitions. Word has length 181 [2024-10-14 03:27:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:15,546 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 351 transitions. [2024-10-14 03:27:15,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-14 03:27:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 351 transitions. [2024-10-14 03:27:15,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 03:27:15,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:15,548 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:15,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:15,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 03:27:15,753 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:15,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1271681116, now seen corresponding path program 1 times [2024-10-14 03:27:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:15,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000444435] [2024-10-14 03:27:15,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-14 03:27:15,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:15,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000444435] [2024-10-14 03:27:15,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000444435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:15,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:15,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:15,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488098835] [2024-10-14 03:27:15,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:15,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:15,910 INFO L87 Difference]: Start difference. First operand 263 states and 351 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 03:27:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:15,948 INFO L93 Difference]: Finished difference Result 404 states and 565 transitions. [2024-10-14 03:27:15,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:15,949 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 205 [2024-10-14 03:27:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:15,951 INFO L225 Difference]: With dead ends: 404 [2024-10-14 03:27:15,951 INFO L226 Difference]: Without dead ends: 267 [2024-10-14 03:27:15,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:15,952 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:15,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 737 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:15,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-14 03:27:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-14 03:27:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 217 states have (on average 1.2811059907834101) internal successors, (278), 220 states have internal predecessors, (278), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 03:27:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 354 transitions. [2024-10-14 03:27:15,965 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 354 transitions. Word has length 205 [2024-10-14 03:27:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:15,967 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 354 transitions. [2024-10-14 03:27:15,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-14 03:27:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 354 transitions. [2024-10-14 03:27:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-14 03:27:15,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:15,969 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:15,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:27:15,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1233341410, now seen corresponding path program 1 times [2024-10-14 03:27:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:15,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491322558] [2024-10-14 03:27:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-14 03:27:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491322558] [2024-10-14 03:27:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491322558] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987505627] [2024-10-14 03:27:16,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:16,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:16,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:16,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:16,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:27:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:27:16,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:16,387 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-10-14 03:27:16,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:16,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987505627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:16,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:16,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 03:27:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231469020] [2024-10-14 03:27:16,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:16,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:16,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:16,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:16,389 INFO L87 Difference]: Start difference. First operand 267 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 03:27:16,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:16,435 INFO L93 Difference]: Finished difference Result 413 states and 573 transitions. [2024-10-14 03:27:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 212 [2024-10-14 03:27:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:16,438 INFO L225 Difference]: With dead ends: 413 [2024-10-14 03:27:16,438 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 03:27:16,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:27:16,439 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:16,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 739 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 03:27:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-10-14 03:27:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 221 states have (on average 1.2760180995475112) internal successors, (282), 224 states have internal predecessors, (282), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-14 03:27:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 358 transitions. [2024-10-14 03:27:16,460 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 358 transitions. Word has length 212 [2024-10-14 03:27:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 358 transitions. [2024-10-14 03:27:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-14 03:27:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 358 transitions. [2024-10-14 03:27:16,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-14 03:27:16,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:16,463 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:16,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:16,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:16,664 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:16,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:16,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1184005805, now seen corresponding path program 1 times [2024-10-14 03:27:16,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:16,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506010828] [2024-10-14 03:27:16,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:16,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:16,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-14 03:27:16,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506010828] [2024-10-14 03:27:16,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506010828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:16,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594214068] [2024-10-14 03:27:16,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:16,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:16,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:16,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:16,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 03:27:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:27:17,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-14 03:27:17,112 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:17,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594214068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:17,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:17,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 03:27:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622302100] [2024-10-14 03:27:17,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:17,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:17,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:17,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:17,114 INFO L87 Difference]: Start difference. First operand 272 states and 358 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 03:27:17,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:17,163 INFO L93 Difference]: Finished difference Result 417 states and 573 transitions. [2024-10-14 03:27:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:17,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 220 [2024-10-14 03:27:17,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:17,167 INFO L225 Difference]: With dead ends: 417 [2024-10-14 03:27:17,167 INFO L226 Difference]: Without dead ends: 271 [2024-10-14 03:27:17,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:27:17,168 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:17,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 729 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-14 03:27:17,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-10-14 03:27:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 221 states have (on average 1.262443438914027) internal successors, (279), 223 states have internal predecessors, (279), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 03:27:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 353 transitions. [2024-10-14 03:27:17,189 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 353 transitions. Word has length 220 [2024-10-14 03:27:17,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 353 transitions. [2024-10-14 03:27:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 03:27:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 353 transitions. [2024-10-14 03:27:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-14 03:27:17,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:17,195 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:17,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 03:27:17,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:17,396 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:17,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1274064016, now seen corresponding path program 1 times [2024-10-14 03:27:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754239022] [2024-10-14 03:27:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:17,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:17,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-10-14 03:27:17,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:17,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754239022] [2024-10-14 03:27:17,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754239022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:17,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:17,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:17,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590732313] [2024-10-14 03:27:17,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:17,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:17,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:17,597 INFO L87 Difference]: Start difference. First operand 271 states and 353 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 03:27:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:17,847 INFO L93 Difference]: Finished difference Result 415 states and 562 transitions. [2024-10-14 03:27:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 228 [2024-10-14 03:27:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:17,850 INFO L225 Difference]: With dead ends: 415 [2024-10-14 03:27:17,850 INFO L226 Difference]: Without dead ends: 270 [2024-10-14 03:27:17,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:17,852 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 59 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:17,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 473 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:27:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-14 03:27:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-10-14 03:27:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.257918552036199) internal successors, (278), 222 states have internal predecessors, (278), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 03:27:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 350 transitions. [2024-10-14 03:27:17,874 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 350 transitions. Word has length 228 [2024-10-14 03:27:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:17,875 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 350 transitions. [2024-10-14 03:27:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-14 03:27:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 350 transitions. [2024-10-14 03:27:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 03:27:17,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:17,878 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:17,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:27:17,879 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:17,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:17,879 INFO L85 PathProgramCache]: Analyzing trace with hash -665571617, now seen corresponding path program 1 times [2024-10-14 03:27:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458246187] [2024-10-14 03:27:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:18,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-10-14 03:27:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458246187] [2024-10-14 03:27:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458246187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463205934] [2024-10-14 03:27:18,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:18,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:18,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:18,192 INFO L87 Difference]: Start difference. First operand 270 states and 350 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:27:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:18,686 INFO L93 Difference]: Finished difference Result 619 states and 830 transitions. [2024-10-14 03:27:18,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:27:18,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 230 [2024-10-14 03:27:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:18,690 INFO L225 Difference]: With dead ends: 619 [2024-10-14 03:27:18,690 INFO L226 Difference]: Without dead ends: 475 [2024-10-14 03:27:18,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:27:18,692 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 407 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:18,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 617 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:27:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-14 03:27:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 421. [2024-10-14 03:27:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 342 states have (on average 1.304093567251462) internal successors, (446), 344 states have internal predecessors, (446), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 03:27:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 554 transitions. [2024-10-14 03:27:18,724 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 554 transitions. Word has length 230 [2024-10-14 03:27:18,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:18,725 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 554 transitions. [2024-10-14 03:27:18,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 03:27:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 554 transitions. [2024-10-14 03:27:18,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-10-14 03:27:18,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:18,728 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:18,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:27:18,728 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:18,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2013258127, now seen corresponding path program 1 times [2024-10-14 03:27:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:18,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254941473] [2024-10-14 03:27:18,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2024-10-14 03:27:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-14 03:27:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-10-14 03:27:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-10-14 03:27:18,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:18,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254941473] [2024-10-14 03:27:18,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254941473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:18,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:18,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921893621] [2024-10-14 03:27:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:18,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:18,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:18,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:18,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:18,965 INFO L87 Difference]: Start difference. First operand 421 states and 554 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 03:27:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:19,374 INFO L93 Difference]: Finished difference Result 889 states and 1224 transitions. [2024-10-14 03:27:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:19,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 257 [2024-10-14 03:27:19,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:19,379 INFO L225 Difference]: With dead ends: 889 [2024-10-14 03:27:19,379 INFO L226 Difference]: Without dead ends: 662 [2024-10-14 03:27:19,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:19,381 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 220 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:19,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 470 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:27:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-10-14 03:27:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 500. [2024-10-14 03:27:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 411 states have (on average 1.316301703163017) internal successors, (541), 414 states have internal predecessors, (541), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-14 03:27:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 659 transitions. [2024-10-14 03:27:19,423 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 659 transitions. Word has length 257 [2024-10-14 03:27:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:19,423 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 659 transitions. [2024-10-14 03:27:19,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 03:27:19,424 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 659 transitions. [2024-10-14 03:27:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-10-14 03:27:19,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:19,426 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:19,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:27:19,427 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:19,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1455159987, now seen corresponding path program 1 times [2024-10-14 03:27:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870011123] [2024-10-14 03:27:19,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:19,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-10-14 03:27:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-14 03:27:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-10-14 03:27:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-10-14 03:27:19,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:19,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870011123] [2024-10-14 03:27:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870011123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:19,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:19,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786709796] [2024-10-14 03:27:19,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:19,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:19,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:19,621 INFO L87 Difference]: Start difference. First operand 500 states and 659 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 03:27:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:20,019 INFO L93 Difference]: Finished difference Result 1060 states and 1455 transitions. [2024-10-14 03:27:20,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:20,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 258 [2024-10-14 03:27:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:20,025 INFO L225 Difference]: With dead ends: 1060 [2024-10-14 03:27:20,025 INFO L226 Difference]: Without dead ends: 783 [2024-10-14 03:27:20,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:20,026 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 221 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:20,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 498 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:27:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-10-14 03:27:20,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 608. [2024-10-14 03:27:20,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 507 states have (on average 1.331360946745562) internal successors, (675), 512 states have internal predecessors, (675), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-14 03:27:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 805 transitions. [2024-10-14 03:27:20,075 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 805 transitions. Word has length 258 [2024-10-14 03:27:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:20,076 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 805 transitions. [2024-10-14 03:27:20,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 03:27:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 805 transitions. [2024-10-14 03:27:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-14 03:27:20,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:20,079 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:27:20,079 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:20,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1232443562, now seen corresponding path program 1 times [2024-10-14 03:27:20,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:20,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014480354] [2024-10-14 03:27:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-14 03:27:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-14 03:27:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-14 03:27:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-10-14 03:27:20,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:20,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014480354] [2024-10-14 03:27:20,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014480354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:20,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:20,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:20,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941964613] [2024-10-14 03:27:20,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:20,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:20,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:20,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:20,260 INFO L87 Difference]: Start difference. First operand 608 states and 805 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:20,694 INFO L93 Difference]: Finished difference Result 1270 states and 1749 transitions. [2024-10-14 03:27:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:20,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 259 [2024-10-14 03:27:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:20,700 INFO L225 Difference]: With dead ends: 1270 [2024-10-14 03:27:20,700 INFO L226 Difference]: Without dead ends: 917 [2024-10-14 03:27:20,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:20,701 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 221 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:20,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 525 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:27:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-10-14 03:27:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 714. [2024-10-14 03:27:20,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 605 states have (on average 1.3537190082644628) internal successors, (819), 614 states have internal predecessors, (819), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-14 03:27:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 957 transitions. [2024-10-14 03:27:20,763 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 957 transitions. Word has length 259 [2024-10-14 03:27:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:20,765 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 957 transitions. [2024-10-14 03:27:20,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 957 transitions. [2024-10-14 03:27:20,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-14 03:27:20,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:20,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:20,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:27:20,768 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:20,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:20,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1507203176, now seen corresponding path program 1 times [2024-10-14 03:27:20,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:20,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575687677] [2024-10-14 03:27:20,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:20,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:21,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-14 03:27:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-10-14 03:27:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-14 03:27:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-10-14 03:27:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575687677] [2024-10-14 03:27:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575687677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797082201] [2024-10-14 03:27:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:21,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:21,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:21,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:21,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 03:27:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:27:21,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-10-14 03:27:21,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:21,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797082201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:21,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:21,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-14 03:27:21,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156761848] [2024-10-14 03:27:21,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:21,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:21,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:21,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:27:21,377 INFO L87 Difference]: Start difference. First operand 714 states and 957 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:21,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:21,516 INFO L93 Difference]: Finished difference Result 1177 states and 1621 transitions. [2024-10-14 03:27:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:21,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 259 [2024-10-14 03:27:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:21,521 INFO L225 Difference]: With dead ends: 1177 [2024-10-14 03:27:21,521 INFO L226 Difference]: Without dead ends: 714 [2024-10-14 03:27:21,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:27:21,523 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 31 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:21,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 664 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2024-10-14 03:27:21,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2024-10-14 03:27:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 605 states have (on average 1.343801652892562) internal successors, (813), 614 states have internal predecessors, (813), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-14 03:27:21,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 951 transitions. [2024-10-14 03:27:21,578 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 951 transitions. Word has length 259 [2024-10-14 03:27:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:21,578 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 951 transitions. [2024-10-14 03:27:21,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 951 transitions. [2024-10-14 03:27:21,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-14 03:27:21,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:21,581 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:21,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 03:27:21,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-14 03:27:21,782 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 632654985, now seen corresponding path program 1 times [2024-10-14 03:27:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820941842] [2024-10-14 03:27:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:22,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-14 03:27:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-14 03:27:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-10-14 03:27:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-10-14 03:27:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820941842] [2024-10-14 03:27:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820941842] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628469011] [2024-10-14 03:27:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:22,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:22,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:22,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 03:27:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:22,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 03:27:22,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-10-14 03:27:22,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628469011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:22,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:22,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-10-14 03:27:22,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293600645] [2024-10-14 03:27:22,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:22,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:22,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:22,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:22,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:27:22,376 INFO L87 Difference]: Start difference. First operand 714 states and 951 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:22,493 INFO L93 Difference]: Finished difference Result 1177 states and 1607 transitions. [2024-10-14 03:27:22,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:22,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2024-10-14 03:27:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:22,499 INFO L225 Difference]: With dead ends: 1177 [2024-10-14 03:27:22,499 INFO L226 Difference]: Without dead ends: 726 [2024-10-14 03:27:22,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:27:22,501 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 7 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:22,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 672 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2024-10-14 03:27:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2024-10-14 03:27:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 615 states have (on average 1.3447154471544716) internal successors, (827), 624 states have internal predecessors, (827), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-14 03:27:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 965 transitions. [2024-10-14 03:27:22,563 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 965 transitions. Word has length 260 [2024-10-14 03:27:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:22,564 INFO L471 AbstractCegarLoop]: Abstraction has 726 states and 965 transitions. [2024-10-14 03:27:22,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 965 transitions. [2024-10-14 03:27:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-14 03:27:22,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:22,567 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:22,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:22,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-14 03:27:22,769 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:22,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 75189186, now seen corresponding path program 1 times [2024-10-14 03:27:22,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:22,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103841694] [2024-10-14 03:27:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:22,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:23,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:23,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:23,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-10-14 03:27:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-10-14 03:27:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-10-14 03:27:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-10-14 03:27:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-10-14 03:27:23,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:23,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103841694] [2024-10-14 03:27:23,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103841694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:23,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:23,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:27:23,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951908957] [2024-10-14 03:27:23,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:23,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:23,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:23,087 INFO L87 Difference]: Start difference. First operand 726 states and 965 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:23,360 INFO L93 Difference]: Finished difference Result 1191 states and 1621 transitions. [2024-10-14 03:27:23,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 03:27:23,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-10-14 03:27:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:23,365 INFO L225 Difference]: With dead ends: 1191 [2024-10-14 03:27:23,365 INFO L226 Difference]: Without dead ends: 707 [2024-10-14 03:27:23,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 03:27:23,367 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 59 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:23,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 471 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:27:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-10-14 03:27:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2024-10-14 03:27:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 597 states have (on average 1.3266331658291457) internal successors, (792), 605 states have internal predecessors, (792), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-14 03:27:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 929 transitions. [2024-10-14 03:27:23,416 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 929 transitions. Word has length 261 [2024-10-14 03:27:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:23,416 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 929 transitions. [2024-10-14 03:27:23,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 03:27:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 929 transitions. [2024-10-14 03:27:23,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-10-14 03:27:23,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:23,419 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:23,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:27:23,419 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:23,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash -189143771, now seen corresponding path program 1 times [2024-10-14 03:27:23,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:23,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063091658] [2024-10-14 03:27:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:23,872 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-10-14 03:27:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:23,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063091658] [2024-10-14 03:27:23,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063091658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:23,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:23,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:27:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740472] [2024-10-14 03:27:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:23,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:27:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:23,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:27:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:27:23,874 INFO L87 Difference]: Start difference. First operand 707 states and 929 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 03:27:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:24,449 INFO L93 Difference]: Finished difference Result 1021 states and 1421 transitions. [2024-10-14 03:27:24,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:27:24,450 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 262 [2024-10-14 03:27:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:24,459 INFO L225 Difference]: With dead ends: 1021 [2024-10-14 03:27:24,459 INFO L226 Difference]: Without dead ends: 1019 [2024-10-14 03:27:24,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:27:24,461 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 183 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:24,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 1522 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:27:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2024-10-14 03:27:24,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 713. [2024-10-14 03:27:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 601 states have (on average 1.324459234608985) internal successors, (796), 610 states have internal predecessors, (796), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-14 03:27:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 935 transitions. [2024-10-14 03:27:24,522 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 935 transitions. Word has length 262 [2024-10-14 03:27:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:24,525 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 935 transitions. [2024-10-14 03:27:24,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 03:27:24,525 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 935 transitions. [2024-10-14 03:27:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-14 03:27:24,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:24,529 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:24,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:27:24,529 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:24,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:24,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1197847061, now seen corresponding path program 1 times [2024-10-14 03:27:24,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:24,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613075441] [2024-10-14 03:27:24,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 03:27:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-10-14 03:27:24,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613075441] [2024-10-14 03:27:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613075441] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410172458] [2024-10-14 03:27:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:24,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:25,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:25,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 03:27:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:25,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 03:27:25,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-14 03:27:25,416 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:25,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-10-14 03:27:25,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410172458] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:25,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:25,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-10-14 03:27:25,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451770806] [2024-10-14 03:27:25,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:25,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:27:25,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:25,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:27:25,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:27:25,804 INFO L87 Difference]: Start difference. First operand 713 states and 935 transitions. Second operand has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 14 states have internal predecessors, (144), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-14 03:27:27,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:27,381 INFO L93 Difference]: Finished difference Result 1718 states and 2337 transitions. [2024-10-14 03:27:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 03:27:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 14 states have internal predecessors, (144), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 270 [2024-10-14 03:27:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:27,389 INFO L225 Difference]: With dead ends: 1718 [2024-10-14 03:27:27,391 INFO L226 Difference]: Without dead ends: 1266 [2024-10-14 03:27:27,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 618 GetRequests, 581 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:27:27,394 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 354 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:27,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 2123 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 03:27:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-10-14 03:27:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 981. [2024-10-14 03:27:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 829 states have (on average 1.3112183353437876) internal successors, (1087), 839 states have internal predecessors, (1087), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2024-10-14 03:27:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1279 transitions. [2024-10-14 03:27:27,471 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1279 transitions. Word has length 270 [2024-10-14 03:27:27,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:27,471 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1279 transitions. [2024-10-14 03:27:27,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.578947368421052) internal successors, (144), 14 states have internal predecessors, (144), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-10-14 03:27:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1279 transitions. [2024-10-14 03:27:27,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-10-14 03:27:27,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:27,476 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:27,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 03:27:27,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:27,680 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash -236233044, now seen corresponding path program 1 times [2024-10-14 03:27:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988305812] [2024-10-14 03:27:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:27,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 03:27:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-10-14 03:27:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988305812] [2024-10-14 03:27:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988305812] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434417944] [2024-10-14 03:27:27,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:27,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:27,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:27,880 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:27,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 03:27:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:27:28,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-10-14 03:27:28,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:28,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434417944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:28,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:28,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 03:27:28,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277296746] [2024-10-14 03:27:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:28,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:28,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:28,113 INFO L87 Difference]: Start difference. First operand 981 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 03:27:28,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:28,242 INFO L93 Difference]: Finished difference Result 1826 states and 2423 transitions. [2024-10-14 03:27:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:28,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 270 [2024-10-14 03:27:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:28,248 INFO L225 Difference]: With dead ends: 1826 [2024-10-14 03:27:28,249 INFO L226 Difference]: Without dead ends: 965 [2024-10-14 03:27:28,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:27:28,251 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 4 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:28,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 669 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:27:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-14 03:27:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 965. [2024-10-14 03:27:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 818 states have (on average 1.2995110024449879) internal successors, (1063), 828 states have internal predecessors, (1063), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2024-10-14 03:27:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1246 transitions. [2024-10-14 03:27:28,323 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1246 transitions. Word has length 270 [2024-10-14 03:27:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:28,323 INFO L471 AbstractCegarLoop]: Abstraction has 965 states and 1246 transitions. [2024-10-14 03:27:28,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 03:27:28,324 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1246 transitions. [2024-10-14 03:27:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-10-14 03:27:28,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:28,326 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:28,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 03:27:28,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-10-14 03:27:28,527 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:28,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:28,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1167214169, now seen corresponding path program 1 times [2024-10-14 03:27:28,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:28,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256993619] [2024-10-14 03:27:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:28,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 03:27:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 03:27:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-10-14 03:27:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-10-14 03:27:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-10-14 03:27:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-10-14 03:27:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-14 03:27:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-10-14 03:27:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 03:27:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-10-14 03:27:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256993619] [2024-10-14 03:27:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256993619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403716145] [2024-10-14 03:27:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:28,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:28,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:28,746 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:28,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 03:27:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:28,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 03:27:28,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-10-14 03:27:28,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:28,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403716145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:28,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:28,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-14 03:27:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989264182] [2024-10-14 03:27:28,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:28,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 03:27:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:28,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 03:27:28,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:28,982 INFO L87 Difference]: Start difference. First operand 965 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 03:27:29,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:29,087 INFO L93 Difference]: Finished difference Result 1674 states and 2207 transitions. [2024-10-14 03:27:29,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:27:29,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 273 [2024-10-14 03:27:29,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:29,093 INFO L225 Difference]: With dead ends: 1674 [2024-10-14 03:27:29,093 INFO L226 Difference]: Without dead ends: 820 [2024-10-14 03:27:29,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:27:29,096 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:29,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 697 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:27:29,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2024-10-14 03:27:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2024-10-14 03:27:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 691 states have (on average 1.3024602026049203) internal successors, (900), 701 states have internal predecessors, (900), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-14 03:27:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1061 transitions. [2024-10-14 03:27:29,160 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1061 transitions. Word has length 273 [2024-10-14 03:27:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:29,161 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1061 transitions. [2024-10-14 03:27:29,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 03:27:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1061 transitions. [2024-10-14 03:27:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-10-14 03:27:29,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:29,163 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:29,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 03:27:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:29,365 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:29,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1310518252, now seen corresponding path program 1 times [2024-10-14 03:27:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307829708] [2024-10-14 03:27:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-14 03:27:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-10-14 03:27:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 03:27:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 18 proven. 148 refuted. 0 times theorem prover too weak. 563 trivial. 0 not checked. [2024-10-14 03:27:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307829708] [2024-10-14 03:27:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307829708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450415184] [2024-10-14 03:27:30,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:30,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:30,948 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:30,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 03:27:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:31,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:27:31,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-10-14 03:27:31,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:31,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450415184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 27 [2024-10-14 03:27:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418657394] [2024-10-14 03:27:31,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:31,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:27:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:31,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:27:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:27:31,421 INFO L87 Difference]: Start difference. First operand 820 states and 1061 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 03:27:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:32,234 INFO L93 Difference]: Finished difference Result 2178 states and 2825 transitions. [2024-10-14 03:27:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:27:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 285 [2024-10-14 03:27:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:32,243 INFO L225 Difference]: With dead ends: 2178 [2024-10-14 03:27:32,243 INFO L226 Difference]: Without dead ends: 1719 [2024-10-14 03:27:32,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 03:27:32,245 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 617 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 2753 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:32,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 2753 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:27:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1719 states. [2024-10-14 03:27:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1719 to 1353. [2024-10-14 03:27:32,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1126 states have (on average 1.2815275310834813) internal successors, (1443), 1141 states have internal predecessors, (1443), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-14 03:27:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1740 transitions. [2024-10-14 03:27:32,375 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1740 transitions. Word has length 285 [2024-10-14 03:27:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:32,376 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1740 transitions. [2024-10-14 03:27:32,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 03:27:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1740 transitions. [2024-10-14 03:27:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-14 03:27:32,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:32,379 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:32,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:32,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-10-14 03:27:32,584 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:32,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:32,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1676240983, now seen corresponding path program 1 times [2024-10-14 03:27:32,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:32,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167215416] [2024-10-14 03:27:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:32,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 03:27:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 03:27:32,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-10-14 03:27:32,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:32,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167215416] [2024-10-14 03:27:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167215416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:32,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:32,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:27:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316441844] [2024-10-14 03:27:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:32,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:27:32,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:32,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:27:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:27:32,835 INFO L87 Difference]: Start difference. First operand 1353 states and 1740 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 03:27:33,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:33,259 INFO L93 Difference]: Finished difference Result 2495 states and 3300 transitions. [2024-10-14 03:27:33,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:27:33,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 291 [2024-10-14 03:27:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:33,267 INFO L225 Difference]: With dead ends: 2495 [2024-10-14 03:27:33,267 INFO L226 Difference]: Without dead ends: 1488 [2024-10-14 03:27:33,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:27:33,270 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 94 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:33,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 675 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:27:33,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2024-10-14 03:27:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1446. [2024-10-14 03:27:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1198 states have (on average 1.2921535893155258) internal successors, (1548), 1213 states have internal predecessors, (1548), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2024-10-14 03:27:33,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1887 transitions. [2024-10-14 03:27:33,385 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1887 transitions. Word has length 291 [2024-10-14 03:27:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:33,386 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 1887 transitions. [2024-10-14 03:27:33,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 6 states have internal predecessors, (95), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 03:27:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1887 transitions. [2024-10-14 03:27:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-14 03:27:33,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:33,389 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:33,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:27:33,389 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:33,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash 788311333, now seen corresponding path program 1 times [2024-10-14 03:27:33,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:33,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829324485] [2024-10-14 03:27:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:33,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:33,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 03:27:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 03:27:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 03:27:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829324485] [2024-10-14 03:27:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829324485] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979030045] [2024-10-14 03:27:33,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:33,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:33,790 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:33,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 03:27:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:34,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 03:27:34,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-10-14 03:27:34,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:34,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979030045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:34,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:34,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2024-10-14 03:27:34,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54608563] [2024-10-14 03:27:34,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:34,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:27:34,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:34,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:27:34,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:27:34,310 INFO L87 Difference]: Start difference. First operand 1446 states and 1887 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 03:27:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:34,763 INFO L93 Difference]: Finished difference Result 3009 states and 3949 transitions. [2024-10-14 03:27:34,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:27:34,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 291 [2024-10-14 03:27:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:34,774 INFO L225 Difference]: With dead ends: 3009 [2024-10-14 03:27:34,774 INFO L226 Difference]: Without dead ends: 1916 [2024-10-14 03:27:34,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:27:34,779 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 122 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:34,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1693 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:27:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2024-10-14 03:27:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1666. [2024-10-14 03:27:34,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1381 states have (on average 1.283128167994207) internal successors, (1772), 1398 states have internal predecessors, (1772), 197 states have call successors, (197), 88 states have call predecessors, (197), 87 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2024-10-14 03:27:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2165 transitions. [2024-10-14 03:27:34,928 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2165 transitions. Word has length 291 [2024-10-14 03:27:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:34,929 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2165 transitions. [2024-10-14 03:27:34,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-14 03:27:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2165 transitions. [2024-10-14 03:27:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-14 03:27:34,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:34,932 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:34,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 03:27:35,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-14 03:27:35,133 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:35,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:35,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1463644453, now seen corresponding path program 1 times [2024-10-14 03:27:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202667418] [2024-10-14 03:27:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:35,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 03:27:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 03:27:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:35,903 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 03:27:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:35,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202667418] [2024-10-14 03:27:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202667418] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:35,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718125201] [2024-10-14 03:27:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:35,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:35,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:35,906 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:35,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 03:27:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:36,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 03:27:36,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-10-14 03:27:36,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:27:36,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718125201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:36,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:27:36,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 14 [2024-10-14 03:27:36,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734721979] [2024-10-14 03:27:36,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:36,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:27:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:27:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:27:36,263 INFO L87 Difference]: Start difference. First operand 1666 states and 2165 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 03:27:36,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:36,906 INFO L93 Difference]: Finished difference Result 3307 states and 4304 transitions. [2024-10-14 03:27:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:27:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 291 [2024-10-14 03:27:36,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:36,916 INFO L225 Difference]: With dead ends: 3307 [2024-10-14 03:27:36,916 INFO L226 Difference]: Without dead ends: 2054 [2024-10-14 03:27:36,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:27:36,921 INFO L432 NwaCegarLoop]: 365 mSDtfsCounter, 603 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2578 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:36,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2578 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:27:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2054 states. [2024-10-14 03:27:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2054 to 1633. [2024-10-14 03:27:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1633 states, 1358 states have (on average 1.2768777614138438) internal successors, (1734), 1375 states have internal predecessors, (1734), 187 states have call successors, (187), 88 states have call predecessors, (187), 87 states have return successors, (186), 176 states have call predecessors, (186), 186 states have call successors, (186) [2024-10-14 03:27:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1633 states to 1633 states and 2107 transitions. [2024-10-14 03:27:37,061 INFO L78 Accepts]: Start accepts. Automaton has 1633 states and 2107 transitions. Word has length 291 [2024-10-14 03:27:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:37,062 INFO L471 AbstractCegarLoop]: Abstraction has 1633 states and 2107 transitions. [2024-10-14 03:27:37,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 9 states have internal predecessors, (110), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-10-14 03:27:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1633 states and 2107 transitions. [2024-10-14 03:27:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-14 03:27:37,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:37,065 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:37,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 03:27:37,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-10-14 03:27:37,270 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:37,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -427842393, now seen corresponding path program 1 times [2024-10-14 03:27:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:37,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400065820] [2024-10-14 03:27:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:37,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-10-14 03:27:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-10-14 03:27:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:37,496 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-10-14 03:27:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:37,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400065820] [2024-10-14 03:27:37,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400065820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:37,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:37,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:37,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262404724] [2024-10-14 03:27:37,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:37,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:37,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:37,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:37,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:37,499 INFO L87 Difference]: Start difference. First operand 1633 states and 2107 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 03:27:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:38,153 INFO L93 Difference]: Finished difference Result 3178 states and 4147 transitions. [2024-10-14 03:27:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 03:27:38,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 291 [2024-10-14 03:27:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:38,164 INFO L225 Difference]: With dead ends: 3178 [2024-10-14 03:27:38,164 INFO L226 Difference]: Without dead ends: 1909 [2024-10-14 03:27:38,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:27:38,168 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 299 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:38,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 568 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:27:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2024-10-14 03:27:38,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1662. [2024-10-14 03:27:38,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1662 states, 1379 states have (on average 1.2799129804205946) internal successors, (1765), 1396 states have internal predecessors, (1765), 195 states have call successors, (195), 88 states have call predecessors, (195), 87 states have return successors, (194), 184 states have call predecessors, (194), 194 states have call successors, (194) [2024-10-14 03:27:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1662 states to 1662 states and 2154 transitions. [2024-10-14 03:27:38,310 INFO L78 Accepts]: Start accepts. Automaton has 1662 states and 2154 transitions. Word has length 291 [2024-10-14 03:27:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:38,310 INFO L471 AbstractCegarLoop]: Abstraction has 1662 states and 2154 transitions. [2024-10-14 03:27:38,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-14 03:27:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states and 2154 transitions. [2024-10-14 03:27:38,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-14 03:27:38,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:38,313 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:27:38,313 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:38,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:38,314 INFO L85 PathProgramCache]: Analyzing trace with hash 559736868, now seen corresponding path program 1 times [2024-10-14 03:27:38,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:38,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001293970] [2024-10-14 03:27:38,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:38,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-14 03:27:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 03:27:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-10-14 03:27:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-10-14 03:27:38,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:38,516 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-10-14 03:27:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001293970] [2024-10-14 03:27:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001293970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:38,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:38,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:38,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605253867] [2024-10-14 03:27:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:38,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:38,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:38,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:38,518 INFO L87 Difference]: Start difference. First operand 1662 states and 2154 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 03:27:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:39,231 INFO L93 Difference]: Finished difference Result 2979 states and 3893 transitions. [2024-10-14 03:27:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:27:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 299 [2024-10-14 03:27:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:39,241 INFO L225 Difference]: With dead ends: 2979 [2024-10-14 03:27:39,241 INFO L226 Difference]: Without dead ends: 1673 [2024-10-14 03:27:39,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:27:39,247 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 474 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:39,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 791 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:27:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2024-10-14 03:27:39,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1434. [2024-10-14 03:27:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1200 states have (on average 1.2608333333333333) internal successors, (1513), 1208 states have internal predecessors, (1513), 163 states have call successors, (163), 70 states have call predecessors, (163), 70 states have return successors, (163), 155 states have call predecessors, (163), 163 states have call successors, (163) [2024-10-14 03:27:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1839 transitions. [2024-10-14 03:27:39,419 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1839 transitions. Word has length 299 [2024-10-14 03:27:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:39,420 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 1839 transitions. [2024-10-14 03:27:39,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 03:27:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1839 transitions. [2024-10-14 03:27:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-14 03:27:39,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:39,426 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:39,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:27:39,426 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:39,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1991120, now seen corresponding path program 1 times [2024-10-14 03:27:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:39,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059252855] [2024-10-14 03:27:39,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:39,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-14 03:27:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 03:27:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-14 03:27:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-14 03:27:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-10-14 03:27:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-14 03:27:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-14 03:27:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-14 03:27:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,315 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2024-10-14 03:27:40,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:40,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059252855] [2024-10-14 03:27:40,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059252855] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:40,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804924722] [2024-10-14 03:27:40,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:40,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:40,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:40,318 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:40,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 03:27:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:40,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 1267 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 03:27:40,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 225 proven. 64 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2024-10-14 03:27:41,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 845 trivial. 0 not checked. [2024-10-14 03:27:41,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804924722] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:41,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:41,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 10] total 31 [2024-10-14 03:27:41,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020068221] [2024-10-14 03:27:41,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:41,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-14 03:27:41,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-14 03:27:41,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2024-10-14 03:27:41,999 INFO L87 Difference]: Start difference. First operand 1434 states and 1839 transitions. Second operand has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 29 states have internal predecessors, (284), 14 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (54), 15 states have call predecessors, (54), 14 states have call successors, (54) [2024-10-14 03:27:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:47,254 INFO L93 Difference]: Finished difference Result 6504 states and 8531 transitions. [2024-10-14 03:27:47,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-14 03:27:47,254 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 29 states have internal predecessors, (284), 14 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (54), 15 states have call predecessors, (54), 14 states have call successors, (54) Word has length 339 [2024-10-14 03:27:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:47,324 INFO L225 Difference]: With dead ends: 6504 [2024-10-14 03:27:47,324 INFO L226 Difference]: Without dead ends: 5434 [2024-10-14 03:27:47,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1037, Invalid=6445, Unknown=0, NotChecked=0, Total=7482 [2024-10-14 03:27:47,332 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 2326 mSDsluCounter, 5922 mSDsCounter, 0 mSdLazyCounter, 5645 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 6308 SdHoareTripleChecker+Invalid, 6264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 5645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:47,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 6308 Invalid, 6264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 5645 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 03:27:47,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5434 states. [2024-10-14 03:27:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5434 to 3022. [2024-10-14 03:27:47,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3022 states, 2514 states have (on average 1.2856006364359587) internal successors, (3232), 2534 states have internal predecessors, (3232), 354 states have call successors, (354), 153 states have call predecessors, (354), 153 states have return successors, (354), 334 states have call predecessors, (354), 354 states have call successors, (354) [2024-10-14 03:27:47,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 3940 transitions. [2024-10-14 03:27:47,776 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 3940 transitions. Word has length 339 [2024-10-14 03:27:47,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:47,777 INFO L471 AbstractCegarLoop]: Abstraction has 3022 states and 3940 transitions. [2024-10-14 03:27:47,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 9.161290322580646) internal successors, (284), 29 states have internal predecessors, (284), 14 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (54), 15 states have call predecessors, (54), 14 states have call successors, (54) [2024-10-14 03:27:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 3940 transitions. [2024-10-14 03:27:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-14 03:27:47,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:47,786 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:47,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-14 03:27:47,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-10-14 03:27:47,987 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:47,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:47,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1926281582, now seen corresponding path program 1 times [2024-10-14 03:27:47,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890462191] [2024-10-14 03:27:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:47,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-10-14 03:27:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 03:27:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 03:27:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 03:27:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-10-14 03:27:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-10-14 03:27:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-14 03:27:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-10-14 03:27:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-10-14 03:27:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2024-10-14 03:27:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2024-10-14 03:27:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2024-10-14 03:27:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2024-10-14 03:27:48,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:48,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890462191] [2024-10-14 03:27:48,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890462191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:48,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:48,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:27:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351905479] [2024-10-14 03:27:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:48,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:27:48,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:48,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:27:48,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:27:48,302 INFO L87 Difference]: Start difference. First operand 3022 states and 3940 transitions. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 03:27:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:49,298 INFO L93 Difference]: Finished difference Result 6476 states and 8466 transitions. [2024-10-14 03:27:49,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:27:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 339 [2024-10-14 03:27:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:49,312 INFO L225 Difference]: With dead ends: 6476 [2024-10-14 03:27:49,313 INFO L226 Difference]: Without dead ends: 3953 [2024-10-14 03:27:49,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:27:49,320 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 211 mSDsluCounter, 1434 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:49,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1718 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:27:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2024-10-14 03:27:49,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 2639. [2024-10-14 03:27:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2213 states have (on average 1.271577044735653) internal successors, (2814), 2231 states have internal predecessors, (2814), 288 states have call successors, (288), 137 states have call predecessors, (288), 137 states have return successors, (288), 270 states have call predecessors, (288), 288 states have call successors, (288) [2024-10-14 03:27:49,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3390 transitions. [2024-10-14 03:27:49,619 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3390 transitions. Word has length 339 [2024-10-14 03:27:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:49,619 INFO L471 AbstractCegarLoop]: Abstraction has 2639 states and 3390 transitions. [2024-10-14 03:27:49,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 7 states have internal predecessors, (107), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-14 03:27:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3390 transitions. [2024-10-14 03:27:49,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-14 03:27:49,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:49,626 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:49,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 03:27:49,626 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:49,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash 158160815, now seen corresponding path program 1 times [2024-10-14 03:27:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:49,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598098730] [2024-10-14 03:27:49,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 03:27:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-14 03:27:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 03:27:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-14 03:27:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 03:27:50,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-10-14 03:27:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-10-14 03:27:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-10-14 03:27:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-14 03:27:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-10-14 03:27:50,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:50,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598098730] [2024-10-14 03:27:50,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598098730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:50,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:50,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:27:50,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616286703] [2024-10-14 03:27:50,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:50,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 03:27:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 03:27:50,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 03:27:50,451 INFO L87 Difference]: Start difference. First operand 2639 states and 3390 transitions. Second operand has 9 states, 9 states have (on average 12.0) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 03:27:51,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:51,295 INFO L93 Difference]: Finished difference Result 5465 states and 7040 transitions. [2024-10-14 03:27:51,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:27:51,295 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 340 [2024-10-14 03:27:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:51,314 INFO L225 Difference]: With dead ends: 5465 [2024-10-14 03:27:51,314 INFO L226 Difference]: Without dead ends: 3325 [2024-10-14 03:27:51,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:27:51,322 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 134 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:51,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1184 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:27:51,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3325 states. [2024-10-14 03:27:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3325 to 3013. [2024-10-14 03:27:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 2493 states have (on average 1.2659446450060168) internal successors, (3156), 2519 states have internal predecessors, (3156), 334 states have call successors, (334), 165 states have call predecessors, (334), 185 states have return successors, (360), 328 states have call predecessors, (360), 334 states have call successors, (360) [2024-10-14 03:27:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3850 transitions. [2024-10-14 03:27:51,762 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3850 transitions. Word has length 340 [2024-10-14 03:27:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 3850 transitions. [2024-10-14 03:27:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.0) internal successors, (108), 6 states have internal predecessors, (108), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 03:27:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3850 transitions. [2024-10-14 03:27:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2024-10-14 03:27:51,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:51,771 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:51,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:27:51,772 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:51,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash -38352690, now seen corresponding path program 1 times [2024-10-14 03:27:51,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:51,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807427628] [2024-10-14 03:27:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:51,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:51,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:52,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 03:27:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-14 03:27:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 03:27:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-14 03:27:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 03:27:52,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-10-14 03:27:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-10-14 03:27:52,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-10-14 03:27:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-14 03:27:52,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2024-10-14 03:27:52,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:52,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807427628] [2024-10-14 03:27:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807427628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:27:52,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:27:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:27:52,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876569112] [2024-10-14 03:27:52,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:27:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:27:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:52,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:27:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:27:52,081 INFO L87 Difference]: Start difference. First operand 3013 states and 3850 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 03:27:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:27:52,693 INFO L93 Difference]: Finished difference Result 6072 states and 7748 transitions. [2024-10-14 03:27:52,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:27:52,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 340 [2024-10-14 03:27:52,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:27:52,705 INFO L225 Difference]: With dead ends: 6072 [2024-10-14 03:27:52,705 INFO L226 Difference]: Without dead ends: 2933 [2024-10-14 03:27:52,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:27:52,712 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:27:52,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 606 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:27:52,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2024-10-14 03:27:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2933. [2024-10-14 03:27:53,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2433 states have (on average 1.2359227291409782) internal successors, (3007), 2459 states have internal predecessors, (3007), 334 states have call successors, (334), 165 states have call predecessors, (334), 165 states have return successors, (334), 308 states have call predecessors, (334), 334 states have call successors, (334) [2024-10-14 03:27:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 3675 transitions. [2024-10-14 03:27:53,105 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 3675 transitions. Word has length 340 [2024-10-14 03:27:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:27:53,106 INFO L471 AbstractCegarLoop]: Abstraction has 2933 states and 3675 transitions. [2024-10-14 03:27:53,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-10-14 03:27:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3675 transitions. [2024-10-14 03:27:53,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-14 03:27:53,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:27:53,114 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:27:53,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 03:27:53,114 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:27:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:27:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash 3395188, now seen corresponding path program 1 times [2024-10-14 03:27:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:27:53,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771181542] [2024-10-14 03:27:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:27:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:27:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-14 03:27:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 03:27:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 03:27:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 03:27:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 03:27:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 03:27:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:27:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 03:27:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-14 03:27:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 03:27:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 03:27:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 03:27:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 03:27:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 03:27:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 03:27:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 03:27:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-14 03:27:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-10-14 03:27:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-10-14 03:27:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-10-14 03:27:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-10-14 03:27:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-14 03:27:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-10-14 03:27:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 03:27:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2024-10-14 03:27:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2024-10-14 03:27:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2024-10-14 03:27:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2024-10-14 03:27:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2024-10-14 03:27:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-10-14 03:27:53,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:27:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771181542] [2024-10-14 03:27:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771181542] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:27:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491168563] [2024-10-14 03:27:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:27:53,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:27:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:27:53,739 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:27:53,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 03:27:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:27:54,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 1292 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 03:27:54,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:27:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 274 proven. 62 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2024-10-14 03:27:54,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:27:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-10-14 03:27:55,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491168563] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:27:55,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:27:55,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 28 [2024-10-14 03:27:55,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590196826] [2024-10-14 03:27:55,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:27:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 03:27:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:27:55,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 03:27:55,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:27:55,272 INFO L87 Difference]: Start difference. First operand 2933 states and 3675 transitions. Second operand has 28 states, 27 states have (on average 11.407407407407407) internal successors, (308), 26 states have internal predecessors, (308), 15 states have call successors, (62), 8 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) [2024-10-14 03:28:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:28:16,544 INFO L93 Difference]: Finished difference Result 42127 states and 56542 transitions. [2024-10-14 03:28:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 462 states. [2024-10-14 03:28:16,544 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 11.407407407407407) internal successors, (308), 26 states have internal predecessors, (308), 15 states have call successors, (62), 8 states have call predecessors, (62), 6 states have return successors, (60), 14 states have call predecessors, (60), 14 states have call successors, (60) Word has length 350 [2024-10-14 03:28:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:28:16,681 INFO L225 Difference]: With dead ends: 42127 [2024-10-14 03:28:16,682 INFO L226 Difference]: Without dead ends: 39729 [2024-10-14 03:28:16,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1346 GetRequests, 864 SyntacticMatches, 0 SemanticMatches, 482 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106988 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18986, Invalid=214786, Unknown=0, NotChecked=0, Total=233772 [2024-10-14 03:28:16,737 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 4675 mSDsluCounter, 9873 mSDsCounter, 0 mSdLazyCounter, 9308 mSolverCounterSat, 1080 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4675 SdHoareTripleChecker+Valid, 10659 SdHoareTripleChecker+Invalid, 10388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1080 IncrementalHoareTripleChecker+Valid, 9308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:28:16,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4675 Valid, 10659 Invalid, 10388 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1080 Valid, 9308 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-14 03:28:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39729 states.