./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.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 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:11:28,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:11:29,063 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:11:29,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:11:29,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:11:29,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:11:29,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:11:29,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:11:29,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:11:29,102 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:11:29,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:11:29,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:11:29,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:11:29,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:11:29,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:11:29,105 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:11:29,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:11:29,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:11:29,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:11:29,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:11:29,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:11:29,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:11:29,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:11:29,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:11:29,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:11:29,113 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:11:29,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:11:29,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:11:29,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:11:29,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:11:29,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:11:29,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:11:29,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:11:29,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:11:29,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:11:29,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:11:29,116 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:11:29,116 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:11:29,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:11:29,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:11:29,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:11:29,118 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:11:29,119 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 -> 0a05a45e59c4449e0f919ee265abbb6a4949f64a9be713d749d79d0baffd63df [2024-11-11 21:11:29,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:11:29,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:11:29,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:11:29,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:11:29,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:11:29,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2024-11-11 21:11:30,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:11:31,125 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:11:31,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2024-11-11 21:11:31,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c5f1886/48299a43458b41a4855f56a9ff0bb74e/FLAGc057d9421 [2024-11-11 21:11:31,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c5f1886/48299a43458b41a4855f56a9ff0bb74e [2024-11-11 21:11:31,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:11:31,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:11:31,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:11:31,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:11:31,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:11:31,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:31,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a795c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31, skipping insertion in model container [2024-11-11 21:11:31,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:31,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:11:31,786 WARN L250 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.UNBOUNDED.pals.c[14577,14590] [2024-11-11 21:11:31,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:11:31,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:11:31,879 WARN L250 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.UNBOUNDED.pals.c[14577,14590] [2024-11-11 21:11:31,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:11:31,898 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:11:31,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31 WrapperNode [2024-11-11 21:11:31,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:11:31,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:11:31,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:11:31,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:11:31,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:31,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:31,965 INFO L138 Inliner]: procedures = 32, calls = 47, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 508 [2024-11-11 21:11:31,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:11:31,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:11:31,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:11:31,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:11:31,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:31,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:31,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,028 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-11-11 21:11:32,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,062 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:11:32,063 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:11:32,063 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:11:32,063 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:11:32,065 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (1/1) ... [2024-11-11 21:11:32,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:11:32,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:32,113 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-11-11 21:11:32,116 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-11-11 21:11:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-11 21:11:32,166 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-11 21:11:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:11:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-11 21:11:32,167 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-11 21:11:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-11 21:11:32,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-11 21:11:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 21:11:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 21:11:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:11:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-11 21:11:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-11 21:11:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:11:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:11:32,170 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-11 21:11:32,170 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-11 21:11:32,293 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:11:32,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:11:32,926 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-11 21:11:32,926 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:11:32,956 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:11:32,956 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:11:32,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:11:32 BoogieIcfgContainer [2024-11-11 21:11:32,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:11:32,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:11:32,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:11:32,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:11:32,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:11:31" (1/3) ... [2024-11-11 21:11:32,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a3c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:11:32, skipping insertion in model container [2024-11-11 21:11:32,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:31" (2/3) ... [2024-11-11 21:11:32,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a3c79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:11:32, skipping insertion in model container [2024-11-11 21:11:32,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:11:32" (3/3) ... [2024-11-11 21:11:32,966 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.5.ufo.UNBOUNDED.pals.c [2024-11-11 21:11:32,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:11:32,980 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:11:33,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:11:33,045 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;@202b0574, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:11:33,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:11:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 173 states, 136 states have (on average 1.5661764705882353) internal successors, (213), 138 states have internal predecessors, (213), 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-11-11 21:11:33,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:11:33,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:33,058 INFO L218 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] [2024-11-11 21:11:33,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:33,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:33,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1815111432, now seen corresponding path program 1 times [2024-11-11 21:11:33,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:33,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561205552] [2024-11-11 21:11:33,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:33,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:11:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:33,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561205552] [2024-11-11 21:11:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561205552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:33,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:33,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:11:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498091992] [2024-11-11 21:11:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:33,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:11:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:33,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:11:33,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:11:33,393 INFO L87 Difference]: Start difference. First operand has 173 states, 136 states have (on average 1.5661764705882353) internal successors, (213), 138 states have internal predecessors, (213), 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 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-11 21:11:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:33,432 INFO L93 Difference]: Finished difference Result 326 states and 539 transitions. [2024-11-11 21:11:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:11:33,434 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 28 [2024-11-11 21:11:33,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:33,442 INFO L225 Difference]: With dead ends: 326 [2024-11-11 21:11:33,442 INFO L226 Difference]: Without dead ends: 169 [2024-11-11 21:11:33,447 INFO L434 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-11-11 21:11:33,450 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:33,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-11 21:11:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-11 21:11:33,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 134 states have internal predecessors, (206), 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-11-11 21:11:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2024-11-11 21:11:33,496 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 28 [2024-11-11 21:11:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:33,496 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2024-11-11 21:11:33,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-11-11 21:11:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2024-11-11 21:11:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:11:33,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:33,499 INFO L218 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] [2024-11-11 21:11:33,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:11:33,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:33,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:33,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1596256714, now seen corresponding path program 1 times [2024-11-11 21:11:33,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:33,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766863351] [2024-11-11 21:11:33,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:33,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:11:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:33,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:33,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766863351] [2024-11-11 21:11:33,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766863351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:33,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:33,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:11:33,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037306453] [2024-11-11 21:11:33,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:33,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:11:33,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:33,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:11:33,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:11:33,778 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-11 21:11:33,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:33,893 INFO L93 Difference]: Finished difference Result 324 states and 502 transitions. [2024-11-11 21:11:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:11:33,917 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 28 [2024-11-11 21:11:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:33,920 INFO L225 Difference]: With dead ends: 324 [2024-11-11 21:11:33,921 INFO L226 Difference]: Without dead ends: 169 [2024-11-11 21:11:33,922 INFO L434 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-11-11 21:11:33,925 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:33,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1278 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-11 21:11:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2024-11-11 21:11:33,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 133 states have (on average 1.4586466165413534) internal successors, (194), 134 states have internal predecessors, (194), 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-11-11 21:11:33,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 252 transitions. [2024-11-11 21:11:33,946 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 252 transitions. Word has length 28 [2024-11-11 21:11:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:33,946 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 252 transitions. [2024-11-11 21:11:33,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-11-11 21:11:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 252 transitions. [2024-11-11 21:11:33,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 21:11:33,948 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:33,948 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:33,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:11:33,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:33,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:33,950 INFO L85 PathProgramCache]: Analyzing trace with hash 187133938, now seen corresponding path program 1 times [2024-11-11 21:11:33,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:33,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568388591] [2024-11-11 21:11:33,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:33,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:11:34,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:34,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568388591] [2024-11-11 21:11:34,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568388591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:34,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:34,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675789165] [2024-11-11 21:11:34,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:34,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:34,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:34,256 INFO L87 Difference]: Start difference. First operand 169 states and 252 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-11-11 21:11:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:34,321 INFO L93 Difference]: Finished difference Result 325 states and 494 transitions. [2024-11-11 21:11:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:34,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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 39 [2024-11-11 21:11:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:34,323 INFO L225 Difference]: With dead ends: 325 [2024-11-11 21:11:34,323 INFO L226 Difference]: Without dead ends: 173 [2024-11-11 21:11:34,324 INFO L434 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-11-11 21:11:34,325 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 3 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:34,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 728 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-11 21:11:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2024-11-11 21:11:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 136 states have (on average 1.4485294117647058) internal successors, (197), 137 states have internal predecessors, (197), 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-11-11 21:11:34,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2024-11-11 21:11:34,344 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 39 [2024-11-11 21:11:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:34,345 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2024-11-11 21:11:34,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 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-11-11 21:11:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2024-11-11 21:11:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:11:34,348 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:34,348 INFO L218 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] [2024-11-11 21:11:34,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:11:34,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:34,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1556220768, now seen corresponding path program 1 times [2024-11-11 21:11:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:34,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285810052] [2024-11-11 21:11:34,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:34,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 21:11:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:34,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:34,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285810052] [2024-11-11 21:11:34,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285810052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:34,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:34,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:34,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163474984] [2024-11-11 21:11:34,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:34,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:34,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:34,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:34,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:34,461 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-11 21:11:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:34,507 INFO L93 Difference]: Finished difference Result 476 states and 713 transitions. [2024-11-11 21:11:34,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:34,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 55 [2024-11-11 21:11:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:34,512 INFO L225 Difference]: With dead ends: 476 [2024-11-11 21:11:34,512 INFO L226 Difference]: Without dead ends: 320 [2024-11-11 21:11:34,513 INFO L434 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-11-11 21:11:34,514 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 208 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:34,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 500 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:34,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-11 21:11:34,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 315. [2024-11-11 21:11:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 243 states have (on average 1.4691358024691359) internal successors, (357), 245 states have internal predecessors, (357), 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-11-11 21:11:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 471 transitions. [2024-11-11 21:11:34,558 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 471 transitions. Word has length 55 [2024-11-11 21:11:34,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:34,561 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 471 transitions. [2024-11-11 21:11:34,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-11 21:11:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 471 transitions. [2024-11-11 21:11:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:11:34,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:34,565 INFO L218 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] [2024-11-11 21:11:34,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:11:34,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:34,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:34,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1976715472, now seen corresponding path program 1 times [2024-11-11 21:11:34,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:34,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338886951] [2024-11-11 21:11:34,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:11:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:34,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:34,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338886951] [2024-11-11 21:11:34,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338886951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:34,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:34,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794863396] [2024-11-11 21:11:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:34,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:34,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:34,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:34,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:34,687 INFO L87 Difference]: Start difference. First operand 315 states and 471 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-11 21:11:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:34,746 INFO L93 Difference]: Finished difference Result 887 states and 1337 transitions. [2024-11-11 21:11:34,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:34,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 56 [2024-11-11 21:11:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:34,754 INFO L225 Difference]: With dead ends: 887 [2024-11-11 21:11:34,754 INFO L226 Difference]: Without dead ends: 589 [2024-11-11 21:11:34,757 INFO L434 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-11-11 21:11:34,760 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 204 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:34,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 517 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-11-11 21:11:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 574. [2024-11-11 21:11:34,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 432 states have (on average 1.474537037037037) internal successors, (637), 436 states have internal predecessors, (637), 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-11-11 21:11:34,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 863 transitions. [2024-11-11 21:11:34,803 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 863 transitions. Word has length 56 [2024-11-11 21:11:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:34,804 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 863 transitions. [2024-11-11 21:11:34,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11-11 21:11:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 863 transitions. [2024-11-11 21:11:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:11:34,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:34,809 INFO L218 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] [2024-11-11 21:11:34,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:11:34,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:34,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:34,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1038388146, now seen corresponding path program 1 times [2024-11-11 21:11:34,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:34,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183117563] [2024-11-11 21:11:34,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:34,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:11:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183117563] [2024-11-11 21:11:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183117563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:34,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:11:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885570402] [2024-11-11 21:11:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:34,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:11:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:11:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:11:34,982 INFO L87 Difference]: Start difference. First operand 574 states and 863 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11-11 21:11:35,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:35,164 INFO L93 Difference]: Finished difference Result 1224 states and 1839 transitions. [2024-11-11 21:11:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:35,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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 56 [2024-11-11 21:11:35,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:35,174 INFO L225 Difference]: With dead ends: 1224 [2024-11-11 21:11:35,174 INFO L226 Difference]: Without dead ends: 667 [2024-11-11 21:11:35,176 INFO L434 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-11-11 21:11:35,177 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 349 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:35,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 642 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:35,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-11 21:11:35,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 651. [2024-11-11 21:11:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 501 states have (on average 1.4610778443113772) internal successors, (732), 504 states have internal predecessors, (732), 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-11-11 21:11:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 966 transitions. [2024-11-11 21:11:35,239 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 966 transitions. Word has length 56 [2024-11-11 21:11:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:35,239 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 966 transitions. [2024-11-11 21:11:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 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-11-11 21:11:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 966 transitions. [2024-11-11 21:11:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:11:35,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:35,244 INFO L218 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] [2024-11-11 21:11:35,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:11:35,245 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:35,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1231779263, now seen corresponding path program 1 times [2024-11-11 21:11:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072880409] [2024-11-11 21:11:35,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:35,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:11:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072880409] [2024-11-11 21:11:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072880409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:35,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:11:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652414159] [2024-11-11 21:11:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:35,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:11:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:35,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:11:35,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:11:35,421 INFO L87 Difference]: Start difference. First operand 651 states and 966 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-11 21:11:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:35,600 INFO L93 Difference]: Finished difference Result 1228 states and 1839 transitions. [2024-11-11 21:11:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:35,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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 57 [2024-11-11 21:11:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:35,607 INFO L225 Difference]: With dead ends: 1228 [2024-11-11 21:11:35,608 INFO L226 Difference]: Without dead ends: 671 [2024-11-11 21:11:35,610 INFO L434 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-11-11 21:11:35,611 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 349 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:35,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 642 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:35,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2024-11-11 21:11:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 659. [2024-11-11 21:11:35,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 509 states have (on average 1.4538310412573674) internal successors, (740), 512 states have internal predecessors, (740), 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-11-11 21:11:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 974 transitions. [2024-11-11 21:11:35,661 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 974 transitions. Word has length 57 [2024-11-11 21:11:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:35,661 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 974 transitions. [2024-11-11 21:11:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 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-11-11 21:11:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 974 transitions. [2024-11-11 21:11:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-11 21:11:35,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:35,663 INFO L218 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] [2024-11-11 21:11:35,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:11:35,664 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:35,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash 496428017, now seen corresponding path program 1 times [2024-11-11 21:11:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:35,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182588009] [2024-11-11 21:11:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:11:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:35,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:35,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182588009] [2024-11-11 21:11:35,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182588009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:35,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:35,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:35,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761803972] [2024-11-11 21:11:35,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:35,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:35,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:35,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:35,862 INFO L87 Difference]: Start difference. First operand 659 states and 974 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-11-11 21:11:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:36,023 INFO L93 Difference]: Finished difference Result 1216 states and 1819 transitions. [2024-11-11 21:11:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:36,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 59 [2024-11-11 21:11:36,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:36,029 INFO L225 Difference]: With dead ends: 1216 [2024-11-11 21:11:36,031 INFO L226 Difference]: Without dead ends: 659 [2024-11-11 21:11:36,034 INFO L434 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-11-11 21:11:36,035 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 52 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:36,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 640 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-11 21:11:36,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2024-11-11 21:11:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 509 states have (on average 1.4459724950884087) internal successors, (736), 512 states have internal predecessors, (736), 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-11-11 21:11:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 970 transitions. [2024-11-11 21:11:36,073 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 970 transitions. Word has length 59 [2024-11-11 21:11:36,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:36,073 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 970 transitions. [2024-11-11 21:11:36,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-11-11 21:11:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 970 transitions. [2024-11-11 21:11:36,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-11 21:11:36,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:36,074 INFO L218 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] [2024-11-11 21:11:36,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:11:36,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:36,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:36,075 INFO L85 PathProgramCache]: Analyzing trace with hash -906823040, now seen corresponding path program 1 times [2024-11-11 21:11:36,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:36,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237647146] [2024-11-11 21:11:36,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237647146] [2024-11-11 21:11:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237647146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935564728] [2024-11-11 21:11:36,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:36,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:36,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:36,242 INFO L87 Difference]: Start difference. First operand 659 states and 970 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-11-11 21:11:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:36,300 INFO L93 Difference]: Finished difference Result 1236 states and 1843 transitions. [2024-11-11 21:11:36,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:36,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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 60 [2024-11-11 21:11:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:36,307 INFO L225 Difference]: With dead ends: 1236 [2024-11-11 21:11:36,307 INFO L226 Difference]: Without dead ends: 679 [2024-11-11 21:11:36,309 INFO L434 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-11-11 21:11:36,311 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 4 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 740 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-11-11 21:11:36,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 740 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:36,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-11-11 21:11:36,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 679. [2024-11-11 21:11:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 525 states have (on average 1.4323809523809523) internal successors, (752), 528 states have internal predecessors, (752), 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-11-11 21:11:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 986 transitions. [2024-11-11 21:11:36,381 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 986 transitions. Word has length 60 [2024-11-11 21:11:36,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:36,383 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 986 transitions. [2024-11-11 21:11:36,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 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-11-11 21:11:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 986 transitions. [2024-11-11 21:11:36,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 21:11:36,384 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:36,384 INFO L218 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] [2024-11-11 21:11:36,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:11:36,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1438142618, now seen corresponding path program 1 times [2024-11-11 21:11:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:36,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426762278] [2024-11-11 21:11:36,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:36,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:36,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426762278] [2024-11-11 21:11:36,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426762278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:36,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930761371] [2024-11-11 21:11:36,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:36,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:36,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:36,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:36,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:36,582 INFO L87 Difference]: Start difference. First operand 679 states and 986 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (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-11-11 21:11:36,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:36,661 INFO L93 Difference]: Finished difference Result 1276 states and 1887 transitions. [2024-11-11 21:11:36,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:36,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (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 68 [2024-11-11 21:11:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:36,666 INFO L225 Difference]: With dead ends: 1276 [2024-11-11 21:11:36,667 INFO L226 Difference]: Without dead ends: 699 [2024-11-11 21:11:36,669 INFO L434 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-11-11 21:11:36,670 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:36,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-11 21:11:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2024-11-11 21:11:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 541 states have (on average 1.4195933456561922) internal successors, (768), 544 states have internal predecessors, (768), 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-11-11 21:11:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1002 transitions. [2024-11-11 21:11:36,717 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1002 transitions. Word has length 68 [2024-11-11 21:11:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:36,717 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1002 transitions. [2024-11-11 21:11:36,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (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-11-11 21:11:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1002 transitions. [2024-11-11 21:11:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:11:36,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:36,719 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:36,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:11:36,720 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:36,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 288384240, now seen corresponding path program 1 times [2024-11-11 21:11:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:36,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843470373] [2024-11-11 21:11:36,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:36,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:36,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:36,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843470373] [2024-11-11 21:11:36,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843470373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:36,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:36,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:36,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007800489] [2024-11-11 21:11:36,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:36,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:36,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:36,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:36,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:36,903 INFO L87 Difference]: Start difference. First operand 699 states and 1002 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-11 21:11:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:36,968 INFO L93 Difference]: Finished difference Result 1312 states and 1903 transitions. [2024-11-11 21:11:36,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:36,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 76 [2024-11-11 21:11:36,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:36,974 INFO L225 Difference]: With dead ends: 1312 [2024-11-11 21:11:36,974 INFO L226 Difference]: Without dead ends: 715 [2024-11-11 21:11:36,977 INFO L434 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-11-11 21:11:36,978 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:36,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 736 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:36,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-11 21:11:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-11-11 21:11:37,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 553 states have (on average 1.410488245931284) internal successors, (780), 556 states have internal predecessors, (780), 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-11-11 21:11:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1014 transitions. [2024-11-11 21:11:37,023 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1014 transitions. Word has length 76 [2024-11-11 21:11:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1014 transitions. [2024-11-11 21:11:37,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-11 21:11:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1014 transitions. [2024-11-11 21:11:37,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 21:11:37,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:37,028 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:37,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:11:37,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:37,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:37,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1610123753, now seen corresponding path program 1 times [2024-11-11 21:11:37,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534768895] [2024-11-11 21:11:37,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:37,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:37,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:37,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:37,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534768895] [2024-11-11 21:11:37,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534768895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:37,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:37,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:37,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134536081] [2024-11-11 21:11:37,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:37,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:37,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:37,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:37,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:37,249 INFO L87 Difference]: Start difference. First operand 715 states and 1014 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-11 21:11:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:37,326 INFO L93 Difference]: Finished difference Result 1348 states and 1943 transitions. [2024-11-11 21:11:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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 76 [2024-11-11 21:11:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:37,331 INFO L225 Difference]: With dead ends: 1348 [2024-11-11 21:11:37,332 INFO L226 Difference]: Without dead ends: 735 [2024-11-11 21:11:37,334 INFO L434 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-11-11 21:11:37,334 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 4 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:37,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 726 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-11 21:11:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2024-11-11 21:11:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 569 states have (on average 1.398945518453427) internal successors, (796), 572 states have internal predecessors, (796), 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-11-11 21:11:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1030 transitions. [2024-11-11 21:11:37,378 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1030 transitions. Word has length 76 [2024-11-11 21:11:37,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:37,379 INFO L471 AbstractCegarLoop]: Abstraction has 735 states and 1030 transitions. [2024-11-11 21:11:37,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 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-11-11 21:11:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1030 transitions. [2024-11-11 21:11:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 21:11:37,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:37,381 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:37,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:11:37,381 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1718962299, now seen corresponding path program 1 times [2024-11-11 21:11:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412519792] [2024-11-11 21:11:37,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:11:37,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:37,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412519792] [2024-11-11 21:11:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412519792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:37,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:37,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611310543] [2024-11-11 21:11:37,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:37,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:37,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:37,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:37,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:37,638 INFO L87 Difference]: Start difference. First operand 735 states and 1030 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, (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-11-11 21:11:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:37,708 INFO L93 Difference]: Finished difference Result 1392 states and 1971 transitions. [2024-11-11 21:11:37,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:37,709 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, (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 84 [2024-11-11 21:11:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:37,714 INFO L225 Difference]: With dead ends: 1392 [2024-11-11 21:11:37,714 INFO L226 Difference]: Without dead ends: 759 [2024-11-11 21:11:37,716 INFO L434 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-11-11 21:11:37,717 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:37,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 738 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2024-11-11 21:11:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2024-11-11 21:11:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 589 states have (on average 1.3853989813242784) internal successors, (816), 592 states have internal predecessors, (816), 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-11-11 21:11:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1050 transitions. [2024-11-11 21:11:37,760 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1050 transitions. Word has length 84 [2024-11-11 21:11:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:37,761 INFO L471 AbstractCegarLoop]: Abstraction has 759 states and 1050 transitions. [2024-11-11 21:11:37,761 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, (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-11-11 21:11:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1050 transitions. [2024-11-11 21:11:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-11 21:11:37,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:37,763 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:37,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:11:37,763 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:37,764 INFO L85 PathProgramCache]: Analyzing trace with hash 966027762, now seen corresponding path program 1 times [2024-11-11 21:11:37,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:37,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760520505] [2024-11-11 21:11:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:11:38,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760520505] [2024-11-11 21:11:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760520505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073204237] [2024-11-11 21:11:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:38,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:38,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:38,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:38,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:38,367 INFO L87 Difference]: Start difference. First operand 759 states and 1050 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 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-11-11 21:11:38,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:38,706 INFO L93 Difference]: Finished difference Result 1983 states and 2731 transitions. [2024-11-11 21:11:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:38,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 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 87 [2024-11-11 21:11:38,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:38,714 INFO L225 Difference]: With dead ends: 1983 [2024-11-11 21:11:38,715 INFO L226 Difference]: Without dead ends: 1326 [2024-11-11 21:11:38,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:38,718 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 187 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:38,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1426 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:11:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2024-11-11 21:11:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 912. [2024-11-11 21:11:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 705 states have (on average 1.374468085106383) internal successors, (969), 709 states have internal predecessors, (969), 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-11-11 21:11:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1251 transitions. [2024-11-11 21:11:38,781 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1251 transitions. Word has length 87 [2024-11-11 21:11:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:38,781 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1251 transitions. [2024-11-11 21:11:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 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-11-11 21:11:38,782 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1251 transitions. [2024-11-11 21:11:38,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:11:38,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:38,783 INFO L218 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] [2024-11-11 21:11:38,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:11:38,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:38,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:38,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2026376801, now seen corresponding path program 1 times [2024-11-11 21:11:38,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:38,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557912242] [2024-11-11 21:11:38,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:38,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 21:11:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 21:11:38,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:38,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557912242] [2024-11-11 21:11:38,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557912242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:38,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:38,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:38,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614865345] [2024-11-11 21:11:38,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:38,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:38,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:38,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:38,952 INFO L87 Difference]: Start difference. First operand 912 states and 1251 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-11-11 21:11:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:39,053 INFO L93 Difference]: Finished difference Result 1697 states and 2351 transitions. [2024-11-11 21:11:39,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:39,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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 91 [2024-11-11 21:11:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:39,060 INFO L225 Difference]: With dead ends: 1697 [2024-11-11 21:11:39,061 INFO L226 Difference]: Without dead ends: 932 [2024-11-11 21:11:39,063 INFO L434 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-11-11 21:11:39,066 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 3 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:39,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 736 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:39,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-11 21:11:39,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-11-11 21:11:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 720 states have (on average 1.3666666666666667) internal successors, (984), 724 states have internal predecessors, (984), 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-11-11 21:11:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1266 transitions. [2024-11-11 21:11:39,145 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1266 transitions. Word has length 91 [2024-11-11 21:11:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:39,145 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1266 transitions. [2024-11-11 21:11:39,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 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-11-11 21:11:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1266 transitions. [2024-11-11 21:11:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 21:11:39,147 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:39,147 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:11:39,148 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1456343440, now seen corresponding path program 1 times [2024-11-11 21:11:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097730708] [2024-11-11 21:11:39,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 21:11:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097730708] [2024-11-11 21:11:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097730708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:11:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793928718] [2024-11-11 21:11:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:39,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:11:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:11:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:11:39,405 INFO L87 Difference]: Start difference. First operand 932 states and 1266 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-11-11 21:11:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:39,574 INFO L93 Difference]: Finished difference Result 1343 states and 1926 transitions. [2024-11-11 21:11:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:11:39,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 90 [2024-11-11 21:11:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:39,583 INFO L225 Difference]: With dead ends: 1343 [2024-11-11 21:11:39,583 INFO L226 Difference]: Without dead ends: 1341 [2024-11-11 21:11:39,584 INFO L434 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-11-11 21:11:39,585 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 136 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:39,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1979 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:39,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-11 21:11:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 934. [2024-11-11 21:11:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 720 states have (on average 1.3666666666666667) internal successors, (984), 725 states have internal predecessors, (984), 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-11-11 21:11:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1268 transitions. [2024-11-11 21:11:39,672 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1268 transitions. Word has length 90 [2024-11-11 21:11:39,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:39,672 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1268 transitions. [2024-11-11 21:11:39,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-11-11 21:11:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1268 transitions. [2024-11-11 21:11:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:11:39,674 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:39,674 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:39,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:11:39,675 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 914249721, now seen corresponding path program 1 times [2024-11-11 21:11:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150553850] [2024-11-11 21:11:39,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 21:11:39,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:39,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150553850] [2024-11-11 21:11:39,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150553850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:39,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944655631] [2024-11-11 21:11:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:39,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:39,847 INFO L87 Difference]: Start difference. First operand 934 states and 1268 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, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:11:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:40,019 INFO L93 Difference]: Finished difference Result 1740 states and 2381 transitions. [2024-11-11 21:11:40,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:40,019 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, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93 [2024-11-11 21:11:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:40,026 INFO L225 Difference]: With dead ends: 1740 [2024-11-11 21:11:40,026 INFO L226 Difference]: Without dead ends: 994 [2024-11-11 21:11:40,029 INFO L434 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-11-11 21:11:40,029 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 236 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:40,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1435 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-11 21:11:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 952. [2024-11-11 21:11:40,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 743 states have (on average 1.3620457604306864) internal successors, (1012), 752 states have internal predecessors, (1012), 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-11-11 21:11:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1284 transitions. [2024-11-11 21:11:40,106 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1284 transitions. Word has length 93 [2024-11-11 21:11:40,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:40,107 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1284 transitions. [2024-11-11 21:11:40,107 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, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:11:40,107 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1284 transitions. [2024-11-11 21:11:40,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:11:40,108 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:40,109 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:40,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:11:40,109 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:40,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1793206136, now seen corresponding path program 1 times [2024-11-11 21:11:40,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021828781] [2024-11-11 21:11:40,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:40,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:11:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-11 21:11:40,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:40,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021828781] [2024-11-11 21:11:40,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021828781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:40,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:40,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:40,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667998672] [2024-11-11 21:11:40,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:40,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:40,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:40,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:40,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:40,635 INFO L87 Difference]: Start difference. First operand 952 states and 1284 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 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-11-11 21:11:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:40,833 INFO L93 Difference]: Finished difference Result 1725 states and 2342 transitions. [2024-11-11 21:11:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:40,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 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 95 [2024-11-11 21:11:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:40,840 INFO L225 Difference]: With dead ends: 1725 [2024-11-11 21:11:40,841 INFO L226 Difference]: Without dead ends: 951 [2024-11-11 21:11:40,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:40,844 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 131 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:40,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1511 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2024-11-11 21:11:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 941. [2024-11-11 21:11:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 735 states have (on average 1.3605442176870748) internal successors, (1000), 744 states have internal predecessors, (1000), 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-11-11 21:11:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1268 transitions. [2024-11-11 21:11:40,909 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1268 transitions. Word has length 95 [2024-11-11 21:11:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1268 transitions. [2024-11-11 21:11:40,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 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-11-11 21:11:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1268 transitions. [2024-11-11 21:11:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 21:11:40,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:40,912 INFO L218 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] [2024-11-11 21:11:40,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:11:40,912 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:40,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1630829129, now seen corresponding path program 1 times [2024-11-11 21:11:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:40,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52713855] [2024-11-11 21:11:40,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 21:11:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 21:11:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 21:11:41,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52713855] [2024-11-11 21:11:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52713855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:41,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:41,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:41,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50957268] [2024-11-11 21:11:41,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:41,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:41,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:41,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:41,409 INFO L87 Difference]: Start difference. First operand 941 states and 1268 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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-11-11 21:11:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:41,871 INFO L93 Difference]: Finished difference Result 1792 states and 2402 transitions. [2024-11-11 21:11:41,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:11:41,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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 96 [2024-11-11 21:11:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:41,879 INFO L225 Difference]: With dead ends: 1792 [2024-11-11 21:11:41,879 INFO L226 Difference]: Without dead ends: 998 [2024-11-11 21:11:41,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:41,882 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 508 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:41,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1185 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:11:41,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-11-11 21:11:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 957. [2024-11-11 21:11:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 743 states have (on average 1.3364737550471064) internal successors, (993), 753 states have internal predecessors, (993), 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-11-11 21:11:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1267 transitions. [2024-11-11 21:11:41,997 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1267 transitions. Word has length 96 [2024-11-11 21:11:41,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:41,997 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1267 transitions. [2024-11-11 21:11:41,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 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-11-11 21:11:41,998 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1267 transitions. [2024-11-11 21:11:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:11:41,999 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:41,999 INFO L218 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-11-11 21:11:41,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:11:42,000 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:42,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1901259188, now seen corresponding path program 1 times [2024-11-11 21:11:42,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:42,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530547543] [2024-11-11 21:11:42,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:42,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:11:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:11:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:11:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:11:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:42,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530547543] [2024-11-11 21:11:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530547543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:42,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668479646] [2024-11-11 21:11:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:42,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:42,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:42,150 INFO L87 Difference]: Start difference. First operand 957 states and 1267 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-11-11 21:11:42,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:42,322 INFO L93 Difference]: Finished difference Result 2528 states and 3367 transitions. [2024-11-11 21:11:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:42,322 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), 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 97 [2024-11-11 21:11:42,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:42,334 INFO L225 Difference]: With dead ends: 2528 [2024-11-11 21:11:42,334 INFO L226 Difference]: Without dead ends: 1769 [2024-11-11 21:11:42,337 INFO L434 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-11-11 21:11:42,338 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 192 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:42,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1106 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2024-11-11 21:11:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1538. [2024-11-11 21:11:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1181 states have (on average 1.3302286198137172) internal successors, (1571), 1197 states have internal predecessors, (1571), 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-11-11 21:11:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2033 transitions. [2024-11-11 21:11:42,515 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2033 transitions. Word has length 97 [2024-11-11 21:11:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:42,515 INFO L471 AbstractCegarLoop]: Abstraction has 1538 states and 2033 transitions. [2024-11-11 21:11:42,515 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), 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-11-11 21:11:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2033 transitions. [2024-11-11 21:11:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 21:11:42,517 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:42,517 INFO L218 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, 1, 1] [2024-11-11 21:11:42,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:11:42,517 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:42,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:42,518 INFO L85 PathProgramCache]: Analyzing trace with hash -985041855, now seen corresponding path program 1 times [2024-11-11 21:11:42,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:42,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490040366] [2024-11-11 21:11:42,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:42,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:11:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:11:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:11:42,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:11:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-11 21:11:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:43,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490040366] [2024-11-11 21:11:43,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490040366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:43,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:43,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:43,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139413693] [2024-11-11 21:11:43,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:43,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:43,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:43,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:43,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:43,053 INFO L87 Difference]: Start difference. First operand 1538 states and 2033 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 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-11-11 21:11:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:43,553 INFO L93 Difference]: Finished difference Result 3136 states and 4141 transitions. [2024-11-11 21:11:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:11:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 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 99 [2024-11-11 21:11:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:43,563 INFO L225 Difference]: With dead ends: 3136 [2024-11-11 21:11:43,564 INFO L226 Difference]: Without dead ends: 1874 [2024-11-11 21:11:43,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:43,569 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 400 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:43,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1337 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:11:43,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2024-11-11 21:11:43,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1563. [2024-11-11 21:11:43,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1193 states have (on average 1.3235540653813915) internal successors, (1579), 1210 states have internal predecessors, (1579), 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-11-11 21:11:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2057 transitions. [2024-11-11 21:11:43,739 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2057 transitions. Word has length 99 [2024-11-11 21:11:43,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:43,739 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2057 transitions. [2024-11-11 21:11:43,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 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-11-11 21:11:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2057 transitions. [2024-11-11 21:11:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:11:43,741 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:43,742 INFO L218 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, 1, 1, 1, 1] [2024-11-11 21:11:43,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:11:43,743 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:43,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:43,744 INFO L85 PathProgramCache]: Analyzing trace with hash -8868659, now seen corresponding path program 1 times [2024-11-11 21:11:43,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:43,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207008492] [2024-11-11 21:11:43,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:43,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:11:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:11:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:11:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:11:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:11:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:11:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:43,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:43,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207008492] [2024-11-11 21:11:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207008492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:43,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:43,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:43,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430378418] [2024-11-11 21:11:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:43,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:43,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:43,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:43,902 INFO L87 Difference]: Start difference. First operand 1563 states and 2057 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-11 21:11:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:44,176 INFO L93 Difference]: Finished difference Result 3897 states and 5161 transitions. [2024-11-11 21:11:44,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:44,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 101 [2024-11-11 21:11:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:44,193 INFO L225 Difference]: With dead ends: 3897 [2024-11-11 21:11:44,193 INFO L226 Difference]: Without dead ends: 2651 [2024-11-11 21:11:44,198 INFO L434 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-11-11 21:11:44,200 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 198 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:44,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1144 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:44,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2651 states. [2024-11-11 21:11:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2651 to 2452. [2024-11-11 21:11:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1845 states have (on average 1.313821138211382) internal successors, (2424), 1872 states have internal predecessors, (2424), 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-11-11 21:11:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3212 transitions. [2024-11-11 21:11:44,567 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3212 transitions. Word has length 101 [2024-11-11 21:11:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:44,568 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3212 transitions. [2024-11-11 21:11:44,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-11 21:11:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3212 transitions. [2024-11-11 21:11:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:11:44,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:44,572 INFO L218 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, 1, 1, 1, 1] [2024-11-11 21:11:44,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:11:44,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:44,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash -151110586, now seen corresponding path program 1 times [2024-11-11 21:11:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:44,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790250759] [2024-11-11 21:11:44,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:11:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 21:11:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:11:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 21:11:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:11:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:11:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790250759] [2024-11-11 21:11:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790250759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:44,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:44,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:44,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972767762] [2024-11-11 21:11:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:44,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:44,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:44,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:44,667 INFO L87 Difference]: Start difference. First operand 2452 states and 3212 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11-11 21:11:44,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:44,948 INFO L93 Difference]: Finished difference Result 4705 states and 6188 transitions. [2024-11-11 21:11:44,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:44,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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 101 [2024-11-11 21:11:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:44,965 INFO L225 Difference]: With dead ends: 4705 [2024-11-11 21:11:44,966 INFO L226 Difference]: Without dead ends: 2461 [2024-11-11 21:11:44,972 INFO L434 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-11-11 21:11:44,973 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 3 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:44,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 466 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:44,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2024-11-11 21:11:45,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2455. [2024-11-11 21:11:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 1848 states have (on average 1.3133116883116882) internal successors, (2427), 1875 states have internal predecessors, (2427), 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-11-11 21:11:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3215 transitions. [2024-11-11 21:11:45,263 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3215 transitions. Word has length 101 [2024-11-11 21:11:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:45,264 INFO L471 AbstractCegarLoop]: Abstraction has 2455 states and 3215 transitions. [2024-11-11 21:11:45,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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-11-11 21:11:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3215 transitions. [2024-11-11 21:11:45,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:11:45,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:45,267 INFO L218 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, 1, 1, 1, 1] [2024-11-11 21:11:45,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:11:45,267 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:45,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:45,268 INFO L85 PathProgramCache]: Analyzing trace with hash -341042115, now seen corresponding path program 1 times [2024-11-11 21:11:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:45,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037364403] [2024-11-11 21:11:45,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:45,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:11:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 21:11:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 21:11:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 21:11:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 21:11:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:11:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:45,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:45,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037364403] [2024-11-11 21:11:45,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037364403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:45,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:45,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:45,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266803177] [2024-11-11 21:11:45,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:45,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:45,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:45,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:45,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:45,387 INFO L87 Difference]: Start difference. First operand 2455 states and 3215 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-11 21:11:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:45,765 INFO L93 Difference]: Finished difference Result 5826 states and 7668 transitions. [2024-11-11 21:11:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:45,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 101 [2024-11-11 21:11:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:45,787 INFO L225 Difference]: With dead ends: 5826 [2024-11-11 21:11:45,788 INFO L226 Difference]: Without dead ends: 3809 [2024-11-11 21:11:45,797 INFO L434 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-11-11 21:11:45,800 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 191 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:45,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1156 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:45,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2024-11-11 21:11:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3376. [2024-11-11 21:11:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 2530 states have (on average 1.3094861660079051) internal successors, (3313), 2567 states have internal predecessors, (3313), 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-11-11 21:11:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4415 transitions. [2024-11-11 21:11:46,119 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4415 transitions. Word has length 101 [2024-11-11 21:11:46,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:46,120 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 4415 transitions. [2024-11-11 21:11:46,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-11 21:11:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4415 transitions. [2024-11-11 21:11:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 21:11:46,123 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:46,124 INFO L218 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, 1, 1, 1, 1, 1] [2024-11-11 21:11:46,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:11:46,124 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:46,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1342850110, now seen corresponding path program 1 times [2024-11-11 21:11:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705146051] [2024-11-11 21:11:46,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:46,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:11:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:11:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:11:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705146051] [2024-11-11 21:11:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705146051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:46,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:46,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516050889] [2024-11-11 21:11:46,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:46,302 INFO L87 Difference]: Start difference. First operand 3376 states and 4415 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-11-11 21:11:46,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:46,609 INFO L93 Difference]: Finished difference Result 6404 states and 8398 transitions. [2024-11-11 21:11:46,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:46,610 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 102 [2024-11-11 21:11:46,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:46,628 INFO L225 Difference]: With dead ends: 6404 [2024-11-11 21:11:46,628 INFO L226 Difference]: Without dead ends: 3100 [2024-11-11 21:11:46,639 INFO L434 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-11-11 21:11:46,640 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 74 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:46,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 725 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:46,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2024-11-11 21:11:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2995. [2024-11-11 21:11:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2226 states have (on average 1.3144654088050314) internal successors, (2926), 2250 states have internal predecessors, (2926), 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-11-11 21:11:46,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3930 transitions. [2024-11-11 21:11:46,997 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3930 transitions. Word has length 102 [2024-11-11 21:11:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:46,997 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 3930 transitions. [2024-11-11 21:11:46,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-11-11 21:11:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3930 transitions. [2024-11-11 21:11:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 21:11:47,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:47,000 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:47,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:11:47,000 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:47,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:47,001 INFO L85 PathProgramCache]: Analyzing trace with hash 687578534, now seen corresponding path program 1 times [2024-11-11 21:11:47,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:47,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771497244] [2024-11-11 21:11:47,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:47,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:11:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:11:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:11:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:47,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:47,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771497244] [2024-11-11 21:11:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771497244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119234645] [2024-11-11 21:11:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:47,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:47,086 INFO L87 Difference]: Start difference. First operand 2995 states and 3930 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-11-11 21:11:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:47,472 INFO L93 Difference]: Finished difference Result 5837 states and 7691 transitions. [2024-11-11 21:11:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:47,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 104 [2024-11-11 21:11:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:47,491 INFO L225 Difference]: With dead ends: 5837 [2024-11-11 21:11:47,491 INFO L226 Difference]: Without dead ends: 3023 [2024-11-11 21:11:47,501 INFO L434 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-11-11 21:11:47,501 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 464 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-11-11 21:11:47,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 464 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2024-11-11 21:11:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 3002. [2024-11-11 21:11:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3002 states, 2233 states have (on average 1.3134796238244515) internal successors, (2933), 2257 states have internal predecessors, (2933), 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-11-11 21:11:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3002 states to 3002 states and 3937 transitions. [2024-11-11 21:11:47,783 INFO L78 Accepts]: Start accepts. Automaton has 3002 states and 3937 transitions. Word has length 104 [2024-11-11 21:11:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:47,784 INFO L471 AbstractCegarLoop]: Abstraction has 3002 states and 3937 transitions. [2024-11-11 21:11:47,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-11-11 21:11:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states and 3937 transitions. [2024-11-11 21:11:47,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 21:11:47,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:47,786 INFO L218 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:47,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:11:47,786 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:47,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:47,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1642694862, now seen corresponding path program 1 times [2024-11-11 21:11:47,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:47,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876806633] [2024-11-11 21:11:47,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:47,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:11:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:11:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 21:11:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 21:11:47,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:47,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876806633] [2024-11-11 21:11:47,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876806633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:47,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:47,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556627460] [2024-11-11 21:11:47,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:47,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:47,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:47,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:47,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:47,961 INFO L87 Difference]: Start difference. First operand 3002 states and 3937 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-11 21:11:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:48,199 INFO L93 Difference]: Finished difference Result 5798 states and 7628 transitions. [2024-11-11 21:11:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 104 [2024-11-11 21:11:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:48,222 INFO L225 Difference]: With dead ends: 5798 [2024-11-11 21:11:48,222 INFO L226 Difference]: Without dead ends: 2915 [2024-11-11 21:11:48,230 INFO L434 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-11-11 21:11:48,231 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 60 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:48,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 717 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2024-11-11 21:11:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 2759. [2024-11-11 21:11:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2759 states, 2049 states have (on average 1.3128355295265983) internal successors, (2690), 2068 states have internal predecessors, (2690), 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-11-11 21:11:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 3618 transitions. [2024-11-11 21:11:48,472 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 3618 transitions. Word has length 104 [2024-11-11 21:11:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:48,472 INFO L471 AbstractCegarLoop]: Abstraction has 2759 states and 3618 transitions. [2024-11-11 21:11:48,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-11-11 21:11:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 3618 transitions. [2024-11-11 21:11:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:11:48,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:48,477 INFO L218 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, 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-11-11 21:11:48,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-11 21:11:48,478 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -2091605457, now seen corresponding path program 1 times [2024-11-11 21:11:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608024957] [2024-11-11 21:11:48,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:11:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:11:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:11:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 21:11:48,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 21:11:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:11:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 21:11:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:11:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608024957] [2024-11-11 21:11:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608024957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615012400] [2024-11-11 21:11:48,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:48,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:11:48,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:48,942 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-11-11 21:11:48,944 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-11-11 21:11:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:49,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 21:11:49,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:11:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-11 21:11:49,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:11:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-11 21:11:49,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615012400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:11:49,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:11:49,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 19 [2024-11-11 21:11:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960425725] [2024-11-11 21:11:49,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:11:49,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 21:11:49,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 21:11:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:11:49,653 INFO L87 Difference]: Start difference. First operand 2759 states and 3618 transitions. Second operand has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-11 21:11:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:52,205 INFO L93 Difference]: Finished difference Result 7165 states and 9381 transitions. [2024-11-11 21:11:52,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-11 21:11:52,205 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) Word has length 153 [2024-11-11 21:11:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:52,227 INFO L225 Difference]: With dead ends: 7165 [2024-11-11 21:11:52,227 INFO L226 Difference]: Without dead ends: 4599 [2024-11-11 21:11:52,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=555, Invalid=2525, Unknown=0, NotChecked=0, Total=3080 [2024-11-11 21:11:52,237 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 1872 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1872 SdHoareTripleChecker+Valid, 3580 SdHoareTripleChecker+Invalid, 1832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 671 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:52,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1872 Valid, 3580 Invalid, 1832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [671 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 21:11:52,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2024-11-11 21:11:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4200. [2024-11-11 21:11:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4200 states, 3097 states have (on average 1.3067484662576687) internal successors, (4047), 3125 states have internal predecessors, (4047), 720 states have call successors, (720), 382 states have call predecessors, (720), 382 states have return successors, (720), 692 states have call predecessors, (720), 720 states have call successors, (720) [2024-11-11 21:11:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4200 states to 4200 states and 5487 transitions. [2024-11-11 21:11:52,842 INFO L78 Accepts]: Start accepts. Automaton has 4200 states and 5487 transitions. Word has length 153 [2024-11-11 21:11:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:52,843 INFO L471 AbstractCegarLoop]: Abstraction has 4200 states and 5487 transitions. [2024-11-11 21:11:52,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 13.294117647058824) internal successors, (226), 18 states have internal predecessors, (226), 10 states have call successors, (35), 4 states have call predecessors, (35), 7 states have return successors, (35), 9 states have call predecessors, (35), 10 states have call successors, (35) [2024-11-11 21:11:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4200 states and 5487 transitions. [2024-11-11 21:11:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:11:52,851 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:52,851 INFO L218 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] [2024-11-11 21:11:52,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:11:53,052 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-11-11 21:11:53,053 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:53,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 697534266, now seen corresponding path program 1 times [2024-11-11 21:11:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:53,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419782717] [2024-11-11 21:11:53,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:53,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:53,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:11:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:53,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:53,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:11:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:11:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:11:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:11:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:11:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 21:11:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:11:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 21:11:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 21:11:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:11:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:11:54,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419782717] [2024-11-11 21:11:54,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419782717] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:54,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505969312] [2024-11-11 21:11:54,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:54,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:11:54,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:54,062 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-11-11 21:11:54,063 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-11-11 21:11:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:54,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 21:11:54,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:11:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 37 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 21:11:54,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:11:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-11 21:11:54,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505969312] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:54,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 21:11:54,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 15] total 22 [2024-11-11 21:11:54,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093670557] [2024-11-11 21:11:54,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:54,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:11:54,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:54,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:11:54,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:11:54,810 INFO L87 Difference]: Start difference. First operand 4200 states and 5487 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 21:11:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:55,219 INFO L93 Difference]: Finished difference Result 7090 states and 9314 transitions. [2024-11-11 21:11:55,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:55,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 154 [2024-11-11 21:11:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:55,237 INFO L225 Difference]: With dead ends: 7090 [2024-11-11 21:11:55,238 INFO L226 Difference]: Without dead ends: 3139 [2024-11-11 21:11:55,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:11:55,248 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 0 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:55,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 740 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2024-11-11 21:11:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 3139. [2024-11-11 21:11:55,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3139 states, 2338 states have (on average 1.3023952095808384) internal successors, (3045), 2358 states have internal predecessors, (3045), 518 states have call successors, (518), 282 states have call predecessors, (518), 282 states have return successors, (518), 498 states have call predecessors, (518), 518 states have call successors, (518) [2024-11-11 21:11:55,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3139 states to 3139 states and 4081 transitions. [2024-11-11 21:11:55,656 INFO L78 Accepts]: Start accepts. Automaton has 3139 states and 4081 transitions. Word has length 154 [2024-11-11 21:11:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:55,657 INFO L471 AbstractCegarLoop]: Abstraction has 3139 states and 4081 transitions. [2024-11-11 21:11:55,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 21:11:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3139 states and 4081 transitions. [2024-11-11 21:11:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-11 21:11:55,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:55,663 INFO L218 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, 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-11-11 21:11:55,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 21:11:55,866 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-11-11 21:11:55,867 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:55,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:55,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1323920267, now seen corresponding path program 1 times [2024-11-11 21:11:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17019213] [2024-11-11 21:11:55,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:11:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:11:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:11:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:11:56,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 21:11:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 21:11:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 21:11:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 21:11:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:11:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 21:11:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:11:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:11:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:56,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17019213] [2024-11-11 21:11:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17019213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:56,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690587591] [2024-11-11 21:11:56,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:56,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:11:56,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:56,578 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-11-11 21:11:56,585 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-11-11 21:11:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 21:11:56,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:11:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 44 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:11:57,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:11:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:11:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690587591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:11:57,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:11:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 24 [2024-11-11 21:11:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300370506] [2024-11-11 21:11:57,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:11:57,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-11 21:11:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-11 21:11:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-11 21:11:57,499 INFO L87 Difference]: Start difference. First operand 3139 states and 4081 transitions. Second operand has 24 states, 24 states have (on average 10.833333333333334) internal successors, (260), 22 states have internal predecessors, (260), 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-11-11 21:12:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:01,849 INFO L93 Difference]: Finished difference Result 8927 states and 11667 transitions. [2024-11-11 21:12:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-11-11 21:12:01,850 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.833333333333334) internal successors, (260), 22 states have internal predecessors, (260), 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 155 [2024-11-11 21:12:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:01,877 INFO L225 Difference]: With dead ends: 8927 [2024-11-11 21:12:01,877 INFO L226 Difference]: Without dead ends: 6066 [2024-11-11 21:12:01,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=985, Invalid=5495, Unknown=0, NotChecked=0, Total=6480 [2024-11-11 21:12:01,887 INFO L435 NwaCegarLoop]: 626 mSDtfsCounter, 2469 mSDsluCounter, 7032 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2469 SdHoareTripleChecker+Valid, 7658 SdHoareTripleChecker+Invalid, 4544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:01,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2469 Valid, 7658 Invalid, 4544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 21:12:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2024-11-11 21:12:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 5180. [2024-11-11 21:12:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 3849 states have (on average 1.3070927513639907) internal successors, (5031), 3882 states have internal predecessors, (5031), 861 states have call successors, (861), 469 states have call predecessors, (861), 469 states have return successors, (861), 828 states have call predecessors, (861), 861 states have call successors, (861) [2024-11-11 21:12:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 6753 transitions. [2024-11-11 21:12:02,628 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 6753 transitions. Word has length 155 [2024-11-11 21:12:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:02,629 INFO L471 AbstractCegarLoop]: Abstraction has 5180 states and 6753 transitions. [2024-11-11 21:12:02,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.833333333333334) internal successors, (260), 22 states have internal predecessors, (260), 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-11-11 21:12:02,630 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 6753 transitions. [2024-11-11 21:12:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:12:02,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:02,639 INFO L218 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, 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-11-11 21:12:02,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:02,843 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-11-11 21:12:02,844 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2127382271, now seen corresponding path program 1 times [2024-11-11 21:12:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479134719] [2024-11-11 21:12:02,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:12:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:12:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:12:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:12:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:12:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 21:12:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:12:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 21:12:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:12:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 21:12:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:12:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:12:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-11 21:12:03,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479134719] [2024-11-11 21:12:03,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479134719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:03,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236420209] [2024-11-11 21:12:03,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:03,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:03,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:03,706 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-11-11 21:12:03,709 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-11-11 21:12:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:03,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 21:12:03,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 21:12:04,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-11 21:12:04,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236420209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:04,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2024-11-11 21:12:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163846915] [2024-11-11 21:12:04,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:04,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 21:12:04,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 21:12:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-11 21:12:04,194 INFO L87 Difference]: Start difference. First operand 5180 states and 6753 transitions. Second operand has 15 states, 14 states have (on average 13.0) internal successors, (182), 12 states have internal predecessors, (182), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-11 21:12:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:05,512 INFO L93 Difference]: Finished difference Result 13610 states and 17646 transitions. [2024-11-11 21:12:05,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 21:12:05,513 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 13.0) internal successors, (182), 12 states have internal predecessors, (182), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) Word has length 157 [2024-11-11 21:12:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:05,559 INFO L225 Difference]: With dead ends: 13610 [2024-11-11 21:12:05,559 INFO L226 Difference]: Without dead ends: 8634 [2024-11-11 21:12:05,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-11-11 21:12:05,575 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 327 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:05,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2825 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:05,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8634 states. [2024-11-11 21:12:06,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8634 to 5866. [2024-11-11 21:12:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5866 states, 4344 states have (on average 1.304097605893186) internal successors, (5665), 4384 states have internal predecessors, (5665), 978 states have call successors, (978), 543 states have call predecessors, (978), 543 states have return successors, (978), 938 states have call predecessors, (978), 978 states have call successors, (978) [2024-11-11 21:12:06,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5866 states to 5866 states and 7621 transitions. [2024-11-11 21:12:06,391 INFO L78 Accepts]: Start accepts. Automaton has 5866 states and 7621 transitions. Word has length 157 [2024-11-11 21:12:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:06,394 INFO L471 AbstractCegarLoop]: Abstraction has 5866 states and 7621 transitions. [2024-11-11 21:12:06,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 13.0) internal successors, (182), 12 states have internal predecessors, (182), 5 states have call successors, (32), 4 states have call predecessors, (32), 8 states have return successors, (32), 7 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-11 21:12:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 5866 states and 7621 transitions. [2024-11-11 21:12:06,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-11 21:12:06,402 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:06,402 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:12:06,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:12:06,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:06,603 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:06,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:06,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1838933631, now seen corresponding path program 1 times [2024-11-11 21:12:06,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:06,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477852897] [2024-11-11 21:12:06,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:06,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:12:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:12:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:12:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:12:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:12:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:12:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:12:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 21:12:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 21:12:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 21:12:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:12:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:12:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 21:12:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 21:12:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 21:12:07,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:07,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477852897] [2024-11-11 21:12:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477852897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235092868] [2024-11-11 21:12:07,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:07,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:07,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:07,407 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-11-11 21:12:07,409 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-11-11 21:12:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:07,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-11 21:12:07,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 21:12:07,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 21:12:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235092868] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:08,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:08,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 9] total 23 [2024-11-11 21:12:08,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505630950] [2024-11-11 21:12:08,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:08,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:12:08,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:08,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:12:08,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:12:08,163 INFO L87 Difference]: Start difference. First operand 5866 states and 7621 transitions. Second operand has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 18 states have internal predecessors, (178), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-11 21:12:10,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:10,706 INFO L93 Difference]: Finished difference Result 16410 states and 21931 transitions. [2024-11-11 21:12:10,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:12:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 18 states have internal predecessors, (178), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) Word has length 173 [2024-11-11 21:12:10,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:10,765 INFO L225 Difference]: With dead ends: 16410 [2024-11-11 21:12:10,766 INFO L226 Difference]: Without dead ends: 10652 [2024-11-11 21:12:10,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=1310, Unknown=0, NotChecked=0, Total=1560 [2024-11-11 21:12:10,784 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 558 mSDsluCounter, 4626 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 4983 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:10,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 4983 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 1806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:12:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10652 states. [2024-11-11 21:12:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10652 to 6812. [2024-11-11 21:12:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6812 states, 5022 states have (on average 1.2947033054559935) internal successors, (6502), 5072 states have internal predecessors, (6502), 1150 states have call successors, (1150), 639 states have call predecessors, (1150), 639 states have return successors, (1150), 1100 states have call predecessors, (1150), 1150 states have call successors, (1150) [2024-11-11 21:12:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 8802 transitions. [2024-11-11 21:12:11,793 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 8802 transitions. Word has length 173 [2024-11-11 21:12:11,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:11,793 INFO L471 AbstractCegarLoop]: Abstraction has 6812 states and 8802 transitions. [2024-11-11 21:12:11,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.739130434782608) internal successors, (178), 18 states have internal predecessors, (178), 4 states have call successors, (29), 4 states have call predecessors, (29), 10 states have return successors, (32), 9 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-11 21:12:11,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 8802 transitions. [2024-11-11 21:12:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-11 21:12:11,801 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:11,802 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:12:11,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:12,003 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash -468352694, now seen corresponding path program 1 times [2024-11-11 21:12:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490427857] [2024-11-11 21:12:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:12,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:12:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:12:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:12:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:12:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:12:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:12:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 21:12:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:12:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:12:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 21:12:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:12:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 21:12:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 21:12:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:12:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-11 21:12:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:12:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490427857] [2024-11-11 21:12:12,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490427857] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:12,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879053253] [2024-11-11 21:12:12,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:12,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:12,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:12,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:13,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 21:12:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:13,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 835 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-11 21:12:13,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 76 proven. 14 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 21:12:13,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:12:14,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879053253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:14,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:14,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 30 [2024-11-11 21:12:14,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518949676] [2024-11-11 21:12:14,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:14,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-11 21:12:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:14,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-11 21:12:14,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2024-11-11 21:12:14,540 INFO L87 Difference]: Start difference. First operand 6812 states and 8802 transitions. Second operand has 30 states, 30 states have (on average 9.3) internal successors, (279), 30 states have internal predecessors, (279), 10 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-11-11 21:12:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:17,127 INFO L93 Difference]: Finished difference Result 14485 states and 18807 transitions. [2024-11-11 21:12:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 21:12:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.3) internal successors, (279), 30 states have internal predecessors, (279), 10 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) Word has length 180 [2024-11-11 21:12:17,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:17,164 INFO L225 Difference]: With dead ends: 14485 [2024-11-11 21:12:17,164 INFO L226 Difference]: Without dead ends: 7992 [2024-11-11 21:12:17,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2024-11-11 21:12:17,180 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1215 mSDsluCounter, 5495 mSDsCounter, 0 mSdLazyCounter, 2859 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 5932 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 2859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:17,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 5932 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 2859 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 21:12:17,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7992 states. [2024-11-11 21:12:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7992 to 7935. [2024-11-11 21:12:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7935 states, 5836 states have (on average 1.2947224126113777) internal successors, (7556), 5897 states have internal predecessors, (7556), 1349 states have call successors, (1349), 749 states have call predecessors, (1349), 749 states have return successors, (1349), 1288 states have call predecessors, (1349), 1349 states have call successors, (1349) [2024-11-11 21:12:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 10254 transitions. [2024-11-11 21:12:18,594 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 10254 transitions. Word has length 180 [2024-11-11 21:12:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:18,595 INFO L471 AbstractCegarLoop]: Abstraction has 7935 states and 10254 transitions. [2024-11-11 21:12:18,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.3) internal successors, (279), 30 states have internal predecessors, (279), 10 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-11-11 21:12:18,595 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 10254 transitions. [2024-11-11 21:12:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-11 21:12:18,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:18,605 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:18,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:18,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:18,806 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:18,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:18,807 INFO L85 PathProgramCache]: Analyzing trace with hash 402397944, now seen corresponding path program 1 times [2024-11-11 21:12:18,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:18,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360871772] [2024-11-11 21:12:18,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:18,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:12:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:12:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 21:12:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:12:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:12:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:12:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:12:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 21:12:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:12:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:12:19,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:12:19,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:12:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 21:12:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 21:12:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-11 21:12:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-11 21:12:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-11 21:12:19,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:19,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360871772] [2024-11-11 21:12:19,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360871772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:19,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:19,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:12:19,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222320663] [2024-11-11 21:12:19,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:19,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:12:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:12:19,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:19,049 INFO L87 Difference]: Start difference. First operand 7935 states and 10254 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:20,908 INFO L93 Difference]: Finished difference Result 23447 states and 30380 transitions. [2024-11-11 21:12:20,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:12:20,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 180 [2024-11-11 21:12:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:20,981 INFO L225 Difference]: With dead ends: 23447 [2024-11-11 21:12:20,982 INFO L226 Difference]: Without dead ends: 15831 [2024-11-11 21:12:21,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 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-11-11 21:12:21,004 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 215 mSDsluCounter, 2011 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:21,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2478 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15831 states. [2024-11-11 21:12:22,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15831 to 11392. [2024-11-11 21:12:22,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11392 states, 8323 states have (on average 1.2926829268292683) internal successors, (10759), 8411 states have internal predecessors, (10759), 1991 states have call successors, (1991), 1077 states have call predecessors, (1991), 1077 states have return successors, (1991), 1903 states have call predecessors, (1991), 1991 states have call successors, (1991) [2024-11-11 21:12:22,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11392 states to 11392 states and 14741 transitions. [2024-11-11 21:12:22,528 INFO L78 Accepts]: Start accepts. Automaton has 11392 states and 14741 transitions. Word has length 180 [2024-11-11 21:12:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:22,529 INFO L471 AbstractCegarLoop]: Abstraction has 11392 states and 14741 transitions. [2024-11-11 21:12:22,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 6 states have internal predecessors, (102), 3 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11392 states and 14741 transitions. [2024-11-11 21:12:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-11 21:12:22,541 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:22,541 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-11 21:12:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:12:22,541 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:22,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:22,542 INFO L85 PathProgramCache]: Analyzing trace with hash 349931155, now seen corresponding path program 1 times [2024-11-11 21:12:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108488133] [2024-11-11 21:12:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:12:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:12:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:12:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:12:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:12:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:12:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 21:12:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:12:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:12:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 21:12:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 21:12:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:12:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 21:12:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-11 21:12:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-11 21:12:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:12:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108488133] [2024-11-11 21:12:23,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108488133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396146541] [2024-11-11 21:12:23,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:23,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:23,904 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:23,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 21:12:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-11 21:12:24,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 73 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 21:12:24,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:12:26,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396146541] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:26,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:26,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 28 [2024-11-11 21:12:26,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997407627] [2024-11-11 21:12:26,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:26,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-11 21:12:26,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-11 21:12:26,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2024-11-11 21:12:26,339 INFO L87 Difference]: Start difference. First operand 11392 states and 14741 transitions. Second operand has 28 states, 28 states have (on average 10.214285714285714) internal successors, (286), 28 states have internal predecessors, (286), 10 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-11-11 21:12:29,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:29,363 INFO L93 Difference]: Finished difference Result 23215 states and 30121 transitions. [2024-11-11 21:12:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-11 21:12:29,364 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.214285714285714) internal successors, (286), 28 states have internal predecessors, (286), 10 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) Word has length 181 [2024-11-11 21:12:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:29,408 INFO L225 Difference]: With dead ends: 23215 [2024-11-11 21:12:29,408 INFO L226 Difference]: Without dead ends: 12142 [2024-11-11 21:12:29,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2024-11-11 21:12:29,429 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 748 mSDsluCounter, 3739 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 4152 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:29,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 4152 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 21:12:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2024-11-11 21:12:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 12030. [2024-11-11 21:12:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12030 states, 8790 states have (on average 1.2918088737201365) internal successors, (11355), 8884 states have internal predecessors, (11355), 2100 states have call successors, (2100), 1139 states have call predecessors, (2100), 1139 states have return successors, (2100), 2006 states have call predecessors, (2100), 2100 states have call successors, (2100) [2024-11-11 21:12:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12030 states to 12030 states and 15555 transitions. [2024-11-11 21:12:31,245 INFO L78 Accepts]: Start accepts. Automaton has 12030 states and 15555 transitions. Word has length 181 [2024-11-11 21:12:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:31,246 INFO L471 AbstractCegarLoop]: Abstraction has 12030 states and 15555 transitions. [2024-11-11 21:12:31,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.214285714285714) internal successors, (286), 28 states have internal predecessors, (286), 10 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-11-11 21:12:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 12030 states and 15555 transitions. [2024-11-11 21:12:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-11 21:12:31,259 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:31,259 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:31,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 21:12:31,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:31,460 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:31,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:31,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1387031853, now seen corresponding path program 1 times [2024-11-11 21:12:31,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:31,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385968480] [2024-11-11 21:12:31,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:31,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:12:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 21:12:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 21:12:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 21:12:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 21:12:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:12:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:12:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 21:12:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 21:12:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:12:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 21:12:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 21:12:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 21:12:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:12:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-11 21:12:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-11 21:12:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:12:31,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385968480] [2024-11-11 21:12:31,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385968480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:31,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203272706] [2024-11-11 21:12:31,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:31,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:31,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:31,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:31,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 21:12:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:32,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-11 21:12:32,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:32,509 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 68 proven. 22 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 21:12:32,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:32,885 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-11 21:12:32,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203272706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:32,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:32,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 22 [2024-11-11 21:12:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462387177] [2024-11-11 21:12:32,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:32,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-11 21:12:32,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:32,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-11 21:12:32,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-11 21:12:32,887 INFO L87 Difference]: Start difference. First operand 12030 states and 15555 transitions. Second operand has 22 states, 22 states have (on average 13.045454545454545) internal successors, (287), 22 states have internal predecessors, (287), 9 states have call successors, (47), 5 states have call predecessors, (47), 6 states have return successors, (46), 9 states have call predecessors, (46), 9 states have call successors, (46)