./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.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.4_1.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 ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:11:20,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:11:20,124 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:20,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:11:20,127 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:11:20,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:11:20,158 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:11:20,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:11:20,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:11:20,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:11:20,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:11:20,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:11:20,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:11:20,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:11:20,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:11:20,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:11:20,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:11:20,165 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:11:20,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:11:20,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:11:20,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:11:20,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:11:20,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:11:20,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:11:20,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:11:20,168 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:11:20,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:11:20,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:11:20,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:11:20,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:11:20,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:11:20,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:11:20,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:11:20,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:11:20,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:11:20,170 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:11:20,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:11:20,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:11:20,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:11:20,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:11:20,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:11:20,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:11:20,173 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 -> ac8e60fb32c268c01bf0cc1d1cd76454411c67e3ab15d16b4eca5e74b982e97f [2024-11-11 21:11:20,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:11:20,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:11:20,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:11:20,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:11:20,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:11:20,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-11-11 21:11:21,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:11:22,136 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:11:22,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-11-11 21:11:22,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175f60288/8cf9be62df09498498d93efeb7719923/FLAGabc075457 [2024-11-11 21:11:22,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/175f60288/8cf9be62df09498498d93efeb7719923 [2024-11-11 21:11:22,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:11:22,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:11:22,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:11:22,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:11:22,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:11:22,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:11:22" (1/1) ... [2024-11-11 21:11:22,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c0cfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:22, skipping insertion in model container [2024-11-11 21:11:22,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:11:22" (1/1) ... [2024-11-11 21:11:22,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:11:22,554 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.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-11-11 21:11:22,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:11:22,568 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:11:22,671 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.4_1.ufo.UNBOUNDED.pals.c[14522,14535] [2024-11-11 21:11:22,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:11:22,728 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:11:22,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:22 WrapperNode [2024-11-11 21:11:22,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:11:22,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:11:22,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:11:22,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:11:22,742 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:22" (1/1) ... [2024-11-11 21:11:22,772 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:22" (1/1) ... [2024-11-11 21:11:22,811 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 502 [2024-11-11 21:11:22,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:11:22,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:11:22,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:11:22,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:11:22,823 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:22" (1/1) ... [2024-11-11 21:11:22,823 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:22" (1/1) ... [2024-11-11 21:11:22,827 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:22" (1/1) ... [2024-11-11 21:11:22,844 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:22,844 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:22" (1/1) ... [2024-11-11 21:11:22,844 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:22" (1/1) ... [2024-11-11 21:11:22,855 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:22" (1/1) ... [2024-11-11 21:11:22,862 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:22" (1/1) ... [2024-11-11 21:11:22,865 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:22" (1/1) ... [2024-11-11 21:11:22,867 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:22" (1/1) ... [2024-11-11 21:11:22,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:11:22,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:11:22,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:11:22,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:11:22,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:22" (1/1) ... [2024-11-11 21:11:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:11:22,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:22,909 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:22,916 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:22,963 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2024-11-11 21:11:22,963 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2024-11-11 21:11:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:11:22,964 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2024-11-11 21:11:22,964 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2024-11-11 21:11:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-11 21:11:22,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-11 21:11:22,965 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2024-11-11 21:11:22,965 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2024-11-11 21:11:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-11 21:11:22,967 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-11 21:11:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:11:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2024-11-11 21:11:22,967 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2024-11-11 21:11:22,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:11:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:11:22,968 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2024-11-11 21:11:22,968 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2024-11-11 21:11:23,089 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:11:23,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:11:23,650 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2024-11-11 21:11:23,650 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:11:23,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:11:23,676 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 21:11:23,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:11:23 BoogieIcfgContainer [2024-11-11 21:11:23,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:11:23,679 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:11:23,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:11:23,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:11:23,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:11:22" (1/3) ... [2024-11-11 21:11:23,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67599f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:11:23, skipping insertion in model container [2024-11-11 21:11:23,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:11:22" (2/3) ... [2024-11-11 21:11:23,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67599f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:11:23, skipping insertion in model container [2024-11-11 21:11:23,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:11:23" (3/3) ... [2024-11-11 21:11:23,684 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.4_1.ufo.UNBOUNDED.pals.c [2024-11-11 21:11:23,698 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:11:23,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:11:23,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:11:23,768 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;@30cadf82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:11:23,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:11:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 140 states have internal predecessors, (214), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 21:11:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:11:23,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:23,782 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:23,782 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:23,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:23,786 INFO L85 PathProgramCache]: Analyzing trace with hash -131107926, now seen corresponding path program 1 times [2024-11-11 21:11:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:23,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143098976] [2024-11-11 21:11:23,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:24,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:11:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:24,115 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:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:24,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143098976] [2024-11-11 21:11:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143098976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:24,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:24,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 21:11:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933422372] [2024-11-11 21:11:24,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 21:11:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:24,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 21:11:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 21:11:24,173 INFO L87 Difference]: Start difference. First operand has 178 states, 138 states have (on average 1.5507246376811594) internal successors, (214), 140 states have internal predecessors, (214), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:24,216 INFO L93 Difference]: Finished difference Result 336 states and 549 transitions. [2024-11-11 21:11:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 21:11:24,222 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:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:24,236 INFO L225 Difference]: With dead ends: 336 [2024-11-11 21:11:24,236 INFO L226 Difference]: Without dead ends: 174 [2024-11-11 21:11:24,241 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:24,247 INFO L435 NwaCegarLoop]: 269 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, 269 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:24,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 269 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:24,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-11 21:11:24,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-11 21:11:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.5333333333333334) internal successors, (207), 136 states have internal predecessors, (207), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 21:11:24,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 269 transitions. [2024-11-11 21:11:24,297 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 269 transitions. Word has length 28 [2024-11-11 21:11:24,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:24,297 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 269 transitions. [2024-11-11 21:11:24,297 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:24,298 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 269 transitions. [2024-11-11 21:11:24,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 21:11:24,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:24,299 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:24,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:11:24,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:24,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 87746792, now seen corresponding path program 1 times [2024-11-11 21:11:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:24,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460778648] [2024-11-11 21:11:24,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:24,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:11:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:24,556 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:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:24,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460778648] [2024-11-11 21:11:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460778648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:24,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:24,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:11:24,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414176882] [2024-11-11 21:11:24,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:24,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:11:24,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:11:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:11:24,560 INFO L87 Difference]: Start difference. First operand 174 states and 269 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:24,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:24,661 INFO L93 Difference]: Finished difference Result 334 states and 512 transitions. [2024-11-11 21:11:24,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:11:24,663 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:24,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:24,666 INFO L225 Difference]: With dead ends: 334 [2024-11-11 21:11:24,667 INFO L226 Difference]: Without dead ends: 174 [2024-11-11 21:11:24,669 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:24,672 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 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.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:24,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-11 21:11:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-11 21:11:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.4444444444444444) internal successors, (195), 136 states have internal predecessors, (195), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 21:11:24,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2024-11-11 21:11:24,695 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 257 transitions. Word has length 28 [2024-11-11 21:11:24,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:24,696 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 257 transitions. [2024-11-11 21:11:24,696 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:24,696 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 257 transitions. [2024-11-11 21:11:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 21:11:24,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:24,697 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:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:11:24,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:24,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:24,699 INFO L85 PathProgramCache]: Analyzing trace with hash -475299443, now seen corresponding path program 1 times [2024-11-11 21:11:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721620321] [2024-11-11 21:11:24,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:24,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:24,975 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:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:24,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721620321] [2024-11-11 21:11:24,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721620321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:24,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:24,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:24,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005424900] [2024-11-11 21:11:24,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:24,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:24,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:24,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:24,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:24,981 INFO L87 Difference]: Start difference. First operand 174 states and 257 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:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:25,046 INFO L93 Difference]: Finished difference Result 335 states and 504 transitions. [2024-11-11 21:11:25,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:25,046 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:25,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:25,048 INFO L225 Difference]: With dead ends: 335 [2024-11-11 21:11:25,048 INFO L226 Difference]: Without dead ends: 178 [2024-11-11 21:11:25,049 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:25,050 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 3 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 743 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:25,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 743 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:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-11 21:11:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2024-11-11 21:11:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 138 states have (on average 1.434782608695652) internal successors, (198), 139 states have internal predecessors, (198), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 21:11:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 260 transitions. [2024-11-11 21:11:25,078 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 260 transitions. Word has length 39 [2024-11-11 21:11:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:25,079 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 260 transitions. [2024-11-11 21:11:25,080 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:25,080 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 260 transitions. [2024-11-11 21:11:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-11 21:11:25,082 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:25,082 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:25,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:11:25,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1731358847, now seen corresponding path program 1 times [2024-11-11 21:11:25,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541365363] [2024-11-11 21:11:25,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 21:11:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,207 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:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541365363] [2024-11-11 21:11:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541365363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:25,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394361860] [2024-11-11 21:11:25,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:25,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:25,211 INFO L87 Difference]: Start difference. First operand 178 states and 260 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:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:25,258 INFO L93 Difference]: Finished difference Result 488 states and 723 transitions. [2024-11-11 21:11:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:25,259 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:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:25,262 INFO L225 Difference]: With dead ends: 488 [2024-11-11 21:11:25,262 INFO L226 Difference]: Without dead ends: 327 [2024-11-11 21:11:25,266 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:25,270 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 208 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 515 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:25,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 515 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:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-11 21:11:25,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2024-11-11 21:11:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 245 states have (on average 1.453061224489796) internal successors, (356), 247 states have internal predecessors, (356), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-11 21:11:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 476 transitions. [2024-11-11 21:11:25,326 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 476 transitions. Word has length 55 [2024-11-11 21:11:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:25,327 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 476 transitions. [2024-11-11 21:11:25,327 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:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 476 transitions. [2024-11-11 21:11:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:11:25,331 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:25,331 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:25,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:11:25,333 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:25,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1025460899, now seen corresponding path program 1 times [2024-11-11 21:11:25,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:25,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751336970] [2024-11-11 21:11:25,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:25,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:11:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,459 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:25,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:25,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751336970] [2024-11-11 21:11:25,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751336970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:25,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:25,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:25,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13424748] [2024-11-11 21:11:25,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:25,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:25,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:25,465 INFO L87 Difference]: Start difference. First operand 322 states and 476 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:25,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:25,542 INFO L93 Difference]: Finished difference Result 905 states and 1349 transitions. [2024-11-11 21:11:25,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:25,543 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:25,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:25,553 INFO L225 Difference]: With dead ends: 905 [2024-11-11 21:11:25,554 INFO L226 Difference]: Without dead ends: 600 [2024-11-11 21:11:25,556 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:25,557 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 210 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 537 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:25,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 537 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:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-11 21:11:25,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 594. [2024-11-11 21:11:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 445 states have (on average 1.4629213483146069) internal successors, (651), 449 states have internal predecessors, (651), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-11 21:11:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 885 transitions. [2024-11-11 21:11:25,617 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 885 transitions. Word has length 56 [2024-11-11 21:11:25,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:25,618 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 885 transitions. [2024-11-11 21:11:25,620 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:25,621 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 885 transitions. [2024-11-11 21:11:25,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 21:11:25,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:25,622 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:25,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:11:25,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1989642719, now seen corresponding path program 1 times [2024-11-11 21:11:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686816921] [2024-11-11 21:11:25,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 21:11:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:25,782 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:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686816921] [2024-11-11 21:11:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686816921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:25,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:11:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038715582] [2024-11-11 21:11:25,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:25,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:11:25,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:25,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:11:25,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:11:25,784 INFO L87 Difference]: Start difference. First operand 594 states and 885 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:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:25,982 INFO L93 Difference]: Finished difference Result 1271 states and 1888 transitions. [2024-11-11 21:11:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:25,983 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:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:25,990 INFO L225 Difference]: With dead ends: 1271 [2024-11-11 21:11:25,990 INFO L226 Difference]: Without dead ends: 694 [2024-11-11 21:11:25,991 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:25,992 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 355 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:25,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 665 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:25,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-11 21:11:26,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-11 21:11:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.448076923076923) internal successors, (753), 523 states have internal predecessors, (753), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1001 transitions. [2024-11-11 21:11:26,045 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1001 transitions. Word has length 56 [2024-11-11 21:11:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:26,046 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 1001 transitions. [2024-11-11 21:11:26,046 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:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1001 transitions. [2024-11-11 21:11:26,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:11:26,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:26,047 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:26,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 21:11:26,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash -138082030, now seen corresponding path program 1 times [2024-11-11 21:11:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134293546] [2024-11-11 21:11:26,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:11:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,202 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:26,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:26,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134293546] [2024-11-11 21:11:26,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134293546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:26,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:26,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:11:26,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500139313] [2024-11-11 21:11:26,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:26,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:11:26,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:11:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:11:26,204 INFO L87 Difference]: Start difference. First operand 682 states and 1001 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:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:26,370 INFO L93 Difference]: Finished difference Result 1271 states and 1880 transitions. [2024-11-11 21:11:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:26,371 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:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:26,377 INFO L225 Difference]: With dead ends: 1271 [2024-11-11 21:11:26,377 INFO L226 Difference]: Without dead ends: 694 [2024-11-11 21:11:26,379 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:26,380 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 352 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:26,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 668 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-11 21:11:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-11 21:11:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 520 states have (on average 1.4403846153846154) internal successors, (749), 523 states have internal predecessors, (749), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 997 transitions. [2024-11-11 21:11:26,428 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 997 transitions. Word has length 57 [2024-11-11 21:11:26,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:26,428 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 997 transitions. [2024-11-11 21:11:26,428 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:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 997 transitions. [2024-11-11 21:11:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 21:11:26,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:26,431 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] [2024-11-11 21:11:26,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:11:26,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:26,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1602179858, now seen corresponding path program 1 times [2024-11-11 21:11:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:26,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187579401] [2024-11-11 21:11:26,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:26,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,631 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:26,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:26,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187579401] [2024-11-11 21:11:26,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187579401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:26,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:26,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:26,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049298057] [2024-11-11 21:11:26,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:26,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:26,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:26,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:26,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:26,634 INFO L87 Difference]: Start difference. First operand 682 states and 997 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:26,701 INFO L93 Difference]: Finished difference Result 1279 states and 1892 transitions. [2024-11-11 21:11:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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 58 [2024-11-11 21:11:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:26,706 INFO L225 Difference]: With dead ends: 1279 [2024-11-11 21:11:26,706 INFO L226 Difference]: Without dead ends: 702 [2024-11-11 21:11:26,708 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:26,709 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 4 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 755 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:26,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 755 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:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2024-11-11 21:11:26,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2024-11-11 21:11:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 536 states have (on average 1.4272388059701493) internal successors, (765), 539 states have internal predecessors, (765), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1013 transitions. [2024-11-11 21:11:26,753 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1013 transitions. Word has length 58 [2024-11-11 21:11:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1013 transitions. [2024-11-11 21:11:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 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:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1013 transitions. [2024-11-11 21:11:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 21:11:26,755 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:26,755 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] [2024-11-11 21:11:26,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:11:26,755 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:26,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1495777117, now seen corresponding path program 1 times [2024-11-11 21:11:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:26,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450930434] [2024-11-11 21:11:26,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:26,988 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:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:26,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450930434] [2024-11-11 21:11:26,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450930434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:26,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:26,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:26,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152802168] [2024-11-11 21:11:26,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:26,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:26,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:26,991 INFO L87 Difference]: Start difference. First operand 702 states and 1013 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:27,070 INFO L93 Difference]: Finished difference Result 1319 states and 1936 transitions. [2024-11-11 21:11:27,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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 66 [2024-11-11 21:11:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:27,076 INFO L225 Difference]: With dead ends: 1319 [2024-11-11 21:11:27,077 INFO L226 Difference]: Without dead ends: 722 [2024-11-11 21:11:27,079 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:27,081 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 741 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:27,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 741 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:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-11 21:11:27,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 722. [2024-11-11 21:11:27,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 552 states have (on average 1.414855072463768) internal successors, (781), 555 states have internal predecessors, (781), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1029 transitions. [2024-11-11 21:11:27,130 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1029 transitions. Word has length 66 [2024-11-11 21:11:27,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:27,131 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 1029 transitions. [2024-11-11 21:11:27,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 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:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1029 transitions. [2024-11-11 21:11:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:11:27,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:27,133 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] [2024-11-11 21:11:27,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:11:27,134 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:27,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:27,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1186649897, now seen corresponding path program 1 times [2024-11-11 21:11:27,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198482763] [2024-11-11 21:11:27,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:27,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,359 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:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198482763] [2024-11-11 21:11:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198482763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023681625] [2024-11-11 21:11:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:27,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:27,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:27,361 INFO L87 Difference]: Start difference. First operand 722 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:27,439 INFO L93 Difference]: Finished difference Result 1359 states and 1968 transitions. [2024-11-11 21:11:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:27,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 74 [2024-11-11 21:11:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:27,445 INFO L225 Difference]: With dead ends: 1359 [2024-11-11 21:11:27,445 INFO L226 Difference]: Without dead ends: 742 [2024-11-11 21:11:27,447 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:27,448 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 4 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 741 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:27,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 741 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:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-11 21:11:27,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 742. [2024-11-11 21:11:27,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 568 states have (on average 1.403169014084507) internal successors, (797), 571 states have internal predecessors, (797), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1045 transitions. [2024-11-11 21:11:27,491 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1045 transitions. Word has length 74 [2024-11-11 21:11:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:27,491 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1045 transitions. [2024-11-11 21:11:27,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1045 transitions. [2024-11-11 21:11:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 21:11:27,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:27,493 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] [2024-11-11 21:11:27,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:11:27,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1209809406, now seen corresponding path program 1 times [2024-11-11 21:11:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:27,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319004884] [2024-11-11 21:11:27,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:27,707 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:27,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:27,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319004884] [2024-11-11 21:11:27,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319004884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:27,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:27,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384920042] [2024-11-11 21:11:27,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:27,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:27,710 INFO L87 Difference]: Start difference. First operand 742 states and 1045 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:27,786 INFO L93 Difference]: Finished difference Result 1395 states and 1984 transitions. [2024-11-11 21:11:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:27,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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 74 [2024-11-11 21:11:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:27,792 INFO L225 Difference]: With dead ends: 1395 [2024-11-11 21:11:27,792 INFO L226 Difference]: Without dead ends: 758 [2024-11-11 21:11:27,794 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:27,795 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 751 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:27,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 751 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:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2024-11-11 21:11:27,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2024-11-11 21:11:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 580 states have (on average 1.3948275862068966) internal successors, (809), 583 states have internal predecessors, (809), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:27,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1057 transitions. [2024-11-11 21:11:27,841 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1057 transitions. Word has length 74 [2024-11-11 21:11:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:27,842 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1057 transitions. [2024-11-11 21:11:27,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 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:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1057 transitions. [2024-11-11 21:11:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-11 21:11:27,844 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:27,844 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] [2024-11-11 21:11:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:11:27,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:27,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -203434871, now seen corresponding path program 1 times [2024-11-11 21:11:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:27,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403464822] [2024-11-11 21:11:27,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:27,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,061 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:28,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:28,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403464822] [2024-11-11 21:11:28,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403464822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:28,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:28,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636837537] [2024-11-11 21:11:28,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:28,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:28,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:28,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:28,064 INFO L87 Difference]: Start difference. First operand 758 states and 1057 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, (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:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:28,146 INFO L93 Difference]: Finished difference Result 1435 states and 2020 transitions. [2024-11-11 21:11:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:28,146 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, (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 82 [2024-11-11 21:11:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:28,152 INFO L225 Difference]: With dead ends: 1435 [2024-11-11 21:11:28,152 INFO L226 Difference]: Without dead ends: 782 [2024-11-11 21:11:28,154 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:28,155 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 5 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 753 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:28,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 753 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:28,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2024-11-11 21:11:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2024-11-11 21:11:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 600 states have (on average 1.3816666666666666) internal successors, (829), 603 states have internal predecessors, (829), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-11 21:11:28,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1077 transitions. [2024-11-11 21:11:28,204 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1077 transitions. Word has length 82 [2024-11-11 21:11:28,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:28,204 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1077 transitions. [2024-11-11 21:11:28,204 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, (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:28,205 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1077 transitions. [2024-11-11 21:11:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 21:11:28,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:28,206 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] [2024-11-11 21:11:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:11:28,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:28,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1273158516, now seen corresponding path program 1 times [2024-11-11 21:11:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112067085] [2024-11-11 21:11:28,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:28,791 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:28,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:28,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112067085] [2024-11-11 21:11:28,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112067085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:28,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:28,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314808861] [2024-11-11 21:11:28,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:28,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:28,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:28,793 INFO L87 Difference]: Start difference. First operand 782 states and 1077 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 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:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:29,141 INFO L93 Difference]: Finished difference Result 2029 states and 2783 transitions. [2024-11-11 21:11:29,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:29,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 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 85 [2024-11-11 21:11:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:29,149 INFO L225 Difference]: With dead ends: 2029 [2024-11-11 21:11:29,150 INFO L226 Difference]: Without dead ends: 1352 [2024-11-11 21:11:29,152 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:29,153 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 196 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:29,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1452 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:11:29,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-11 21:11:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1066. [2024-11-11 21:11:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 811 states have (on average 1.369913686806412) internal successors, (1111), 816 states have internal predecessors, (1111), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172) [2024-11-11 21:11:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1455 transitions. [2024-11-11 21:11:29,265 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1455 transitions. Word has length 85 [2024-11-11 21:11:29,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:29,265 INFO L471 AbstractCegarLoop]: Abstraction has 1066 states and 1455 transitions. [2024-11-11 21:11:29,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 6 states have internal predecessors, (64), 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:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1455 transitions. [2024-11-11 21:11:29,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-11 21:11:29,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:29,268 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] [2024-11-11 21:11:29,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:11:29,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:29,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:29,268 INFO L85 PathProgramCache]: Analyzing trace with hash 754951298, now seen corresponding path program 1 times [2024-11-11 21:11:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:29,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821500320] [2024-11-11 21:11:29,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:29,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:29,563 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:29,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821500320] [2024-11-11 21:11:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821500320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:29,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:29,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 21:11:29,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511097381] [2024-11-11 21:11:29,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:29,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 21:11:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:29,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 21:11:29,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:11:29,565 INFO L87 Difference]: Start difference. First operand 1066 states and 1455 transitions. Second operand has 8 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:11:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:29,829 INFO L93 Difference]: Finished difference Result 1488 states and 2129 transitions. [2024-11-11 21:11:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:29,830 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2024-11-11 21:11:29,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:29,838 INFO L225 Difference]: With dead ends: 1488 [2024-11-11 21:11:29,839 INFO L226 Difference]: Without dead ends: 1486 [2024-11-11 21:11:29,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:11:29,840 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 263 mSDsluCounter, 2123 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:29,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2561 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-11 21:11:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1074. [2024-11-11 21:11:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 815 states have (on average 1.3680981595092025) internal successors, (1115), 822 states have internal predecessors, (1115), 174 states have call successors, (174), 84 states have call predecessors, (174), 84 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-11 21:11:29,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1463 transitions. [2024-11-11 21:11:29,931 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1463 transitions. Word has length 88 [2024-11-11 21:11:29,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:29,931 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1463 transitions. [2024-11-11 21:11:29,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 21:11:29,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1463 transitions. [2024-11-11 21:11:29,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 21:11:29,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:29,932 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] [2024-11-11 21:11:29,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:11:29,933 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:29,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1891908626, now seen corresponding path program 1 times [2024-11-11 21:11:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088236380] [2024-11-11 21:11:29,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 21:11:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,090 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:30,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:30,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088236380] [2024-11-11 21:11:30,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088236380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:30,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:30,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739749171] [2024-11-11 21:11:30,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:30,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:30,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:30,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:30,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:30,092 INFO L87 Difference]: Start difference. First operand 1074 states and 1463 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (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:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:30,207 INFO L93 Difference]: Finished difference Result 1999 states and 2744 transitions. [2024-11-11 21:11:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (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 89 [2024-11-11 21:11:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:30,215 INFO L225 Difference]: With dead ends: 1999 [2024-11-11 21:11:30,215 INFO L226 Difference]: Without dead ends: 1098 [2024-11-11 21:11:30,219 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:30,219 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 751 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:30,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 751 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:30,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2024-11-11 21:11:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 1098. [2024-11-11 21:11:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1098 states, 833 states have (on average 1.3601440576230492) internal successors, (1133), 840 states have internal predecessors, (1133), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2024-11-11 21:11:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1481 transitions. [2024-11-11 21:11:30,309 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1481 transitions. Word has length 89 [2024-11-11 21:11:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 1098 states and 1481 transitions. [2024-11-11 21:11:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (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:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1481 transitions. [2024-11-11 21:11:30,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-11 21:11:30,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:30,314 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] [2024-11-11 21:11:30,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:11:30,314 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:30,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:30,315 INFO L85 PathProgramCache]: Analyzing trace with hash -103126629, now seen corresponding path program 1 times [2024-11-11 21:11:30,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:30,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531568662] [2024-11-11 21:11:30,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:30,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:30,476 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:30,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:30,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531568662] [2024-11-11 21:11:30,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531568662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:30,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:30,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:30,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186852648] [2024-11-11 21:11:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:30,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:30,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:30,479 INFO L87 Difference]: Start difference. First operand 1098 states and 1481 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:30,706 INFO L93 Difference]: Finished difference Result 1978 states and 2670 transitions. [2024-11-11 21:11:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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 91 [2024-11-11 21:11:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:30,713 INFO L225 Difference]: With dead ends: 1978 [2024-11-11 21:11:30,714 INFO L226 Difference]: Without dead ends: 1135 [2024-11-11 21:11:30,716 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:30,716 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 249 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:30,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1461 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:30,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2024-11-11 21:11:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1101. [2024-11-11 21:11:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 847 states have (on average 1.3506493506493507) internal successors, (1144), 859 states have internal predecessors, (1144), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-11 21:11:30,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1468 transitions. [2024-11-11 21:11:30,795 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1468 transitions. Word has length 91 [2024-11-11 21:11:30,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:30,796 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1468 transitions. [2024-11-11 21:11:30,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 states have internal predecessors, (67), 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:30,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1468 transitions. [2024-11-11 21:11:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 21:11:30,797 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:30,797 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] [2024-11-11 21:11:30,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:11:30,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:30,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash 940479954, now seen corresponding path program 1 times [2024-11-11 21:11:30,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:30,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717154235] [2024-11-11 21:11:30,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:11:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:31,387 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:31,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:31,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717154235] [2024-11-11 21:11:31,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717154235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:31,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:31,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310605909] [2024-11-11 21:11:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:31,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:31,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:31,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:31,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:31,390 INFO L87 Difference]: Start difference. First operand 1101 states and 1468 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, (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:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:31,617 INFO L93 Difference]: Finished difference Result 1965 states and 2629 transitions. [2024-11-11 21:11:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:31,617 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, (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 93 [2024-11-11 21:11:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:31,623 INFO L225 Difference]: With dead ends: 1965 [2024-11-11 21:11:31,623 INFO L226 Difference]: Without dead ends: 1099 [2024-11-11 21:11:31,625 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:31,626 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 150 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:31,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1577 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:31,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-11-11 21:11:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 992. [2024-11-11 21:11:31,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 765 states have (on average 1.3529411764705883) internal successors, (1035), 775 states have internal predecessors, (1035), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-11 21:11:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1325 transitions. [2024-11-11 21:11:31,694 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1325 transitions. Word has length 93 [2024-11-11 21:11:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1325 transitions. [2024-11-11 21:11:31,695 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, (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:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1325 transitions. [2024-11-11 21:11:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 21:11:31,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:31,696 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] [2024-11-11 21:11:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 21:11:31,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash -393724703, now seen corresponding path program 1 times [2024-11-11 21:11:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:31,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159057587] [2024-11-11 21:11:31,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 21:11:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 21:11:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,182 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:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:32,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159057587] [2024-11-11 21:11:32,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159057587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:32,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:32,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:32,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044615565] [2024-11-11 21:11:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:32,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:32,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:32,184 INFO L87 Difference]: Start difference. First operand 992 states and 1325 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 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:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:32,613 INFO L93 Difference]: Finished difference Result 1896 states and 2516 transitions. [2024-11-11 21:11:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:11:32,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 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 94 [2024-11-11 21:11:32,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:32,620 INFO L225 Difference]: With dead ends: 1896 [2024-11-11 21:11:32,620 INFO L226 Difference]: Without dead ends: 1059 [2024-11-11 21:11:32,622 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:32,622 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 403 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:32,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1242 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:11:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-11-11 21:11:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1008. [2024-11-11 21:11:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 773 states have (on average 1.3298835705045278) internal successors, (1028), 784 states have internal predecessors, (1028), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-11 21:11:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1324 transitions. [2024-11-11 21:11:32,705 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1324 transitions. Word has length 94 [2024-11-11 21:11:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:32,706 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1324 transitions. [2024-11-11 21:11:32,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 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:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1324 transitions. [2024-11-11 21:11:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 21:11:32,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:32,707 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] [2024-11-11 21:11:32,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:11:32,707 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:32,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:32,708 INFO L85 PathProgramCache]: Analyzing trace with hash -284174634, now seen corresponding path program 1 times [2024-11-11 21:11:32,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:32,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911250925] [2024-11-11 21:11:32,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:32,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:11:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:11:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:11:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 21:11:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:11:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:32,811 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:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:32,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911250925] [2024-11-11 21:11:32,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911250925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:32,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:32,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337288208] [2024-11-11 21:11:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:32,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:32,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:32,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:32,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:32,814 INFO L87 Difference]: Start difference. First operand 1008 states and 1324 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:33,023 INFO L93 Difference]: Finished difference Result 2661 states and 3518 transitions. [2024-11-11 21:11:33,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:33,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 95 [2024-11-11 21:11:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:33,047 INFO L225 Difference]: With dead ends: 2661 [2024-11-11 21:11:33,048 INFO L226 Difference]: Without dead ends: 1859 [2024-11-11 21:11:33,050 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:33,050 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 199 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1131 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:33,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1131 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:33,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2024-11-11 21:11:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1744. [2024-11-11 21:11:33,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1744 states, 1319 states have (on average 1.3237300985595148) internal successors, (1746), 1338 states have internal predecessors, (1746), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272) [2024-11-11 21:11:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1744 states to 1744 states and 2290 transitions. [2024-11-11 21:11:33,207 INFO L78 Accepts]: Start accepts. Automaton has 1744 states and 2290 transitions. Word has length 95 [2024-11-11 21:11:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:33,207 INFO L471 AbstractCegarLoop]: Abstraction has 1744 states and 2290 transitions. [2024-11-11 21:11:33,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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:33,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1744 states and 2290 transitions. [2024-11-11 21:11:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 21:11:33,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:33,209 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:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 21:11:33,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:33,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1869830197, now seen corresponding path program 1 times [2024-11-11 21:11:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941801009] [2024-11-11 21:11:33,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:33,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:11:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:11:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:11:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 21:11:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 21:11:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:33,810 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:33,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:33,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941801009] [2024-11-11 21:11:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941801009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:33,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:33,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46907324] [2024-11-11 21:11:33,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:33,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:33,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:33,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:33,813 INFO L87 Difference]: Start difference. First operand 1744 states and 2290 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 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:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:34,434 INFO L93 Difference]: Finished difference Result 3400 states and 4460 transitions. [2024-11-11 21:11:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:11:34,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 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 97 [2024-11-11 21:11:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:34,445 INFO L225 Difference]: With dead ends: 3400 [2024-11-11 21:11:34,446 INFO L226 Difference]: Without dead ends: 1940 [2024-11-11 21:11:34,450 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:34,451 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 513 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:34,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 1407 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:11:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-11-11 21:11:34,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1771. [2024-11-11 21:11:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1333 states have (on average 1.3173293323330832) internal successors, (1756), 1353 states have internal predecessors, (1756), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-11 21:11:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2316 transitions. [2024-11-11 21:11:34,655 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2316 transitions. Word has length 97 [2024-11-11 21:11:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:34,655 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2316 transitions. [2024-11-11 21:11:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 6 states have internal predecessors, (74), 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:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2316 transitions. [2024-11-11 21:11:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 21:11:34,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:34,657 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:34,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 21:11:34,658 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:34,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:34,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1876171216, now seen corresponding path program 1 times [2024-11-11 21:11:34,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:34,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957490222] [2024-11-11 21:11:34,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:34,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:11:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:11:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:11:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:11:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:11:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:11:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:34,763 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:34,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:34,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957490222] [2024-11-11 21:11:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957490222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241709056] [2024-11-11 21:11:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:34,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:34,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:34,766 INFO L87 Difference]: Start difference. First operand 1771 states and 2316 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:35,054 INFO L93 Difference]: Finished difference Result 4501 states and 5920 transitions. [2024-11-11 21:11:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 99 [2024-11-11 21:11:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:35,070 INFO L225 Difference]: With dead ends: 4501 [2024-11-11 21:11:35,071 INFO L226 Difference]: Without dead ends: 3057 [2024-11-11 21:11:35,075 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:35,075 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 205 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1169 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:35,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1169 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:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-11-11 21:11:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 2782. [2024-11-11 21:11:35,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2782 states, 2069 states have (on average 1.3083615273078781) internal successors, (2707), 2100 states have internal predecessors, (2707), 460 states have call successors, (460), 252 states have call predecessors, (460), 252 states have return successors, (460), 429 states have call predecessors, (460), 460 states have call successors, (460) [2024-11-11 21:11:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2782 states to 2782 states and 3627 transitions. [2024-11-11 21:11:35,391 INFO L78 Accepts]: Start accepts. Automaton has 2782 states and 3627 transitions. Word has length 99 [2024-11-11 21:11:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:35,392 INFO L471 AbstractCegarLoop]: Abstraction has 2782 states and 3627 transitions. [2024-11-11 21:11:35,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2782 states and 3627 transitions. [2024-11-11 21:11:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 21:11:35,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:35,395 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:35,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:11:35,396 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:35,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:35,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1671410112, now seen corresponding path program 1 times [2024-11-11 21:11:35,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:35,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024910826] [2024-11-11 21:11:35,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:35,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:11:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:11:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:11:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:11:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:11:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:11:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:35,508 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:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:35,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024910826] [2024-11-11 21:11:35,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024910826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:35,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:35,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46701003] [2024-11-11 21:11:35,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:35,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:35,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:35,511 INFO L87 Difference]: Start difference. First operand 2782 states and 3627 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:35,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:35,927 INFO L93 Difference]: Finished difference Result 6508 states and 8524 transitions. [2024-11-11 21:11:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 99 [2024-11-11 21:11:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:35,953 INFO L225 Difference]: With dead ends: 6508 [2024-11-11 21:11:35,953 INFO L226 Difference]: Without dead ends: 4169 [2024-11-11 21:11:35,961 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:35,962 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 198 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1181 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:35,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1181 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:35,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2024-11-11 21:11:36,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 3988. [2024-11-11 21:11:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 2951 states have (on average 1.3049813622500848) internal successors, (3851), 2995 states have internal predecessors, (3851), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-11 21:11:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 5195 transitions. [2024-11-11 21:11:36,542 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 5195 transitions. Word has length 99 [2024-11-11 21:11:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:36,543 INFO L471 AbstractCegarLoop]: Abstraction has 3988 states and 5195 transitions. [2024-11-11 21:11:36,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 5195 transitions. [2024-11-11 21:11:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 21:11:36,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:36,547 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] [2024-11-11 21:11:36,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:11:36,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:36,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -275000023, now seen corresponding path program 1 times [2024-11-11 21:11:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:36,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114748846] [2024-11-11 21:11:36,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:36,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:11:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:11:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:11:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:11:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:11:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:11:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:11:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:36,635 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:36,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:36,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114748846] [2024-11-11 21:11:36,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114748846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:36,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:36,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:36,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644802606] [2024-11-11 21:11:36,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:36,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:36,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:36,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:36,638 INFO L87 Difference]: Start difference. First operand 3988 states and 5195 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:37,044 INFO L93 Difference]: Finished difference Result 7667 states and 10033 transitions. [2024-11-11 21:11:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:37,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 100 [2024-11-11 21:11:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:37,068 INFO L225 Difference]: With dead ends: 7667 [2024-11-11 21:11:37,069 INFO L226 Difference]: Without dead ends: 4021 [2024-11-11 21:11:37,077 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:37,078 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:37,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 481 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2024-11-11 21:11:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 3994. [2024-11-11 21:11:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3994 states, 2957 states have (on average 1.3043625295908015) internal successors, (3857), 3001 states have internal predecessors, (3857), 672 states have call successors, (672), 364 states have call predecessors, (672), 364 states have return successors, (672), 628 states have call predecessors, (672), 672 states have call successors, (672) [2024-11-11 21:11:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3994 states to 3994 states and 5201 transitions. [2024-11-11 21:11:37,462 INFO L78 Accepts]: Start accepts. Automaton has 3994 states and 5201 transitions. Word has length 100 [2024-11-11 21:11:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:37,463 INFO L471 AbstractCegarLoop]: Abstraction has 3994 states and 5201 transitions. [2024-11-11 21:11:37,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3994 states and 5201 transitions. [2024-11-11 21:11:37,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 21:11:37,465 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:37,466 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:37,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:11:37,466 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:37,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2124726715, now seen corresponding path program 1 times [2024-11-11 21:11:37,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:37,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279894170] [2024-11-11 21:11:37,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:11:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 21:11:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 21:11:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 21:11:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 21:11:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:11:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:37,617 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:37,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:37,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279894170] [2024-11-11 21:11:37,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279894170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:37,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:37,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:37,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528355439] [2024-11-11 21:11:37,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:37,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:37,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:37,621 INFO L87 Difference]: Start difference. First operand 3994 states and 5201 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 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:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:37,997 INFO L93 Difference]: Finished difference Result 7632 states and 9960 transitions. [2024-11-11 21:11:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:37,997 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), 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:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:38,031 INFO L225 Difference]: With dead ends: 7632 [2024-11-11 21:11:38,035 INFO L226 Difference]: Without dead ends: 3710 [2024-11-11 21:11:38,049 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:38,050 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 79 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:38,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 730 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2024-11-11 21:11:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3647. [2024-11-11 21:11:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3647 states, 2693 states have (on average 1.3134051243965836) internal successors, (3537), 2727 states have internal predecessors, (3537), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-11 21:11:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3647 states to 3647 states and 4777 transitions. [2024-11-11 21:11:38,435 INFO L78 Accepts]: Start accepts. Automaton has 3647 states and 4777 transitions. Word has length 101 [2024-11-11 21:11:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:38,436 INFO L471 AbstractCegarLoop]: Abstraction has 3647 states and 4777 transitions. [2024-11-11 21:11:38,436 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), 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:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 3647 states and 4777 transitions. [2024-11-11 21:11:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 21:11:38,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:38,438 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:38,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:11:38,438 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:38,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -425938695, now seen corresponding path program 1 times [2024-11-11 21:11:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106325043] [2024-11-11 21:11:38,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:11:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:11:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:11:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:11:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:11:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:11:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:11:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:38,515 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:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106325043] [2024-11-11 21:11:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106325043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:38,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:38,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:11:38,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602741399] [2024-11-11 21:11:38,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:38,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:11:38,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:38,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:11:38,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:11:38,518 INFO L87 Difference]: Start difference. First operand 3647 states and 4777 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:38,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:38,838 INFO L93 Difference]: Finished difference Result 7170 states and 9430 transitions. [2024-11-11 21:11:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:11:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:38,862 INFO L225 Difference]: With dead ends: 7170 [2024-11-11 21:11:38,862 INFO L226 Difference]: Without dead ends: 3698 [2024-11-11 21:11:38,874 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:38,875 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 6 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:38,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 479 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2024-11-11 21:11:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3657. [2024-11-11 21:11:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3657 states, 2703 states have (on average 1.3122456529781723) internal successors, (3547), 2737 states have internal predecessors, (3547), 620 states have call successors, (620), 333 states have call predecessors, (620), 333 states have return successors, (620), 586 states have call predecessors, (620), 620 states have call successors, (620) [2024-11-11 21:11:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3657 states to 3657 states and 4787 transitions. [2024-11-11 21:11:39,341 INFO L78 Accepts]: Start accepts. Automaton has 3657 states and 4787 transitions. Word has length 102 [2024-11-11 21:11:39,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:39,342 INFO L471 AbstractCegarLoop]: Abstraction has 3657 states and 4787 transitions. [2024-11-11 21:11:39,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3657 states and 4787 transitions. [2024-11-11 21:11:39,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 21:11:39,344 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:39,344 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:39,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:11:39,345 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:39,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:39,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1786405918, now seen corresponding path program 1 times [2024-11-11 21:11:39,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:39,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115802058] [2024-11-11 21:11:39,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:39,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 21:11:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:11:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 21:11:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 21:11:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 21:11:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 21:11:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:11:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:39,527 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:39,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:39,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115802058] [2024-11-11 21:11:39,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115802058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:39,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:39,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:11:39,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377034573] [2024-11-11 21:11:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:39,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:11:39,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:39,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:11:39,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:11:39,531 INFO L87 Difference]: Start difference. First operand 3657 states and 4787 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:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:40,000 INFO L93 Difference]: Finished difference Result 7121 states and 9341 transitions. [2024-11-11 21:11:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:11:40,001 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:40,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:40,025 INFO L225 Difference]: With dead ends: 7121 [2024-11-11 21:11:40,026 INFO L226 Difference]: Without dead ends: 3579 [2024-11-11 21:11:40,039 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:40,040 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 60 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:40,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 740 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:40,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2024-11-11 21:11:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 2751. [2024-11-11 21:11:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2751 states, 2031 states have (on average 1.3047759724273758) internal successors, (2650), 2050 states have internal predecessors, (2650), 469 states have call successors, (469), 250 states have call predecessors, (469), 250 states have return successors, (469), 450 states have call predecessors, (469), 469 states have call successors, (469) [2024-11-11 21:11:40,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 3588 transitions. [2024-11-11 21:11:40,407 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 3588 transitions. Word has length 102 [2024-11-11 21:11:40,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:40,407 INFO L471 AbstractCegarLoop]: Abstraction has 2751 states and 3588 transitions. [2024-11-11 21:11:40,408 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:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 3588 transitions. [2024-11-11 21:11:40,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-11 21:11:40,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:40,413 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] [2024-11-11 21:11:40,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-11 21:11:40,413 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:40,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1492707530, now seen corresponding path program 1 times [2024-11-11 21:11:40,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:40,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235537579] [2024-11-11 21:11:40,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:40,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:11:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 21:11:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 21:11:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 21:11:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 21:11:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 21:11:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:11:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 21:11:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 21:11:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 21:11:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 21:11:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 21:11:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 21:11:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:40,849 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:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235537579] [2024-11-11 21:11:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235537579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289130279] [2024-11-11 21:11:40,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:40,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:11:40,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:40,852 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:40,854 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:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:41,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-11 21:11:41,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:11:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-11 21:11:41,213 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:11:41,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289130279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:41,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:11:41,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2024-11-11 21:11:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929609705] [2024-11-11 21:11:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:41,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:11:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:11:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:11:41,215 INFO L87 Difference]: Start difference. First operand 2751 states and 3588 transitions. Second operand has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 21:11:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:41,460 INFO L93 Difference]: Finished difference Result 5180 states and 6794 transitions. [2024-11-11 21:11:41,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:11:41,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 151 [2024-11-11 21:11:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:41,476 INFO L225 Difference]: With dead ends: 5180 [2024-11-11 21:11:41,476 INFO L226 Difference]: Without dead ends: 2584 [2024-11-11 21:11:41,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:11:41,485 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:41,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1004 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:11:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2584 states. [2024-11-11 21:11:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2584 to 2569. [2024-11-11 21:11:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2569 states, 1894 states have (on average 1.3009503695881732) internal successors, (2464), 1911 states have internal predecessors, (2464), 440 states have call successors, (440), 234 states have call predecessors, (440), 234 states have return successors, (440), 423 states have call predecessors, (440), 440 states have call successors, (440) [2024-11-11 21:11:41,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 3344 transitions. [2024-11-11 21:11:41,741 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 3344 transitions. Word has length 151 [2024-11-11 21:11:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:41,742 INFO L471 AbstractCegarLoop]: Abstraction has 2569 states and 3344 transitions. [2024-11-11 21:11:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 25.0) internal successors, (100), 5 states have internal predecessors, (100), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 21:11:41,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 3344 transitions. [2024-11-11 21:11:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-11 21:11:41,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:41,747 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] [2024-11-11 21:11:41,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 21:11:41,950 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,SelfDestructingSolverStorable26 [2024-11-11 21:11:41,951 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:41,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash 433320110, now seen corresponding path program 1 times [2024-11-11 21:11:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346502647] [2024-11-11 21:11:41,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:42,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 21:11:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 21:11:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 21:11:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 21:11:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 21:11:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 21:11:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 21:11:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:11:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 21:11:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 21:11:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:11:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 21:11:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,737 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:42,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346502647] [2024-11-11 21:11:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346502647] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043908476] [2024-11-11 21:11:42,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:11:42,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:42,740 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:42,741 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:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:42,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 21:11:42,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:11:43,309 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:43,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:11:43,640 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:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043908476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:11:43,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:11:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 23 [2024-11-11 21:11:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783340716] [2024-11-11 21:11:43,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:11:43,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:11:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:11:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:11:43,643 INFO L87 Difference]: Start difference. First operand 2569 states and 3344 transitions. Second operand has 23 states, 23 states have (on average 10.043478260869565) internal successors, (231), 20 states have internal predecessors, (231), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-11 21:11:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:45,504 INFO L93 Difference]: Finished difference Result 7265 states and 9491 transitions. [2024-11-11 21:11:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 21:11:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.043478260869565) internal successors, (231), 20 states have internal predecessors, (231), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) Word has length 153 [2024-11-11 21:11:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:45,534 INFO L225 Difference]: With dead ends: 7265 [2024-11-11 21:11:45,534 INFO L226 Difference]: Without dead ends: 4920 [2024-11-11 21:11:45,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=360, Invalid=1532, Unknown=0, NotChecked=0, Total=1892 [2024-11-11 21:11:45,542 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 1112 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 3975 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:45,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 3975 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 21:11:45,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2024-11-11 21:11:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4400. [2024-11-11 21:11:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4400 states, 3244 states have (on average 1.3030209617755857) internal successors, (4227), 3272 states have internal predecessors, (4227), 751 states have call successors, (751), 404 states have call predecessors, (751), 404 states have return successors, (751), 723 states have call predecessors, (751), 751 states have call successors, (751) [2024-11-11 21:11:45,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 5729 transitions. [2024-11-11 21:11:45,991 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 5729 transitions. Word has length 153 [2024-11-11 21:11:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:45,992 INFO L471 AbstractCegarLoop]: Abstraction has 4400 states and 5729 transitions. [2024-11-11 21:11:45,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.043478260869565) internal successors, (231), 20 states have internal predecessors, (231), 8 states have call successors, (40), 4 states have call predecessors, (40), 8 states have return successors, (39), 11 states have call predecessors, (39), 8 states have call successors, (39) [2024-11-11 21:11:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 5729 transitions. [2024-11-11 21:11:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-11 21:11:46,000 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:46,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,022 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:46,200 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,SelfDestructingSolverStorable27 [2024-11-11 21:11:46,201 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:46,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:46,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1655848050, now seen corresponding path program 1 times [2024-11-11 21:11:46,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:46,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776839932] [2024-11-11 21:11:46,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:46,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 21:11:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 21:11:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 21:11:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 21:11:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 21:11:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 21:11:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-11 21:11:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-11 21:11:47,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776839932] [2024-11-11 21:11:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776839932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:11:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639038661] [2024-11-11 21:11:47,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:11:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:11:47,009 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:47,015 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:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:47,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-11 21:11:47,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:11:48,097 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 61 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:11:48,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:11:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:11:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639038661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:11:48,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:11:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2024-11-11 21:11:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871958012] [2024-11-11 21:11:48,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:11:48,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-11 21:11:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:48,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-11 21:11:48,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2024-11-11 21:11:48,927 INFO L87 Difference]: Start difference. First operand 4400 states and 5729 transitions. Second operand has 27 states, 26 states have (on average 9.346153846153847) internal successors, (243), 25 states have internal predecessors, (243), 9 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-11 21:11:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:54,638 INFO L93 Difference]: Finished difference Result 12614 states and 16333 transitions. [2024-11-11 21:11:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-11 21:11:54,639 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 9.346153846153847) internal successors, (243), 25 states have internal predecessors, (243), 9 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) Word has length 154 [2024-11-11 21:11:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:54,676 INFO L225 Difference]: With dead ends: 12614 [2024-11-11 21:11:54,676 INFO L226 Difference]: Without dead ends: 8443 [2024-11-11 21:11:54,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1407, Invalid=6603, Unknown=0, NotChecked=0, Total=8010 [2024-11-11 21:11:54,691 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 2412 mSDsluCounter, 3533 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 930 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2412 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:54,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2412 Valid, 3820 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 21:11:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8443 states. [2024-11-11 21:11:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8443 to 5696. [2024-11-11 21:11:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5696 states, 4202 states have (on average 1.2955735364112329) internal successors, (5444), 4240 states have internal predecessors, (5444), 956 states have call successors, (956), 537 states have call predecessors, (956), 537 states have return successors, (956), 918 states have call predecessors, (956), 956 states have call successors, (956) [2024-11-11 21:11:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5696 states to 5696 states and 7356 transitions. [2024-11-11 21:11:55,578 INFO L78 Accepts]: Start accepts. Automaton has 5696 states and 7356 transitions. Word has length 154 [2024-11-11 21:11:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:55,579 INFO L471 AbstractCegarLoop]: Abstraction has 5696 states and 7356 transitions. [2024-11-11 21:11:55,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 9.346153846153847) internal successors, (243), 25 states have internal predecessors, (243), 9 states have call successors, (37), 5 states have call predecessors, (37), 8 states have return successors, (36), 10 states have call predecessors, (36), 9 states have call successors, (36) [2024-11-11 21:11:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5696 states and 7356 transitions. [2024-11-11 21:11:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-11 21:11:55,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:55,588 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, 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] [2024-11-11 21:11:55,608 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:11:55,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-11 21:11:55,790 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash -504395865, now seen corresponding path program 1 times [2024-11-11 21:11:55,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:55,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541010459] [2024-11-11 21:11:55,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:55,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:11:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:11:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:11:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:11:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:11:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:11:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:11:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:11:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:11:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 21:11:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 21:11:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 21:11:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:11:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 21:11:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 21:11:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:11:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-11 21:11:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:11:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541010459] [2024-11-11 21:11:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541010459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:11:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:11:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:11:56,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228274758] [2024-11-11 21:11:56,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:11:56,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:11:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:11:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:11:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:11:56,147 INFO L87 Difference]: Start difference. First operand 5696 states and 7356 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:11:57,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:11:57,953 INFO L93 Difference]: Finished difference Result 16352 states and 21240 transitions. [2024-11-11 21:11:57,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 21:11:57,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 164 [2024-11-11 21:11:57,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:11:58,003 INFO L225 Difference]: With dead ends: 16352 [2024-11-11 21:11:58,004 INFO L226 Difference]: Without dead ends: 11120 [2024-11-11 21:11:58,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:11:58,021 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 219 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:11:58,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 2526 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:11:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11120 states. [2024-11-11 21:11:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11120 to 7934. [2024-11-11 21:11:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7934 states, 5814 states have (on average 1.2961816305469556) internal successors, (7536), 5868 states have internal predecessors, (7536), 1374 states have call successors, (1374), 745 states have call predecessors, (1374), 745 states have return successors, (1374), 1320 states have call predecessors, (1374), 1374 states have call successors, (1374) [2024-11-11 21:11:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 10284 transitions. [2024-11-11 21:11:59,225 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 10284 transitions. Word has length 164 [2024-11-11 21:11:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:11:59,226 INFO L471 AbstractCegarLoop]: Abstraction has 7934 states and 10284 transitions. [2024-11-11 21:11:59,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 6 states have internal predecessors, (92), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:11:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 10284 transitions. [2024-11-11 21:11:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-11 21:11:59,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:11:59,238 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:11:59,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-11 21:11:59,239 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:11:59,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:11:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash 357408359, now seen corresponding path program 1 times [2024-11-11 21:11:59,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:11:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280854827] [2024-11-11 21:11:59,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:11:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:11:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:12:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:12:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:12:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:12:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:12:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:12:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 21:12:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:12:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 21:12:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 21:12:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 21:12:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 21:12:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 21:12:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 21:12:00,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280854827] [2024-11-11 21:12:00,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280854827] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:00,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358422865] [2024-11-11 21:12:00,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:00,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:00,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:00,314 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:00,315 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:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-11 21:12:00,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:01,056 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:12:01,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 20 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 21:12:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358422865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:02,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:02,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 10] total 26 [2024-11-11 21:12:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092658228] [2024-11-11 21:12:02,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:02,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 21:12:02,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:02,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 21:12:02,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-11 21:12:02,056 INFO L87 Difference]: Start difference. First operand 7934 states and 10284 transitions. Second operand has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 26 states have internal predecessors, (238), 8 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2024-11-11 21:12:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:05,342 INFO L93 Difference]: Finished difference Result 17703 states and 23014 transitions. [2024-11-11 21:12:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-11 21:12:05,343 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 26 states have internal predecessors, (238), 8 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) Word has length 164 [2024-11-11 21:12:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:05,385 INFO L225 Difference]: With dead ends: 17703 [2024-11-11 21:12:05,385 INFO L226 Difference]: Without dead ends: 10192 [2024-11-11 21:12:05,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2024-11-11 21:12:05,404 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1726 mSDsluCounter, 2916 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:05,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1726 Valid, 3387 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 21:12:05,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10192 states. [2024-11-11 21:12:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10192 to 9423. [2024-11-11 21:12:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9423 states, 6924 states have (on average 1.2939052570768341) internal successors, (8959), 6990 states have internal predecessors, (8959), 1614 states have call successors, (1614), 884 states have call predecessors, (1614), 884 states have return successors, (1614), 1548 states have call predecessors, (1614), 1614 states have call successors, (1614) [2024-11-11 21:12:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9423 states to 9423 states and 12187 transitions. [2024-11-11 21:12:06,823 INFO L78 Accepts]: Start accepts. Automaton has 9423 states and 12187 transitions. Word has length 164 [2024-11-11 21:12:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 9423 states and 12187 transitions. [2024-11-11 21:12:06,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 26 states have internal predecessors, (238), 8 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (31), 8 states have call predecessors, (31), 8 states have call successors, (31) [2024-11-11 21:12:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 9423 states and 12187 transitions. [2024-11-11 21:12:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 21:12:06,834 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:06,834 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, 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] [2024-11-11 21:12:06,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:07,035 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:07,035 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2078287030, now seen corresponding path program 1 times [2024-11-11 21:12:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143423052] [2024-11-11 21:12:07,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:08,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:12:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:12:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:12:08,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:12:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:12:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:12:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 21:12:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 21:12:08,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:12:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 21:12:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:12:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:12:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 21:12:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 21:12:08,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143423052] [2024-11-11 21:12:08,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143423052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:08,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881803458] [2024-11-11 21:12:08,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:08,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:08,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:08,478 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:08,479 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:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:08,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 21:12:08,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 57 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:12:09,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 21:12:09,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881803458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:09,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:09,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 20 [2024-11-11 21:12:09,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644498032] [2024-11-11 21:12:09,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:09,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 21:12:09,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:09,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 21:12:09,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-11 21:12:09,284 INFO L87 Difference]: Start difference. First operand 9423 states and 12187 transitions. Second operand has 20 states, 20 states have (on average 11.85) internal successors, (237), 20 states have internal predecessors, (237), 8 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-11 21:12:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:12,715 INFO L93 Difference]: Finished difference Result 19692 states and 25540 transitions. [2024-11-11 21:12:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 21:12:12,715 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.85) internal successors, (237), 20 states have internal predecessors, (237), 8 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) Word has length 165 [2024-11-11 21:12:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:12,757 INFO L225 Difference]: With dead ends: 19692 [2024-11-11 21:12:12,758 INFO L226 Difference]: Without dead ends: 10691 [2024-11-11 21:12:12,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=439, Invalid=2213, Unknown=0, NotChecked=0, Total=2652 [2024-11-11 21:12:12,780 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 1493 mSDsluCounter, 4425 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:12,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 4965 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 21:12:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10691 states. [2024-11-11 21:12:14,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10691 to 10150. [2024-11-11 21:12:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10150 states, 7473 states have (on average 1.2909139569115482) internal successors, (9647), 7543 states have internal predecessors, (9647), 1721 states have call successors, (1721), 955 states have call predecessors, (1721), 955 states have return successors, (1721), 1651 states have call predecessors, (1721), 1721 states have call successors, (1721) [2024-11-11 21:12:14,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10150 states to 10150 states and 13089 transitions. [2024-11-11 21:12:14,449 INFO L78 Accepts]: Start accepts. Automaton has 10150 states and 13089 transitions. Word has length 165 [2024-11-11 21:12:14,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:14,449 INFO L471 AbstractCegarLoop]: Abstraction has 10150 states and 13089 transitions. [2024-11-11 21:12:14,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.85) internal successors, (237), 20 states have internal predecessors, (237), 8 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (40), 8 states have call predecessors, (40), 8 states have call successors, (40) [2024-11-11 21:12:14,449 INFO L276 IsEmpty]: Start isEmpty. Operand 10150 states and 13089 transitions. [2024-11-11 21:12:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 21:12:14,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:14,459 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:14,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 21:12:14,660 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:14,660 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:14,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash 102433438, now seen corresponding path program 1 times [2024-11-11 21:12:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:14,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691999729] [2024-11-11 21:12:14,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 21:12:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 21:12:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 21:12:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 21:12:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 21:12:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 21:12:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 21:12:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 21:12:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 21:12:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 21:12:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 21:12:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 21:12:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-11 21:12:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 21:12:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691999729] [2024-11-11 21:12:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691999729] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125214592] [2024-11-11 21:12:15,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:15,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:15,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:15,270 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:15,272 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:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:15,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-11 21:12:15,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 71 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-11 21:12:15,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-11 21:12:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125214592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:16,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 18 [2024-11-11 21:12:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309685492] [2024-11-11 21:12:16,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 21:12:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:16,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 21:12:16,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-11 21:12:16,220 INFO L87 Difference]: Start difference. First operand 10150 states and 13089 transitions. Second operand has 18 states, 18 states have (on average 11.88888888888889) internal successors, (214), 18 states have internal predecessors, (214), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2024-11-11 21:12:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:18,883 INFO L93 Difference]: Finished difference Result 22230 states and 28765 transitions. [2024-11-11 21:12:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 21:12:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.88888888888889) internal successors, (214), 18 states have internal predecessors, (214), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) Word has length 165 [2024-11-11 21:12:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:18,939 INFO L225 Difference]: With dead ends: 22230 [2024-11-11 21:12:18,940 INFO L226 Difference]: Without dead ends: 12509 [2024-11-11 21:12:18,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=992, Unknown=0, NotChecked=0, Total=1260 [2024-11-11 21:12:18,966 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 1207 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:18,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 2168 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 21:12:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12509 states. [2024-11-11 21:12:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12509 to 12235. [2024-11-11 21:12:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12235 states, 8979 states have (on average 1.2932397817128856) internal successors, (11612), 9068 states have internal predecessors, (11612), 2096 states have call successors, (2096), 1159 states have call predecessors, (2096), 1159 states have return successors, (2096), 2007 states have call predecessors, (2096), 2096 states have call successors, (2096) [2024-11-11 21:12:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12235 states to 12235 states and 15804 transitions. [2024-11-11 21:12:21,530 INFO L78 Accepts]: Start accepts. Automaton has 12235 states and 15804 transitions. Word has length 165 [2024-11-11 21:12:21,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:21,531 INFO L471 AbstractCegarLoop]: Abstraction has 12235 states and 15804 transitions. [2024-11-11 21:12:21,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.88888888888889) internal successors, (214), 18 states have internal predecessors, (214), 7 states have call successors, (32), 5 states have call predecessors, (32), 6 states have return successors, (31), 7 states have call predecessors, (31), 7 states have call successors, (31) [2024-11-11 21:12:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 12235 states and 15804 transitions. [2024-11-11 21:12:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 21:12:21,539 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:21,539 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, 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:12:21,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 21:12:21,740 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:21,741 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:21,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1346805712, now seen corresponding path program 1 times [2024-11-11 21:12:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101307104] [2024-11-11 21:12:21,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:12:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:12:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:12:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:12:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:12:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:12:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:12:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 21:12:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 21:12:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 21:12:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 21:12:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 21:12:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 21:12:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:12:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 21:12:22,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101307104] [2024-11-11 21:12:22,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101307104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:22,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422680646] [2024-11-11 21:12:22,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:22,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:22,029 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:22,030 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:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 21:12:22,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 47 proven. 4 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-11 21:12:22,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 21:12:22,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422680646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:22,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:22,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2024-11-11 21:12:22,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876984869] [2024-11-11 21:12:22,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:22,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:12:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:22,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:12:22,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:12:22,462 INFO L87 Difference]: Start difference. First operand 12235 states and 15804 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-11 21:12:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,398 INFO L93 Difference]: Finished difference Result 24542 states and 31660 transitions. [2024-11-11 21:12:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:12:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) Word has length 166 [2024-11-11 21:12:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,453 INFO L225 Difference]: With dead ends: 24542 [2024-11-11 21:12:24,453 INFO L226 Difference]: Without dead ends: 12515 [2024-11-11 21:12:24,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:12:24,480 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 73 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1673 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12515 states. [2024-11-11 21:12:26,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12515 to 12235. [2024-11-11 21:12:26,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12235 states, 8979 states have (on average 1.2927942978059919) internal successors, (11608), 9068 states have internal predecessors, (11608), 2096 states have call successors, (2096), 1159 states have call predecessors, (2096), 1159 states have return successors, (2096), 2007 states have call predecessors, (2096), 2096 states have call successors, (2096) [2024-11-11 21:12:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12235 states to 12235 states and 15800 transitions. [2024-11-11 21:12:26,622 INFO L78 Accepts]: Start accepts. Automaton has 12235 states and 15800 transitions. Word has length 166 [2024-11-11 21:12:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:26,623 INFO L471 AbstractCegarLoop]: Abstraction has 12235 states and 15800 transitions. [2024-11-11 21:12:26,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 8 states have internal predecessors, (143), 3 states have call successors, (28), 4 states have call predecessors, (28), 7 states have return successors, (29), 4 states have call predecessors, (29), 3 states have call successors, (29) [2024-11-11 21:12:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 12235 states and 15800 transitions. [2024-11-11 21:12:26,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-11 21:12:26,629 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:26,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:26,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:26,830 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:26,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:26,830 INFO L85 PathProgramCache]: Analyzing trace with hash -511519232, now seen corresponding path program 1 times [2024-11-11 21:12:26,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:26,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532960997] [2024-11-11 21:12:26,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 21:12:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 21:12:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 21:12:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 21:12:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 21:12:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 21:12:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 21:12:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 21:12:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 21:12:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 21:12:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 21:12:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-11 21:12:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 21:12:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 21:12:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-11 21:12:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-11 21:12:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,581 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:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532960997] [2024-11-11 21:12:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532960997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582394420] [2024-11-11 21:12:27,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:27,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:27,584 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:27,585 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:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-11 21:12:27,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:27,968 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:27,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:28,275 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:28,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582394420] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:28,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:28,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10] total 23 [2024-11-11 21:12:28,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140859313] [2024-11-11 21:12:28,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:28,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 21:12:28,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:28,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 21:12:28,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2024-11-11 21:12:28,278 INFO L87 Difference]: Start difference. First operand 12235 states and 15800 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)