./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_ActiveStandby.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.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 b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:58:20,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:58:20,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:58:20,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:58:20,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:58:20,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:58:20,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:58:20,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:58:20,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:58:20,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:58:20,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:58:20,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:58:20,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:58:20,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:58:20,265 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:58:20,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:58:20,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:58:20,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:58:20,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:58:20,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:58:20,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:58:20,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:58:20,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:58:20,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:58:20,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:58:20,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:58:20,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:58:20,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:58:20,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:58:20,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:58:20,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:58:20,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:58:20,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:58:20,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:58:20,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:58:20,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:58:20,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:58:20,272 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:58:20,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:58:20,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:58:20,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:58:20,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:58:20,273 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 -> b1fa78b32466948213cdbfc05d3adcde2ac2fc14323ec3ac2f4b441976452676 [2024-10-12 19:58:20,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:58:20,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:58:20,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:58:20,572 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:58:20,573 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:58:20,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-10-12 19:58:22,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:58:22,264 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:58:22,265 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-10-12 19:58:22,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf386477/a03cd332968f494fa9ae543e72760ac9/FLAG8d5857d41 [2024-10-12 19:58:22,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf386477/a03cd332968f494fa9ae543e72760ac9 [2024-10-12 19:58:22,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:58:22,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:58:22,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:58:22,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:58:22,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:58:22,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d31867c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22, skipping insertion in model container [2024-10-12 19:58:22,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:58:22,650 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_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2024-10-12 19:58:22,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:58:22,672 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:58:22,734 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_ActiveStandby.5.ufo.BOUNDED-10.pals.c[14595,14608] [2024-10-12 19:58:22,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:58:22,756 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:58:22,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22 WrapperNode [2024-10-12 19:58:22,757 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:58:22,758 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:58:22,758 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:58:22,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:58:22,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,817 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 511 [2024-10-12 19:58:22,818 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:58:22,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:58:22,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:58:22,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:58:22,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,882 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:58:22,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,909 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:58:22,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:58:22,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:58:22,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:58:22,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (1/1) ... [2024-10-12 19:58:22,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:58:22,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:22,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:58:22,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:58:23,019 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-10-12 19:58:23,019 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-10-12 19:58:23,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:58:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-10-12 19:58:23,021 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-10-12 19:58:23,021 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-10-12 19:58:23,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-10-12 19:58:23,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 19:58:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 19:58:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:58:23,023 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-10-12 19:58:23,023 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-10-12 19:58:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:58:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:58:23,024 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-10-12 19:58:23,024 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-10-12 19:58:23,152 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:58:23,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:58:23,855 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-10-12 19:58:23,855 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:58:23,907 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:58:23,908 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:58:23,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:23 BoogieIcfgContainer [2024-10-12 19:58:23,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:58:23,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:58:23,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:58:23,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:58:23,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:58:22" (1/3) ... [2024-10-12 19:58:23,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6703c1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:58:23, skipping insertion in model container [2024-10-12 19:58:23,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:58:22" (2/3) ... [2024-10-12 19:58:23,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6703c1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:58:23, skipping insertion in model container [2024-10-12 19:58:23,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:58:23" (3/3) ... [2024-10-12 19:58:23,916 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.BOUNDED-10.pals.c [2024-10-12 19:58:23,932 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:58:23,932 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:58:24,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:58:24,006 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;@7a1e65b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:58:24,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:58:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 128 states have internal predecessors, (204), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 19:58:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:58:24,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,022 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] [2024-10-12 19:58:24,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 416796339, now seen corresponding path program 1 times [2024-10-12 19:58:24,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899869883] [2024-10-12 19:58:24,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:58:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899869883] [2024-10-12 19:58:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899869883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 19:58:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537466819] [2024-10-12 19:58:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:24,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:58:24,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:24,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:58:24,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:58:24,362 INFO L87 Difference]: Start difference. First operand has 164 states, 127 states have (on average 1.6062992125984252) internal successors, (204), 128 states have internal predecessors, (204), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 19:58:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:24,423 INFO L93 Difference]: Finished difference Result 313 states and 525 transitions. [2024-10-12 19:58:24,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:58:24,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 23 [2024-10-12 19:58:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:24,436 INFO L225 Difference]: With dead ends: 313 [2024-10-12 19:58:24,437 INFO L226 Difference]: Without dead ends: 162 [2024-10-12 19:58:24,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 19:58:24,451 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:24,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-12 19:58:24,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-12 19:58:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 126 states have (on average 1.5793650793650793) internal successors, (199), 126 states have internal predecessors, (199), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 19:58:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 257 transitions. [2024-10-12 19:58:24,498 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 257 transitions. Word has length 23 [2024-10-12 19:58:24,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:24,498 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 257 transitions. [2024-10-12 19:58:24,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-12 19:58:24,499 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 257 transitions. [2024-10-12 19:58:24,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 19:58:24,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,500 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] [2024-10-12 19:58:24,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:58:24,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1577348367, now seen corresponding path program 1 times [2024-10-12 19:58:24,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532293059] [2024-10-12 19:58:24,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-12 19:58:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:24,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532293059] [2024-10-12 19:58:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532293059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:24,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:24,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:58:24,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127265664] [2024-10-12 19:58:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:58:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:58:24,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:24,772 INFO L87 Difference]: Start difference. First operand 162 states and 257 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12 19:58:24,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:24,923 INFO L93 Difference]: Finished difference Result 415 states and 665 transitions. [2024-10-12 19:58:24,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:58:24,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 23 [2024-10-12 19:58:24,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:24,927 INFO L225 Difference]: With dead ends: 415 [2024-10-12 19:58:24,929 INFO L226 Difference]: Without dead ends: 266 [2024-10-12 19:58:24,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:24,931 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 127 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:24,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1214 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-12 19:58:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 162. [2024-10-12 19:58:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 126 states have internal predecessors, (187), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 19:58:24,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 245 transitions. [2024-10-12 19:58:24,975 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 245 transitions. Word has length 23 [2024-10-12 19:58:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:24,976 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 245 transitions. [2024-10-12 19:58:24,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-12 19:58:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 245 transitions. [2024-10-12 19:58:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-12 19:58:24,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:24,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:58:24,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2120967277, now seen corresponding path program 1 times [2024-10-12 19:58:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312622944] [2024-10-12 19:58:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:24,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:58:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312622944] [2024-10-12 19:58:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312622944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120390792] [2024-10-12 19:58:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:25,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:25,262 INFO L87 Difference]: Start difference. First operand 162 states and 245 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 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-12 19:58:25,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:25,345 INFO L93 Difference]: Finished difference Result 312 states and 481 transitions. [2024-10-12 19:58:25,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:25,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 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 34 [2024-10-12 19:58:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:25,349 INFO L225 Difference]: With dead ends: 312 [2024-10-12 19:58:25,350 INFO L226 Difference]: Without dead ends: 166 [2024-10-12 19:58:25,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-12 19:58:25,353 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 3 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:25,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 692 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-12 19:58:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-12 19:58:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 129 states have internal predecessors, (190), 29 states have call successors, (29), 7 states have call predecessors, (29), 7 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-12 19:58:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 248 transitions. [2024-10-12 19:58:25,369 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 248 transitions. Word has length 34 [2024-10-12 19:58:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:25,370 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 248 transitions. [2024-10-12 19:58:25,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (3), 3 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-12 19:58:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 248 transitions. [2024-10-12 19:58:25,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-12 19:58:25,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:25,372 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:25,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:58:25,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:25,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:25,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1787555156, now seen corresponding path program 1 times [2024-10-12 19:58:25,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:25,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128276226] [2024-10-12 19:58:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:25,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:58:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:25,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128276226] [2024-10-12 19:58:25,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128276226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:25,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:25,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:25,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463050563] [2024-10-12 19:58:25,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:25,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:25,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:25,466 INFO L87 Difference]: Start difference. First operand 166 states and 248 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:25,518 INFO L93 Difference]: Finished difference Result 458 states and 695 transitions. [2024-10-12 19:58:25,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 48 [2024-10-12 19:58:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:25,521 INFO L225 Difference]: With dead ends: 458 [2024-10-12 19:58:25,521 INFO L226 Difference]: Without dead ends: 308 [2024-10-12 19:58:25,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12 19:58:25,526 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 206 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:25,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 476 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-12 19:58:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2024-10-12 19:58:25,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 232 states have (on average 1.4913793103448276) internal successors, (346), 233 states have internal predecessors, (346), 57 states have call successors, (57), 14 states have call predecessors, (57), 14 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-10-12 19:58:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 460 transitions. [2024-10-12 19:58:25,564 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 460 transitions. Word has length 48 [2024-10-12 19:58:25,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:25,565 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 460 transitions. [2024-10-12 19:58:25,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 460 transitions. [2024-10-12 19:58:25,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:58:25,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:25,570 INFO L215 NwaCegarLoop]: trace histogram [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-12 19:58:25,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:58:25,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:25,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1878750554, now seen corresponding path program 1 times [2024-10-12 19:58:25,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:25,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745460894] [2024-10-12 19:58:25,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:25,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:58:25,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:25,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745460894] [2024-10-12 19:58:25,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745460894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:25,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:25,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:25,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716288366] [2024-10-12 19:58:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:25,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:25,696 INFO L87 Difference]: Start difference. First operand 304 states and 460 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:25,762 INFO L93 Difference]: Finished difference Result 860 states and 1310 transitions. [2024-10-12 19:58:25,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:25,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-12 19:58:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:25,771 INFO L225 Difference]: With dead ends: 860 [2024-10-12 19:58:25,772 INFO L226 Difference]: Without dead ends: 572 [2024-10-12 19:58:25,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-12 19:58:25,775 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 202 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 491 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-12 19:58:25,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 491 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-12 19:58:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 559. [2024-10-12 19:58:25,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 417 states have (on average 1.4916067146282974) internal successors, (622), 420 states have internal predecessors, (622), 113 states have call successors, (113), 28 states have call predecessors, (113), 28 states have return successors, (113), 110 states have call predecessors, (113), 113 states have call successors, (113) [2024-10-12 19:58:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 848 transitions. [2024-10-12 19:58:25,827 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 848 transitions. Word has length 49 [2024-10-12 19:58:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:25,829 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 848 transitions. [2024-10-12 19:58:25,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 848 transitions. [2024-10-12 19:58:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:58:25,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:25,831 INFO L215 NwaCegarLoop]: trace histogram [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-12 19:58:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:58:25,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:25,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 598886876, now seen corresponding path program 1 times [2024-10-12 19:58:25,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:25,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051902782] [2024-10-12 19:58:25,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:58:25,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051902782] [2024-10-12 19:58:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051902782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253105862] [2024-10-12 19:58:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:25,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:25,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:25,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:25,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:25,998 INFO L87 Difference]: Start difference. First operand 559 states and 848 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,171 INFO L93 Difference]: Finished difference Result 1180 states and 1795 transitions. [2024-10-12 19:58:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:26,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2024-10-12 19:58:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,190 INFO L225 Difference]: With dead ends: 1180 [2024-10-12 19:58:26,190 INFO L226 Difference]: Without dead ends: 637 [2024-10-12 19:58:26,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:26,192 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 329 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 621 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-12 19:58:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 629. [2024-10-12 19:58:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 479 states have (on average 1.4822546972860124) internal successors, (710), 482 states have internal predecessors, (710), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 944 transitions. [2024-10-12 19:58:26,247 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 944 transitions. Word has length 49 [2024-10-12 19:58:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 944 transitions. [2024-10-12 19:58:26,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 944 transitions. [2024-10-12 19:58:26,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:58:26,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:26,251 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:26,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:58:26,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:26,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:26,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1052158445, now seen corresponding path program 1 times [2024-10-12 19:58:26,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:26,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598921537] [2024-10-12 19:58:26,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:26,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:58:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:26,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598921537] [2024-10-12 19:58:26,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598921537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:26,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:26,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:58:26,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761762109] [2024-10-12 19:58:26,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:26,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:58:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:26,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:58:26,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:58:26,392 INFO L87 Difference]: Start difference. First operand 629 states and 944 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,562 INFO L93 Difference]: Finished difference Result 1184 states and 1795 transitions. [2024-10-12 19:58:26,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:26,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 50 [2024-10-12 19:58:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,567 INFO L225 Difference]: With dead ends: 1184 [2024-10-12 19:58:26,567 INFO L226 Difference]: Without dead ends: 641 [2024-10-12 19:58:26,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:26,569 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 329 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 621 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-10-12 19:58:26,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 637. [2024-10-12 19:58:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 487 states have (on average 1.4743326488706365) internal successors, (718), 490 states have internal predecessors, (718), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 952 transitions. [2024-10-12 19:58:26,611 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 952 transitions. Word has length 50 [2024-10-12 19:58:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:26,611 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 952 transitions. [2024-10-12 19:58:26,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 952 transitions. [2024-10-12 19:58:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-12 19:58:26,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:26,613 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:26,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:58:26,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:26,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -130272225, now seen corresponding path program 1 times [2024-10-12 19:58:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916580564] [2024-10-12 19:58:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:58:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:26,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:26,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916580564] [2024-10-12 19:58:26,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916580564] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:26,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:26,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698622416] [2024-10-12 19:58:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:26,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:26,735 INFO L87 Difference]: Start difference. First operand 637 states and 952 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:26,895 INFO L93 Difference]: Finished difference Result 1180 states and 1783 transitions. [2024-10-12 19:58:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:26,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2024-10-12 19:58:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:26,900 INFO L225 Difference]: With dead ends: 1180 [2024-10-12 19:58:26,900 INFO L226 Difference]: Without dead ends: 637 [2024-10-12 19:58:26,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-12 19:58:26,903 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 49 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:26,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 620 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:26,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-10-12 19:58:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2024-10-12 19:58:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 487 states have (on average 1.4661190965092403) internal successors, (714), 490 states have internal predecessors, (714), 117 states have call successors, (117), 32 states have call predecessors, (117), 32 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:26,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 948 transitions. [2024-10-12 19:58:26,942 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 948 transitions. Word has length 52 [2024-10-12 19:58:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 948 transitions. [2024-10-12 19:58:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 19:58:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 948 transitions. [2024-10-12 19:58:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-12 19:58:26,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:26,944 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:26,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:58:26,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:26,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash -682908374, now seen corresponding path program 1 times [2024-10-12 19:58:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:26,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605837960] [2024-10-12 19:58:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:26,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605837960] [2024-10-12 19:58:27,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605837960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156993944] [2024-10-12 19:58:27,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:27,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:27,185 INFO L87 Difference]: Start difference. First operand 637 states and 948 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:58:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:27,265 INFO L93 Difference]: Finished difference Result 1200 states and 1807 transitions. [2024-10-12 19:58:27,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-10-12 19:58:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:27,271 INFO L225 Difference]: With dead ends: 1200 [2024-10-12 19:58:27,271 INFO L226 Difference]: Without dead ends: 657 [2024-10-12 19:58:27,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-12 19:58:27,274 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 4 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:27,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 704 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-12 19:58:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2024-10-12 19:58:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 503 states have (on average 1.4512922465208749) internal successors, (730), 506 states have internal predecessors, (730), 117 states have call successors, (117), 36 states have call predecessors, (117), 36 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 964 transitions. [2024-10-12 19:58:27,312 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 964 transitions. Word has length 53 [2024-10-12 19:58:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:27,313 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 964 transitions. [2024-10-12 19:58:27,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-12 19:58:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 964 transitions. [2024-10-12 19:58:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 19:58:27,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:27,315 INFO L215 NwaCegarLoop]: trace histogram [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-12 19:58:27,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:58:27,315 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:27,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1527575408, now seen corresponding path program 1 times [2024-10-12 19:58:27,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:27,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806706755] [2024-10-12 19:58:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:27,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806706755] [2024-10-12 19:58:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806706755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:27,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:27,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:27,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197002405] [2024-10-12 19:58:27,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:27,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:27,499 INFO L87 Difference]: Start difference. First operand 657 states and 964 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:58:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:27,588 INFO L93 Difference]: Finished difference Result 1240 states and 1851 transitions. [2024-10-12 19:58:27,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:27,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 61 [2024-10-12 19:58:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:27,594 INFO L225 Difference]: With dead ends: 1240 [2024-10-12 19:58:27,594 INFO L226 Difference]: Without dead ends: 677 [2024-10-12 19:58:27,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-12 19:58:27,597 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:27,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 690 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:27,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-10-12 19:58:27,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2024-10-12 19:58:27,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 519 states have (on average 1.4373795761078998) internal successors, (746), 522 states have internal predecessors, (746), 117 states have call successors, (117), 40 states have call predecessors, (117), 40 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:27,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 980 transitions. [2024-10-12 19:58:27,640 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 980 transitions. Word has length 61 [2024-10-12 19:58:27,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:27,641 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 980 transitions. [2024-10-12 19:58:27,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:58:27,641 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 980 transitions. [2024-10-12 19:58:27,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:58:27,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:27,643 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:27,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:58:27,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:27,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1184701862, now seen corresponding path program 1 times [2024-10-12 19:58:27,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:27,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216346524] [2024-10-12 19:58:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:27,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:27,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:27,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216346524] [2024-10-12 19:58:27,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216346524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:27,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:27,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:27,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758376851] [2024-10-12 19:58:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:27,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:27,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:27,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:27,831 INFO L87 Difference]: Start difference. First operand 677 states and 980 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 19:58:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:27,911 INFO L93 Difference]: Finished difference Result 1276 states and 1867 transitions. [2024-10-12 19:58:27,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:27,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-12 19:58:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:27,917 INFO L225 Difference]: With dead ends: 1276 [2024-10-12 19:58:27,917 INFO L226 Difference]: Without dead ends: 693 [2024-10-12 19:58:27,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-12 19:58:27,920 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:27,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 700 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2024-10-12 19:58:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2024-10-12 19:58:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 531 states have (on average 1.4274952919020716) internal successors, (758), 534 states have internal predecessors, (758), 117 states have call successors, (117), 44 states have call predecessors, (117), 44 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:27,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 992 transitions. [2024-10-12 19:58:27,960 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 992 transitions. Word has length 69 [2024-10-12 19:58:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:27,961 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 992 transitions. [2024-10-12 19:58:27,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 19:58:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 992 transitions. [2024-10-12 19:58:27,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-12 19:58:27,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:27,962 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:27,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:58:27,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:27,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:27,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1211757441, now seen corresponding path program 1 times [2024-10-12 19:58:27,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:27,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781431805] [2024-10-12 19:58:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:27,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:58:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781431805] [2024-10-12 19:58:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781431805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:28,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542250426] [2024-10-12 19:58:28,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:28,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:28,141 INFO L87 Difference]: Start difference. First operand 693 states and 992 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 19:58:28,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:28,244 INFO L93 Difference]: Finished difference Result 1312 states and 1907 transitions. [2024-10-12 19:58:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:28,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 69 [2024-10-12 19:58:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:28,250 INFO L225 Difference]: With dead ends: 1312 [2024-10-12 19:58:28,250 INFO L226 Difference]: Without dead ends: 713 [2024-10-12 19:58:28,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-12 19:58:28,253 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 4 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:28,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 690 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-12 19:58:28,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-10-12 19:58:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 547 states have (on average 1.4149908592321756) internal successors, (774), 550 states have internal predecessors, (774), 117 states have call successors, (117), 48 states have call predecessors, (117), 48 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1008 transitions. [2024-10-12 19:58:28,315 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1008 transitions. Word has length 69 [2024-10-12 19:58:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:28,316 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1008 transitions. [2024-10-12 19:58:28,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-12 19:58:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1008 transitions. [2024-10-12 19:58:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 19:58:28,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:28,318 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:58:28,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:58:28,319 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1107298427, now seen corresponding path program 1 times [2024-10-12 19:58:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:28,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125950923] [2024-10-12 19:58:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:28,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:28,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125950923] [2024-10-12 19:58:28,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125950923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:28,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:28,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:28,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143117628] [2024-10-12 19:58:28,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:28,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:28,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:28,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:28,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:28,536 INFO L87 Difference]: Start difference. First operand 713 states and 1008 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:58:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:28,619 INFO L93 Difference]: Finished difference Result 1356 states and 1935 transitions. [2024-10-12 19:58:28,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:28,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 77 [2024-10-12 19:58:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:28,625 INFO L225 Difference]: With dead ends: 1356 [2024-10-12 19:58:28,625 INFO L226 Difference]: Without dead ends: 737 [2024-10-12 19:58:28,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-12 19:58:28,628 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 5 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:28,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 702 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2024-10-12 19:58:28,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2024-10-12 19:58:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 567 states have (on average 1.400352733686067) internal successors, (794), 570 states have internal predecessors, (794), 117 states have call successors, (117), 52 states have call predecessors, (117), 52 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-10-12 19:58:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1028 transitions. [2024-10-12 19:58:28,668 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1028 transitions. Word has length 77 [2024-10-12 19:58:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:28,668 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1028 transitions. [2024-10-12 19:58:28,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-12 19:58:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1028 transitions. [2024-10-12 19:58:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:58:28,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:28,670 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-12 19:58:28,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:58:28,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1484136390, now seen corresponding path program 1 times [2024-10-12 19:58:28,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:28,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003019826] [2024-10-12 19:58:28,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:58:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:29,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003019826] [2024-10-12 19:58:29,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003019826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:29,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710972512] [2024-10-12 19:58:29,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:29,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:29,234 INFO L87 Difference]: Start difference. First operand 737 states and 1028 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:58:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:29,539 INFO L93 Difference]: Finished difference Result 1938 states and 2686 transitions. [2024-10-12 19:58:29,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:29,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 80 [2024-10-12 19:58:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:29,547 INFO L225 Difference]: With dead ends: 1938 [2024-10-12 19:58:29,547 INFO L226 Difference]: Without dead ends: 1295 [2024-10-12 19:58:29,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:58:29,549 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 185 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:29,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1360 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-12 19:58:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 882. [2024-10-12 19:58:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 675 states have (on average 1.3911111111111112) internal successors, (939), 679 states have internal predecessors, (939), 141 states have call successors, (141), 65 states have call predecessors, (141), 65 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-12 19:58:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1221 transitions. [2024-10-12 19:58:29,613 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1221 transitions. Word has length 80 [2024-10-12 19:58:29,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:29,613 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1221 transitions. [2024-10-12 19:58:29,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:58:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1221 transitions. [2024-10-12 19:58:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:58:29,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:29,615 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:29,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:58:29,615 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:29,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:29,615 INFO L85 PathProgramCache]: Analyzing trace with hash -861295851, now seen corresponding path program 1 times [2024-10-12 19:58:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:29,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925711617] [2024-10-12 19:58:29,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:29,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:58:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:58:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925711617] [2024-10-12 19:58:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925711617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028307050] [2024-10-12 19:58:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:29,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:29,785 INFO L87 Difference]: Start difference. First operand 882 states and 1221 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:58:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:29,891 INFO L93 Difference]: Finished difference Result 1653 states and 2307 transitions. [2024-10-12 19:58:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:29,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2024-10-12 19:58:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:29,898 INFO L225 Difference]: With dead ends: 1653 [2024-10-12 19:58:29,899 INFO L226 Difference]: Without dead ends: 902 [2024-10-12 19:58:29,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-12 19:58:29,903 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 3 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:29,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 700 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-12 19:58:29,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-10-12 19:58:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 690 states have (on average 1.382608695652174) internal successors, (954), 694 states have internal predecessors, (954), 141 states have call successors, (141), 70 states have call predecessors, (141), 70 states have return successors, (141), 137 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-12 19:58:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1236 transitions. [2024-10-12 19:58:29,996 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1236 transitions. Word has length 84 [2024-10-12 19:58:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:29,996 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1236 transitions. [2024-10-12 19:58:29,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:58:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1236 transitions. [2024-10-12 19:58:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:58:29,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:29,998 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-12 19:58:29,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:58:29,998 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:29,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:29,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1191143078, now seen corresponding path program 1 times [2024-10-12 19:58:29,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:29,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604401456] [2024-10-12 19:58:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:29,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:58:30,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:30,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604401456] [2024-10-12 19:58:30,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604401456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:58:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686787855] [2024-10-12 19:58:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:30,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:58:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:58:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:58:30,282 INFO L87 Difference]: Start difference. First operand 902 states and 1236 transitions. Second operand has 6 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:58:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:30,452 INFO L93 Difference]: Finished difference Result 1299 states and 1882 transitions. [2024-10-12 19:58:30,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:58:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 83 [2024-10-12 19:58:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:30,460 INFO L225 Difference]: With dead ends: 1299 [2024-10-12 19:58:30,460 INFO L226 Difference]: Without dead ends: 1297 [2024-10-12 19:58:30,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:30,462 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 130 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:30,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1881 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2024-10-12 19:58:30,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 904. [2024-10-12 19:58:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 690 states have (on average 1.382608695652174) internal successors, (954), 695 states have internal predecessors, (954), 142 states have call successors, (142), 71 states have call predecessors, (142), 71 states have return successors, (142), 137 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-12 19:58:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1238 transitions. [2024-10-12 19:58:30,564 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1238 transitions. Word has length 83 [2024-10-12 19:58:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:30,565 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1238 transitions. [2024-10-12 19:58:30,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:58:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1238 transitions. [2024-10-12 19:58:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-12 19:58:30,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:30,567 INFO L215 NwaCegarLoop]: trace histogram [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-12 19:58:30,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:58:30,568 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:30,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash 358448366, now seen corresponding path program 1 times [2024-10-12 19:58:30,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:30,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690708919] [2024-10-12 19:58:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:30,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 19:58:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690708919] [2024-10-12 19:58:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690708919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17218593] [2024-10-12 19:58:30,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:30,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:30,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:30,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:30,752 INFO L87 Difference]: Start difference. First operand 904 states and 1238 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:58:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:30,969 INFO L93 Difference]: Finished difference Result 1690 states and 2331 transitions. [2024-10-12 19:58:30,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2024-10-12 19:58:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:30,976 INFO L225 Difference]: With dead ends: 1690 [2024-10-12 19:58:30,976 INFO L226 Difference]: Without dead ends: 958 [2024-10-12 19:58:30,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:58:30,979 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 226 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:30,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1377 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:30,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2024-10-12 19:58:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 916. [2024-10-12 19:58:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 707 states have (on average 1.3804809052333804) internal successors, (976), 716 states have internal predecessors, (976), 136 states have call successors, (136), 72 states have call predecessors, (136), 72 states have return successors, (136), 127 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-12 19:58:31,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1248 transitions. [2024-10-12 19:58:31,043 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1248 transitions. Word has length 86 [2024-10-12 19:58:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:31,043 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1248 transitions. [2024-10-12 19:58:31,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:58:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1248 transitions. [2024-10-12 19:58:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-12 19:58:31,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:31,045 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-12 19:58:31,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:58:31,045 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1587701740, now seen corresponding path program 1 times [2024-10-12 19:58:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462030042] [2024-10-12 19:58:31,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:58:31,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:31,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462030042] [2024-10-12 19:58:31,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462030042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:31,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688653081] [2024-10-12 19:58:31,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:31,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:31,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:31,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:31,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:31,487 INFO L87 Difference]: Start difference. First operand 916 states and 1248 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:58:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:31,703 INFO L93 Difference]: Finished difference Result 1669 states and 2286 transitions. [2024-10-12 19:58:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:31,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 88 [2024-10-12 19:58:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:31,709 INFO L225 Difference]: With dead ends: 1669 [2024-10-12 19:58:31,710 INFO L226 Difference]: Without dead ends: 915 [2024-10-12 19:58:31,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:58:31,712 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 128 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:31,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1437 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-10-12 19:58:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 905. [2024-10-12 19:58:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 699 states have (on average 1.3791130185979972) internal successors, (964), 708 states have internal predecessors, (964), 134 states have call successors, (134), 71 states have call predecessors, (134), 71 states have return successors, (134), 125 states have call predecessors, (134), 134 states have call successors, (134) [2024-10-12 19:58:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1232 transitions. [2024-10-12 19:58:31,776 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1232 transitions. Word has length 88 [2024-10-12 19:58:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:31,776 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1232 transitions. [2024-10-12 19:58:31,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:58:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1232 transitions. [2024-10-12 19:58:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-12 19:58:31,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:31,778 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:31,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:58:31,778 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:31,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1454977024, now seen corresponding path program 1 times [2024-10-12 19:58:31,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:31,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668295310] [2024-10-12 19:58:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:31,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:58:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:58:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:58:32,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:32,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668295310] [2024-10-12 19:58:32,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668295310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:32,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:58:32,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562904348] [2024-10-12 19:58:32,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:32,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:58:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:58:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:58:32,232 INFO L87 Difference]: Start difference. First operand 905 states and 1232 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 19:58:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:32,691 INFO L93 Difference]: Finished difference Result 1734 states and 2344 transitions. [2024-10-12 19:58:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:32,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 89 [2024-10-12 19:58:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:32,697 INFO L225 Difference]: With dead ends: 1734 [2024-10-12 19:58:32,697 INFO L226 Difference]: Without dead ends: 960 [2024-10-12 19:58:32,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:58:32,700 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 520 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:32,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1133 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-10-12 19:58:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 921. [2024-10-12 19:58:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 707 states have (on average 1.3536067892503536) internal successors, (957), 717 states have internal predecessors, (957), 137 states have call successors, (137), 76 states have call predecessors, (137), 76 states have return successors, (137), 127 states have call predecessors, (137), 137 states have call successors, (137) [2024-10-12 19:58:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1231 transitions. [2024-10-12 19:58:32,776 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1231 transitions. Word has length 89 [2024-10-12 19:58:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:32,776 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1231 transitions. [2024-10-12 19:58:32,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-10-12 19:58:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1231 transitions. [2024-10-12 19:58:32,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-12 19:58:32,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:32,778 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:32,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:58:32,779 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:32,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:32,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2130270663, now seen corresponding path program 1 times [2024-10-12 19:58:32,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:32,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595130034] [2024-10-12 19:58:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:32,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:32,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595130034] [2024-10-12 19:58:32,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595130034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:32,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871629427] [2024-10-12 19:58:32,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:32,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:32,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:32,888 INFO L87 Difference]: Start difference. First operand 921 states and 1231 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:33,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:33,076 INFO L93 Difference]: Finished difference Result 2454 states and 3293 transitions. [2024-10-12 19:58:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:33,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 90 [2024-10-12 19:58:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:33,087 INFO L225 Difference]: With dead ends: 2454 [2024-10-12 19:58:33,087 INFO L226 Difference]: Without dead ends: 1715 [2024-10-12 19:58:33,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-12 19:58:33,091 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 189 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:33,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1054 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2024-10-12 19:58:33,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1488. [2024-10-12 19:58:33,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1131 states have (on average 1.3448275862068966) internal successors, (1521), 1147 states have internal predecessors, (1521), 231 states have call successors, (231), 125 states have call predecessors, (231), 125 states have return successors, (231), 215 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-12 19:58:33,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1983 transitions. [2024-10-12 19:58:33,275 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1983 transitions. Word has length 90 [2024-10-12 19:58:33,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:33,275 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1983 transitions. [2024-10-12 19:58:33,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1983 transitions. [2024-10-12 19:58:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 19:58:33,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:33,278 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:33,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:58:33,278 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:33,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2050336594, now seen corresponding path program 1 times [2024-10-12 19:58:33,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:33,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170141772] [2024-10-12 19:58:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:33,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:58:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:58:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:58:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:58:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:58:33,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170141772] [2024-10-12 19:58:33,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170141772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:33,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:33,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:33,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368536110] [2024-10-12 19:58:33,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:33,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:33,766 INFO L87 Difference]: Start difference. First operand 1488 states and 1983 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:34,378 INFO L93 Difference]: Finished difference Result 3054 states and 4059 transitions. [2024-10-12 19:58:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:58:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2024-10-12 19:58:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:34,388 INFO L225 Difference]: With dead ends: 3054 [2024-10-12 19:58:34,389 INFO L226 Difference]: Without dead ends: 1820 [2024-10-12 19:58:34,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:58:34,393 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 465 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:34,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 1245 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:58:34,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2024-10-12 19:58:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1515. [2024-10-12 19:58:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1145 states have (on average 1.337117903930131) internal successors, (1531), 1162 states have internal predecessors, (1531), 239 states have call successors, (239), 130 states have call predecessors, (239), 130 states have return successors, (239), 222 states have call predecessors, (239), 239 states have call successors, (239) [2024-10-12 19:58:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2009 transitions. [2024-10-12 19:58:34,542 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2009 transitions. Word has length 92 [2024-10-12 19:58:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:34,542 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2009 transitions. [2024-10-12 19:58:34,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:34,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2009 transitions. [2024-10-12 19:58:34,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:58:34,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:34,544 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:34,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:58:34,545 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:34,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1554073978, now seen corresponding path program 1 times [2024-10-12 19:58:34,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:34,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761368871] [2024-10-12 19:58:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:34,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761368871] [2024-10-12 19:58:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761368871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:34,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:34,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674350667] [2024-10-12 19:58:34,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:34,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:34,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:34,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:34,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:34,651 INFO L87 Difference]: Start difference. First operand 1515 states and 2009 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:34,972 INFO L93 Difference]: Finished difference Result 3793 states and 5057 transitions. [2024-10-12 19:58:34,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:34,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-12 19:58:34,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:34,987 INFO L225 Difference]: With dead ends: 3793 [2024-10-12 19:58:34,987 INFO L226 Difference]: Without dead ends: 2575 [2024-10-12 19:58:34,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-12 19:58:34,994 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 194 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:34,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1092 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:34,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2024-10-12 19:58:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2394. [2024-10-12 19:58:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2394 states, 1787 states have (on average 1.3240067151650812) internal successors, (2366), 1814 states have internal predecessors, (2366), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2024-10-12 19:58:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3154 transitions. [2024-10-12 19:58:35,239 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3154 transitions. Word has length 94 [2024-10-12 19:58:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:35,240 INFO L471 AbstractCegarLoop]: Abstraction has 2394 states and 3154 transitions. [2024-10-12 19:58:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3154 transitions. [2024-10-12 19:58:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:58:35,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:35,243 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:35,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 19:58:35,243 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1814016471, now seen corresponding path program 1 times [2024-10-12 19:58:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:35,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178631896] [2024-10-12 19:58:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:58:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:58:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:58:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:58:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:58:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:35,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:35,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178631896] [2024-10-12 19:58:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178631896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:35,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:35,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153109998] [2024-10-12 19:58:35,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:35,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:35,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:35,317 INFO L87 Difference]: Start difference. First operand 2394 states and 3154 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:35,593 INFO L93 Difference]: Finished difference Result 4605 states and 6088 transitions. [2024-10-12 19:58:35,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-12 19:58:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:35,610 INFO L225 Difference]: With dead ends: 4605 [2024-10-12 19:58:35,611 INFO L226 Difference]: Without dead ends: 2403 [2024-10-12 19:58:35,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12 19:58:35,619 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 3 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:35,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2403 states. [2024-10-12 19:58:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2403 to 2397. [2024-10-12 19:58:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2397 states, 1790 states have (on average 1.323463687150838) internal successors, (2369), 1817 states have internal predecessors, (2369), 394 states have call successors, (394), 212 states have call predecessors, (394), 212 states have return successors, (394), 367 states have call predecessors, (394), 394 states have call successors, (394) [2024-10-12 19:58:35,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3157 transitions. [2024-10-12 19:58:35,877 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3157 transitions. Word has length 94 [2024-10-12 19:58:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:35,878 INFO L471 AbstractCegarLoop]: Abstraction has 2397 states and 3157 transitions. [2024-10-12 19:58:35,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3157 transitions. [2024-10-12 19:58:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-12 19:58:35,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:35,880 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:35,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 19:58:35,880 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:35,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1948537536, now seen corresponding path program 1 times [2024-10-12 19:58:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:35,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169550254] [2024-10-12 19:58:35,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:58:36,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:58:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:58:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:58:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:58:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:58:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:36,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:36,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169550254] [2024-10-12 19:58:36,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169550254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:36,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:36,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:36,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650810447] [2024-10-12 19:58:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:36,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:36,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:36,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:36,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:36,027 INFO L87 Difference]: Start difference. First operand 2397 states and 3157 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:36,499 INFO L93 Difference]: Finished difference Result 5712 states and 7554 transitions. [2024-10-12 19:58:36,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:58:36,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 94 [2024-10-12 19:58:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:36,525 INFO L225 Difference]: With dead ends: 5712 [2024-10-12 19:58:36,525 INFO L226 Difference]: Without dead ends: 3729 [2024-10-12 19:58:36,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-12 19:58:36,536 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 188 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:36,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1106 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2024-10-12 19:58:36,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3302. [2024-10-12 19:58:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3302 states, 2456 states have (on average 1.3188110749185669) internal successors, (3239), 2493 states have internal predecessors, (3239), 551 states have call successors, (551), 294 states have call predecessors, (551), 294 states have return successors, (551), 514 states have call predecessors, (551), 551 states have call successors, (551) [2024-10-12 19:58:36,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3302 states to 3302 states and 4341 transitions. [2024-10-12 19:58:36,911 INFO L78 Accepts]: Start accepts. Automaton has 3302 states and 4341 transitions. Word has length 94 [2024-10-12 19:58:36,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:36,912 INFO L471 AbstractCegarLoop]: Abstraction has 3302 states and 4341 transitions. [2024-10-12 19:58:36,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 3302 states and 4341 transitions. [2024-10-12 19:58:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-12 19:58:36,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:36,915 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:36,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 19:58:36,916 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:36,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:36,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1698817225, now seen corresponding path program 1 times [2024-10-12 19:58:36,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:36,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036475398] [2024-10-12 19:58:36,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:36,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:58:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:58:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036475398] [2024-10-12 19:58:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036475398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:37,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:37,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150025575] [2024-10-12 19:58:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:37,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:37,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:37,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:37,063 INFO L87 Difference]: Start difference. First operand 3302 states and 4341 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:37,367 INFO L93 Difference]: Finished difference Result 6278 states and 8272 transitions. [2024-10-12 19:58:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2024-10-12 19:58:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:37,394 INFO L225 Difference]: With dead ends: 6278 [2024-10-12 19:58:37,395 INFO L226 Difference]: Without dead ends: 3038 [2024-10-12 19:58:37,405 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-12 19:58:37,406 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 69 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:37,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 693 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2024-10-12 19:58:37,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2939. [2024-10-12 19:58:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2170 states have (on average 1.3225806451612903) internal successors, (2870), 2194 states have internal predecessors, (2870), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2024-10-12 19:58:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3874 transitions. [2024-10-12 19:58:37,742 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3874 transitions. Word has length 95 [2024-10-12 19:58:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 2939 states and 3874 transitions. [2024-10-12 19:58:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3874 transitions. [2024-10-12 19:58:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 19:58:37,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:37,745 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:37,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 19:58:37,745 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash -655751939, now seen corresponding path program 1 times [2024-10-12 19:58:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631220302] [2024-10-12 19:58:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:37,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:37,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:58:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:58:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:37,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:37,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631220302] [2024-10-12 19:58:37,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631220302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:37,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:37,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:58:37,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552871890] [2024-10-12 19:58:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:37,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:58:37,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:37,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:58:37,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:58:37,814 INFO L87 Difference]: Start difference. First operand 2939 states and 3874 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:38,102 INFO L93 Difference]: Finished difference Result 5737 states and 7591 transitions. [2024-10-12 19:58:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:58:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-12 19:58:38,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:38,157 INFO L225 Difference]: With dead ends: 5737 [2024-10-12 19:58:38,158 INFO L226 Difference]: Without dead ends: 2967 [2024-10-12 19:58:38,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-12 19:58:38,165 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 4 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:38,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2024-10-12 19:58:38,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2946. [2024-10-12 19:58:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2946 states, 2177 states have (on average 1.3215434083601285) internal successors, (2877), 2201 states have internal predecessors, (2877), 502 states have call successors, (502), 266 states have call predecessors, (502), 266 states have return successors, (502), 478 states have call predecessors, (502), 502 states have call successors, (502) [2024-10-12 19:58:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 3881 transitions. [2024-10-12 19:58:38,444 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 3881 transitions. Word has length 97 [2024-10-12 19:58:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:38,444 INFO L471 AbstractCegarLoop]: Abstraction has 2946 states and 3881 transitions. [2024-10-12 19:58:38,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 3881 transitions. [2024-10-12 19:58:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-12 19:58:38,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:38,446 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:38,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 19:58:38,447 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:38,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:38,447 INFO L85 PathProgramCache]: Analyzing trace with hash 365285769, now seen corresponding path program 1 times [2024-10-12 19:58:38,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965597592] [2024-10-12 19:58:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:38,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:58:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:58:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:58:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:58:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:58:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:58:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:58:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:38,582 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:58:38,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965597592] [2024-10-12 19:58:38,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965597592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:38,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:38,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 19:58:38,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133886851] [2024-10-12 19:58:38,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:38,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 19:58:38,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:38,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 19:58:38,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 19:58:38,585 INFO L87 Difference]: Start difference. First operand 2946 states and 3881 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:38,887 INFO L93 Difference]: Finished difference Result 5700 states and 7530 transitions. [2024-10-12 19:58:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 19:58:38,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97 [2024-10-12 19:58:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:38,916 INFO L225 Difference]: With dead ends: 5700 [2024-10-12 19:58:38,916 INFO L226 Difference]: Without dead ends: 2863 [2024-10-12 19:58:38,926 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-12 19:58:38,926 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 56 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:38,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 686 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:58:38,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2024-10-12 19:58:39,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2708. [2024-10-12 19:58:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 1998 states have (on average 1.3208208208208208) internal successors, (2639), 2017 states have internal predecessors, (2639), 464 states have call successors, (464), 245 states have call predecessors, (464), 245 states have return successors, (464), 445 states have call predecessors, (464), 464 states have call successors, (464) [2024-10-12 19:58:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 3567 transitions. [2024-10-12 19:58:39,267 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 3567 transitions. Word has length 97 [2024-10-12 19:58:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:39,268 INFO L471 AbstractCegarLoop]: Abstraction has 2708 states and 3567 transitions. [2024-10-12 19:58:39,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-12 19:58:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 3567 transitions. [2024-10-12 19:58:39,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-12 19:58:39,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:39,274 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:39,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 19:58:39,274 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:39,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 290510463, now seen corresponding path program 1 times [2024-10-12 19:58:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:39,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862494197] [2024-10-12 19:58:39,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:39,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-12 19:58:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:58:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:58:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:58:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:58:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:58:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:58:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:58:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:58:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:58:39,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:58:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 19:58:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 19:58:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862494197] [2024-10-12 19:58:39,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862494197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:39,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747552068] [2024-10-12 19:58:39,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:39,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:39,686 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-12 19:58:39,688 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-12 19:58:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:39,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-12 19:58:39,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 27 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:40,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:58:40,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747552068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:40,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:40,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 22 [2024-10-12 19:58:40,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294883168] [2024-10-12 19:58:40,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:40,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 19:58:40,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 19:58:40,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:58:40,592 INFO L87 Difference]: Start difference. First operand 2708 states and 3567 transitions. Second operand has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:58:45,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:45,195 INFO L93 Difference]: Finished difference Result 11204 states and 14683 transitions. [2024-10-12 19:58:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-12 19:58:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) Word has length 141 [2024-10-12 19:58:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:45,244 INFO L225 Difference]: With dead ends: 11204 [2024-10-12 19:58:45,245 INFO L226 Difference]: Without dead ends: 8707 [2024-10-12 19:58:45,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1844 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1180, Invalid=5300, Unknown=0, NotChecked=0, Total=6480 [2024-10-12 19:58:45,259 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 5164 mSDsluCounter, 2949 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 1937 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5164 SdHoareTripleChecker+Valid, 3273 SdHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1937 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:45,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5164 Valid, 3273 Invalid, 3447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1937 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 19:58:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8707 states. [2024-10-12 19:58:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8707 to 7259. [2024-10-12 19:58:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7259 states, 5342 states have (on average 1.30887308124298) internal successors, (6992), 5394 states have internal predecessors, (6992), 1239 states have call successors, (1239), 677 states have call predecessors, (1239), 677 states have return successors, (1239), 1187 states have call predecessors, (1239), 1239 states have call successors, (1239) [2024-10-12 19:58:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 9470 transitions. [2024-10-12 19:58:46,040 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 9470 transitions. Word has length 141 [2024-10-12 19:58:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:46,041 INFO L471 AbstractCegarLoop]: Abstraction has 7259 states and 9470 transitions. [2024-10-12 19:58:46,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 20 states have internal predecessors, (224), 9 states have call successors, (41), 4 states have call predecessors, (41), 7 states have return successors, (40), 11 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:58:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 9470 transitions. [2024-10-12 19:58:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 19:58:46,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:46,053 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:46,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:58:46,256 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,SelfDestructingSolverStorable27 [2024-10-12 19:58:46,257 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:46,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:46,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1827178492, now seen corresponding path program 1 times [2024-10-12 19:58:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137743794] [2024-10-12 19:58:46,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:47,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:58:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:58:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:58:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:58:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:58:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 19:58:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-12 19:58:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:47,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137743794] [2024-10-12 19:58:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137743794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:47,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765352569] [2024-10-12 19:58:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:47,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:47,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:47,132 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-12 19:58:47,133 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-12 19:58:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:47,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-12 19:58:47,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 48 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:47,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-12 19:58:47,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765352569] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:47,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:58:47,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 11] total 25 [2024-10-12 19:58:47,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766944223] [2024-10-12 19:58:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:47,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:58:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:47,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:58:47,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-10-12 19:58:47,951 INFO L87 Difference]: Start difference. First operand 7259 states and 9470 transitions. Second operand has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:58:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:48,865 INFO L93 Difference]: Finished difference Result 14113 states and 18457 transitions. [2024-10-12 19:58:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:58:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 144 [2024-10-12 19:58:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:48,898 INFO L225 Difference]: With dead ends: 14113 [2024-10-12 19:58:48,898 INFO L226 Difference]: Without dead ends: 7326 [2024-10-12 19:58:48,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:58:48,918 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 252 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:48,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1380 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:58:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7326 states. [2024-10-12 19:58:49,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7326 to 5851. [2024-10-12 19:58:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5851 states, 4328 states have (on average 1.3128465804066543) internal successors, (5682), 4366 states have internal predecessors, (5682), 981 states have call successors, (981), 541 states have call predecessors, (981), 541 states have return successors, (981), 943 states have call predecessors, (981), 981 states have call successors, (981) [2024-10-12 19:58:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5851 states to 5851 states and 7644 transitions. [2024-10-12 19:58:49,513 INFO L78 Accepts]: Start accepts. Automaton has 5851 states and 7644 transitions. Word has length 144 [2024-10-12 19:58:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:49,515 INFO L471 AbstractCegarLoop]: Abstraction has 5851 states and 7644 transitions. [2024-10-12 19:58:49,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-12 19:58:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5851 states and 7644 transitions. [2024-10-12 19:58:49,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 19:58:49,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:49,527 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:49,546 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-12 19:58:49,728 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,SelfDestructingSolverStorable28 [2024-10-12 19:58:49,729 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:49,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash 125444847, now seen corresponding path program 1 times [2024-10-12 19:58:49,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:49,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243635325] [2024-10-12 19:58:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-12 19:58:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:58:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:58:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:58:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:58:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:58:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:58:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:58:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:58:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:58:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:58:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 19:58:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:58:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:50,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243635325] [2024-10-12 19:58:50,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243635325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:50,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098908673] [2024-10-12 19:58:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:50,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:50,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:50,462 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-12 19:58:50,463 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-12 19:58:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:50,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-12 19:58:50,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:50,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:58:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098908673] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:51,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 24 [2024-10-12 19:58:51,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880508307] [2024-10-12 19:58:51,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:51,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-12 19:58:51,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:51,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-12 19:58:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-10-12 19:58:51,291 INFO L87 Difference]: Start difference. First operand 5851 states and 7644 transitions. Second operand has 24 states, 24 states have (on average 10.083333333333334) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-12 19:58:54,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:54,350 INFO L93 Difference]: Finished difference Result 15562 states and 20339 transitions. [2024-10-12 19:58:54,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-12 19:58:54,351 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.083333333333334) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) Word has length 145 [2024-10-12 19:58:54,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:54,393 INFO L225 Difference]: With dead ends: 15562 [2024-10-12 19:58:54,394 INFO L226 Difference]: Without dead ends: 9917 [2024-10-12 19:58:54,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=692, Invalid=3340, Unknown=0, NotChecked=0, Total=4032 [2024-10-12 19:58:54,410 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 1598 mSDsluCounter, 4573 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 5084 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:54,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 5084 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 19:58:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9917 states. [2024-10-12 19:58:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9917 to 6037. [2024-10-12 19:58:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6037 states, 4466 states have (on average 1.30653828929691) internal successors, (5835), 4507 states have internal predecessors, (5835), 1011 states have call successors, (1011), 559 states have call predecessors, (1011), 559 states have return successors, (1011), 970 states have call predecessors, (1011), 1011 states have call successors, (1011) [2024-10-12 19:58:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6037 states to 6037 states and 7857 transitions. [2024-10-12 19:58:55,130 INFO L78 Accepts]: Start accepts. Automaton has 6037 states and 7857 transitions. Word has length 145 [2024-10-12 19:58:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:55,130 INFO L471 AbstractCegarLoop]: Abstraction has 6037 states and 7857 transitions. [2024-10-12 19:58:55,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.083333333333334) internal successors, (242), 20 states have internal predecessors, (242), 7 states have call successors, (40), 5 states have call predecessors, (40), 10 states have return successors, (39), 11 states have call predecessors, (39), 7 states have call successors, (39) [2024-10-12 19:58:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 6037 states and 7857 transitions. [2024-10-12 19:58:55,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-12 19:58:55,140 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:55,141 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:55,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:58:55,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:55,346 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1304878967, now seen corresponding path program 1 times [2024-10-12 19:58:55,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:55,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607743607] [2024-10-12 19:58:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:58:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:58:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:58:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:58:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:58:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:58:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:58:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:58:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 19:58:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:58:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-12 19:58:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-12 19:58:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:55,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607743607] [2024-10-12 19:58:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607743607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:58:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:58:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:58:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213371658] [2024-10-12 19:58:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:58:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:58:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:55,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:58:55,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:58:55,618 INFO L87 Difference]: Start difference. First operand 6037 states and 7857 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:58:56,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:58:56,672 INFO L93 Difference]: Finished difference Result 17723 states and 23129 transitions. [2024-10-12 19:58:56,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:58:56,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2024-10-12 19:58:56,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:58:56,726 INFO L225 Difference]: With dead ends: 17723 [2024-10-12 19:58:56,726 INFO L226 Difference]: Without dead ends: 11993 [2024-10-12 19:58:56,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:58:56,741 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 212 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:58:56,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 2011 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:58:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11993 states. [2024-10-12 19:58:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11993 to 7588. [2024-10-12 19:58:57,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7588 states, 5581 states have (on average 1.3047840888729618) internal successors, (7282), 5633 states have internal predecessors, (7282), 1304 states have call successors, (1304), 702 states have call predecessors, (1304), 702 states have return successors, (1304), 1252 states have call predecessors, (1304), 1304 states have call successors, (1304) [2024-10-12 19:58:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 9890 transitions. [2024-10-12 19:58:57,549 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 9890 transitions. Word has length 153 [2024-10-12 19:58:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:58:57,549 INFO L471 AbstractCegarLoop]: Abstraction has 7588 states and 9890 transitions. [2024-10-12 19:58:57,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:58:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 9890 transitions. [2024-10-12 19:58:57,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 19:58:57,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:58:57,559 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:58:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-12 19:58:57,559 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:58:57,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:58:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1232073042, now seen corresponding path program 1 times [2024-10-12 19:58:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:58:57,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085296277] [2024-10-12 19:58:57,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:57,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:58:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:58:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:58:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:58:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:58:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:58:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:58:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:58:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:58:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:58:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:58:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:58:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:58:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:58:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 19:58:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-12 19:58:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:57,978 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:58:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:58:57,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085296277] [2024-10-12 19:58:57,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085296277] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:58:57,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958164389] [2024-10-12 19:58:57,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:58:57,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:58:57,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:58:57,981 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-12 19:58:57,982 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-12 19:58:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:58:58,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 19:58:58,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:58:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 57 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:58:58,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:58:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:58:58,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958164389] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:58:58,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:58:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2024-10-12 19:58:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197313619] [2024-10-12 19:58:58,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:58:58,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-12 19:58:58,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:58:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-12 19:58:58,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:58:58,969 INFO L87 Difference]: Start difference. First operand 7588 states and 9890 transitions. Second operand has 22 states, 22 states have (on average 11.0) internal successors, (242), 22 states have internal predecessors, (242), 9 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:59:04,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:04,571 INFO L93 Difference]: Finished difference Result 21926 states and 28747 transitions. [2024-10-12 19:59:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2024-10-12 19:59:04,572 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 11.0) internal successors, (242), 22 states have internal predecessors, (242), 9 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) Word has length 155 [2024-10-12 19:59:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:04,638 INFO L225 Difference]: With dead ends: 21926 [2024-10-12 19:59:04,638 INFO L226 Difference]: Without dead ends: 14633 [2024-10-12 19:59:04,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8751 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2870, Invalid=19780, Unknown=0, NotChecked=0, Total=22650 [2024-10-12 19:59:04,665 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 2748 mSDsluCounter, 3530 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2748 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:04,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2748 Valid, 3942 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:59:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14633 states. [2024-10-12 19:59:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14633 to 12716. [2024-10-12 19:59:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12716 states, 9440 states have (on average 1.2976694915254237) internal successors, (12250), 9525 states have internal predecessors, (12250), 2106 states have call successors, (2106), 1169 states have call predecessors, (2106), 1169 states have return successors, (2106), 2021 states have call predecessors, (2106), 2106 states have call successors, (2106) [2024-10-12 19:59:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12716 states to 12716 states and 16462 transitions. [2024-10-12 19:59:05,968 INFO L78 Accepts]: Start accepts. Automaton has 12716 states and 16462 transitions. Word has length 155 [2024-10-12 19:59:05,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:59:05,969 INFO L471 AbstractCegarLoop]: Abstraction has 12716 states and 16462 transitions. [2024-10-12 19:59:05,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.0) internal successors, (242), 22 states have internal predecessors, (242), 9 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 9 states have call predecessors, (40), 9 states have call successors, (40) [2024-10-12 19:59:05,969 INFO L276 IsEmpty]: Start isEmpty. Operand 12716 states and 16462 transitions. [2024-10-12 19:59:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-12 19:59:05,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:59:05,984 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:59:06,002 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-12 19:59:06,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:06,190 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:59:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:59:06,191 INFO L85 PathProgramCache]: Analyzing trace with hash 271123625, now seen corresponding path program 1 times [2024-10-12 19:59:06,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:59:06,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401214952] [2024-10-12 19:59:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:59:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:59:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:59:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:59:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:59:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:59:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:59:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:59:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:59:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:59:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:59:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:59:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:59:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:59:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-12 19:59:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-12 19:59:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-12 19:59:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:59:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401214952] [2024-10-12 19:59:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401214952] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:59:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225530852] [2024-10-12 19:59:06,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:59:06,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:59:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:59:06,835 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-12 19:59:06,836 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-12 19:59:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:59:07,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-10-12 19:59:07,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:59:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 70 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:59:07,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:59:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-10-12 19:59:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225530852] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:59:09,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:59:09,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 19] total 36 [2024-10-12 19:59:09,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310702865] [2024-10-12 19:59:09,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:59:09,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-12 19:59:09,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:59:09,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-12 19:59:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1084, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 19:59:09,205 INFO L87 Difference]: Start difference. First operand 12716 states and 16462 transitions. Second operand has 36 states, 36 states have (on average 6.666666666666667) internal successors, (240), 35 states have internal predecessors, (240), 11 states have call successors, (45), 5 states have call predecessors, (45), 7 states have return successors, (44), 12 states have call predecessors, (44), 11 states have call successors, (44) [2024-10-12 19:59:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:59:31,855 INFO L93 Difference]: Finished difference Result 44728 states and 60515 transitions. [2024-10-12 19:59:31,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2024-10-12 19:59:31,856 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.666666666666667) internal successors, (240), 35 states have internal predecessors, (240), 11 states have call successors, (45), 5 states have call predecessors, (45), 7 states have return successors, (44), 12 states have call predecessors, (44), 11 states have call successors, (44) Word has length 155 [2024-10-12 19:59:31,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:59:32,009 INFO L225 Difference]: With dead ends: 44728 [2024-10-12 19:59:32,009 INFO L226 Difference]: Without dead ends: 32381 [2024-10-12 19:59:32,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27065 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=9280, Invalid=56512, Unknown=0, NotChecked=0, Total=65792 [2024-10-12 19:59:32,054 INFO L432 NwaCegarLoop]: 1022 mSDtfsCounter, 3513 mSDsluCounter, 11925 mSDsCounter, 0 mSdLazyCounter, 7567 mSolverCounterSat, 1042 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3513 SdHoareTripleChecker+Valid, 12947 SdHoareTripleChecker+Invalid, 8609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1042 IncrementalHoareTripleChecker+Valid, 7567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:59:32,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3513 Valid, 12947 Invalid, 8609 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1042 Valid, 7567 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-12 19:59:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32381 states.