./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.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_Triplicated.2.ufo.BOUNDED-10.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 21:12:12,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 21:12:12,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 21:12:12,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 21:12:12,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 21:12:12,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 21:12:12,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 21:12:12,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 21:12:12,917 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 21:12:12,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 21:12:12,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 21:12:12,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 21:12:12,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 21:12:12,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 21:12:12,923 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 21:12:12,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 21:12:12,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 21:12:12,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 21:12:12,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 21:12:12,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 21:12:12,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 21:12:12,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 21:12:12,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 21:12:12,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 21:12:12,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 21:12:12,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 21:12:12,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 21:12:12,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 21:12:12,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 21:12:12,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 21:12:12,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 21:12:12,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 21:12:12,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:12,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 21:12:12,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 21:12:12,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 21:12:12,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 21:12:12,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 21:12:12,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 21:12:12,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 21:12:12,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 21:12:12,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 21:12:12,933 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 -> 77d80771821c1cd45088b62d9d16474928a377618be5caefce4c7c3ebfdda084 [2024-11-11 21:12:13,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 21:12:13,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 21:12:13,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 21:12:13,221 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 21:12:13,222 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 21:12:13,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-11 21:12:14,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 21:12:14,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 21:12:14,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-11 21:12:14,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618e92531/dee9b48ce0eb410c9df9f6b81ac37b98/FLAGc83efc000 [2024-11-11 21:12:14,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/618e92531/dee9b48ce0eb410c9df9f6b81ac37b98 [2024-11-11 21:12:14,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 21:12:14,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 21:12:14,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:14,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 21:12:14,901 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 21:12:14,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:14" (1/1) ... [2024-11-11 21:12:14,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5a8652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:14, skipping insertion in model container [2024-11-11 21:12:14,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 09:12:14" (1/1) ... [2024-11-11 21:12:14,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 21:12:15,194 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_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2024-11-11 21:12:15,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:15,232 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 21:12:15,315 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_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2024-11-11 21:12:15,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 21:12:15,332 INFO L204 MainTranslator]: Completed translation [2024-11-11 21:12:15,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15 WrapperNode [2024-11-11 21:12:15,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 21:12:15,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:15,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 21:12:15,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 21:12:15,341 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:12:15" (1/1) ... [2024-11-11 21:12:15,352 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:12:15" (1/1) ... [2024-11-11 21:12:15,389 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 424 [2024-11-11 21:12:15,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 21:12:15,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 21:12:15,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 21:12:15,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 21:12:15,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,450 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:12:15,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 21:12:15,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 21:12:15,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 21:12:15,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 21:12:15,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (1/1) ... [2024-11-11 21:12:15,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 21:12:15,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:15,512 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:12:15,515 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:12:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 21:12:15,562 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-11 21:12:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-11 21:12:15,563 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-11 21:12:15,563 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-11 21:12:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-11 21:12:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-11 21:12:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-11 21:12:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-11 21:12:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-11 21:12:15,564 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-11 21:12:15,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 21:12:15,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 21:12:15,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 21:12:15,674 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 21:12:15,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 21:12:16,184 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-11 21:12:16,185 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 21:12:16,200 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 21:12:16,201 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 21:12:16,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:16 BoogieIcfgContainer [2024-11-11 21:12:16,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 21:12:16,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 21:12:16,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 21:12:16,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 21:12:16,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 09:12:14" (1/3) ... [2024-11-11 21:12:16,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f45dfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:16, skipping insertion in model container [2024-11-11 21:12:16,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 09:12:15" (2/3) ... [2024-11-11 21:12:16,210 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f45dfb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 09:12:16, skipping insertion in model container [2024-11-11 21:12:16,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 09:12:16" (3/3) ... [2024-11-11 21:12:16,211 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2024-11-11 21:12:16,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 21:12:16,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 21:12:16,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 21:12:16,292 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;@3151f156, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 21:12:16,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 21:12:16,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 135 states have (on average 1.6) internal successors, (216), 139 states have internal predecessors, (216), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-11 21:12:16,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 21:12:16,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:16,303 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:16,303 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:16,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:16,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1065054740, now seen corresponding path program 1 times [2024-11-11 21:12:16,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:16,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672404144] [2024-11-11 21:12:16,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:16,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:16,720 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:12:16,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:16,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672404144] [2024-11-11 21:12:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672404144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:16,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:16,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:16,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301766121] [2024-11-11 21:12:16,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:16,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:16,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:16,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:16,759 INFO L87 Difference]: Start difference. First operand has 174 states, 135 states have (on average 1.6) internal successors, (216), 139 states have internal predecessors, (216), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:16,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:16,885 INFO L93 Difference]: Finished difference Result 351 states and 596 transitions. [2024-11-11 21:12:16,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:16,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 21:12:16,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:16,896 INFO L225 Difference]: With dead ends: 351 [2024-11-11 21:12:16,896 INFO L226 Difference]: Without dead ends: 176 [2024-11-11 21:12:16,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:16,905 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 7 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:16,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 788 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-11 21:12:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2024-11-11 21:12:16,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 140 states have internal predecessors, (211), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-11 21:12:16,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 275 transitions. [2024-11-11 21:12:16,975 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 275 transitions. Word has length 15 [2024-11-11 21:12:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:16,975 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 275 transitions. [2024-11-11 21:12:16,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 275 transitions. [2024-11-11 21:12:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 21:12:16,978 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:16,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:16,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 21:12:16,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:16,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -833908238, now seen corresponding path program 1 times [2024-11-11 21:12:16,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:16,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630162858] [2024-11-11 21:12:16,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:16,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,094 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:12:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:17,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630162858] [2024-11-11 21:12:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630162858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027714579] [2024-11-11 21:12:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:17,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:17,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:17,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:17,102 INFO L87 Difference]: Start difference. First operand 176 states and 275 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:17,172 INFO L93 Difference]: Finished difference Result 365 states and 573 transitions. [2024-11-11 21:12:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-11 21:12:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:17,175 INFO L225 Difference]: With dead ends: 365 [2024-11-11 21:12:17,176 INFO L226 Difference]: Without dead ends: 192 [2024-11-11 21:12:17,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:17,178 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:17,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 792 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-11 21:12:17,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2024-11-11 21:12:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 151 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-11 21:12:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 291 transitions. [2024-11-11 21:12:17,203 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 291 transitions. Word has length 16 [2024-11-11 21:12:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:17,203 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 291 transitions. [2024-11-11 21:12:17,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 21:12:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 291 transitions. [2024-11-11 21:12:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 21:12:17,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:17,206 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] [2024-11-11 21:12:17,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 21:12:17,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:17,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:17,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1500387397, now seen corresponding path program 1 times [2024-11-11 21:12:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33361666] [2024-11-11 21:12:17,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,339 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:12:17,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:17,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33361666] [2024-11-11 21:12:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33361666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:17,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:17,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 21:12:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404532061] [2024-11-11 21:12:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:17,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 21:12:17,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:17,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 21:12:17,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:17,342 INFO L87 Difference]: Start difference. First operand 189 states and 291 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:12:17,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:17,372 INFO L93 Difference]: Finished difference Result 397 states and 619 transitions. [2024-11-11 21:12:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 21:12:17,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-11 21:12:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:17,376 INFO L225 Difference]: With dead ends: 397 [2024-11-11 21:12:17,376 INFO L226 Difference]: Without dead ends: 218 [2024-11-11 21:12:17,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 21:12:17,380 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 22 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:17,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 536 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:17,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-11 21:12:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 191. [2024-11-11 21:12:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.5133333333333334) internal successors, (227), 153 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-11 21:12:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 293 transitions. [2024-11-11 21:12:17,400 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 293 transitions. Word has length 23 [2024-11-11 21:12:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:17,400 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 293 transitions. [2024-11-11 21:12:17,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 21:12:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 293 transitions. [2024-11-11 21:12:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 21:12:17,401 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:17,402 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] [2024-11-11 21:12:17,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 21:12:17,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1777658698, now seen corresponding path program 1 times [2024-11-11 21:12:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:17,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695230145] [2024-11-11 21:12:17,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:17,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,519 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:12:17,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:17,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695230145] [2024-11-11 21:12:17,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695230145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:17,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:17,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321112833] [2024-11-11 21:12:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:17,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:17,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:17,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:17,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:17,522 INFO L87 Difference]: Start difference. First operand 191 states and 293 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:17,572 INFO L93 Difference]: Finished difference Result 427 states and 672 transitions. [2024-11-11 21:12:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:17,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2024-11-11 21:12:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:17,575 INFO L225 Difference]: With dead ends: 427 [2024-11-11 21:12:17,575 INFO L226 Difference]: Without dead ends: 287 [2024-11-11 21:12:17,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:17,579 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 117 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:17,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 786 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-11 21:12:17,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 191. [2024-11-11 21:12:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.4866666666666666) internal successors, (223), 153 states have internal predecessors, (223), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-11 21:12:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 289 transitions. [2024-11-11 21:12:17,606 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 289 transitions. Word has length 31 [2024-11-11 21:12:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:17,606 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 289 transitions. [2024-11-11 21:12:17,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 289 transitions. [2024-11-11 21:12:17,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 21:12:17,611 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:17,611 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] [2024-11-11 21:12:17,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 21:12:17,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:17,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:17,612 INFO L85 PathProgramCache]: Analyzing trace with hash 434150205, now seen corresponding path program 1 times [2024-11-11 21:12:17,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:17,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136669759] [2024-11-11 21:12:17,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:17,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:17,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:17,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136669759] [2024-11-11 21:12:17,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136669759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:17,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:17,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:17,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733764561] [2024-11-11 21:12:17,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:17,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:17,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:17,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:17,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:17,748 INFO L87 Difference]: Start difference. First operand 191 states and 289 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:17,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:17,790 INFO L93 Difference]: Finished difference Result 372 states and 567 transitions. [2024-11-11 21:12:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:17,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-11 21:12:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:17,793 INFO L225 Difference]: With dead ends: 372 [2024-11-11 21:12:17,793 INFO L226 Difference]: Without dead ends: 193 [2024-11-11 21:12:17,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:17,795 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:17,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1046 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:17,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-11 21:12:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-11 21:12:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 150 states have (on average 1.48) internal successors, (222), 153 states have internal predecessors, (222), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-11 21:12:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 288 transitions. [2024-11-11 21:12:17,815 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 288 transitions. Word has length 32 [2024-11-11 21:12:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:17,816 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 288 transitions. [2024-11-11 21:12:17,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 288 transitions. [2024-11-11 21:12:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 21:12:17,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:17,818 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] [2024-11-11 21:12:17,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 21:12:17,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:17,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:17,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1414967708, now seen corresponding path program 1 times [2024-11-11 21:12:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:17,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088660829] [2024-11-11 21:12:17,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:17,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:17,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088660829] [2024-11-11 21:12:17,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088660829] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:17,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927640057] [2024-11-11 21:12:17,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:17,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:17,928 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:12:17,932 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:12:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:12:18,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:18,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 21:12:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927640057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:18,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-11 21:12:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529935706] [2024-11-11 21:12:18,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:18,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:18,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:18,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:18,138 INFO L87 Difference]: Start difference. First operand 191 states and 288 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:12:18,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:18,187 INFO L93 Difference]: Finished difference Result 430 states and 663 transitions. [2024-11-11 21:12:18,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:18,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-11 21:12:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:18,190 INFO L225 Difference]: With dead ends: 430 [2024-11-11 21:12:18,190 INFO L226 Difference]: Without dead ends: 250 [2024-11-11 21:12:18,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:18,193 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 70 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:18,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 788 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-11 21:12:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2024-11-11 21:12:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 193 states have (on average 1.455958549222798) internal successors, (281), 196 states have internal predecessors, (281), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 21:12:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 367 transitions. [2024-11-11 21:12:18,213 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 367 transitions. Word has length 35 [2024-11-11 21:12:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 367 transitions. [2024-11-11 21:12:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-11 21:12:18,213 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 367 transitions. [2024-11-11 21:12:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:12:18,216 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:18,216 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:18,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 21:12:18,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 21:12:18,421 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:18,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -354607524, now seen corresponding path program 2 times [2024-11-11 21:12:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247962380] [2024-11-11 21:12:18,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-11 21:12:18,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:18,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247962380] [2024-11-11 21:12:18,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247962380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:18,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:18,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:18,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204414860] [2024-11-11 21:12:18,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:18,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:18,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:18,527 INFO L87 Difference]: Start difference. First operand 244 states and 367 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:18,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:18,578 INFO L93 Difference]: Finished difference Result 466 states and 718 transitions. [2024-11-11 21:12:18,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:18,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-11 21:12:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:18,582 INFO L225 Difference]: With dead ends: 466 [2024-11-11 21:12:18,582 INFO L226 Difference]: Without dead ends: 251 [2024-11-11 21:12:18,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:18,587 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 8 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:18,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 766 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-11 21:12:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-11-11 21:12:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 199 states have (on average 1.4522613065326633) internal successors, (289), 202 states have internal predecessors, (289), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-11 21:12:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 375 transitions. [2024-11-11 21:12:18,604 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 375 transitions. Word has length 57 [2024-11-11 21:12:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:18,605 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 375 transitions. [2024-11-11 21:12:18,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 375 transitions. [2024-11-11 21:12:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-11 21:12:18,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:18,606 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:18,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 21:12:18,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:18,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -766519285, now seen corresponding path program 1 times [2024-11-11 21:12:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:18,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207544170] [2024-11-11 21:12:18,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:18,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 21:12:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207544170] [2024-11-11 21:12:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207544170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:18,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:18,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139811181] [2024-11-11 21:12:18,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:18,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:18,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:18,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:18,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:18,696 INFO L87 Difference]: Start difference. First operand 251 states and 375 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:18,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:18,766 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2024-11-11 21:12:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:18,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-11 21:12:18,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:18,770 INFO L225 Difference]: With dead ends: 512 [2024-11-11 21:12:18,770 INFO L226 Difference]: Without dead ends: 290 [2024-11-11 21:12:18,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:18,772 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 24 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:18,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 784 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-11 21:12:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2024-11-11 21:12:18,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.4112554112554112) internal successors, (326), 234 states have internal predecessors, (326), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-11 21:12:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 418 transitions. [2024-11-11 21:12:18,790 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 418 transitions. Word has length 57 [2024-11-11 21:12:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:18,792 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 418 transitions. [2024-11-11 21:12:18,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 21:12:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 418 transitions. [2024-11-11 21:12:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 21:12:18,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:18,794 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:18,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 21:12:18,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:18,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash -5352724, now seen corresponding path program 1 times [2024-11-11 21:12:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:18,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447880018] [2024-11-11 21:12:18,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:18,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-11 21:12:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447880018] [2024-11-11 21:12:18,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447880018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:18,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:18,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533444441] [2024-11-11 21:12:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:18,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:18,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:18,920 INFO L87 Difference]: Start difference. First operand 287 states and 418 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:18,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:18,959 INFO L93 Difference]: Finished difference Result 523 states and 775 transitions. [2024-11-11 21:12:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-11 21:12:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:18,962 INFO L225 Difference]: With dead ends: 523 [2024-11-11 21:12:18,962 INFO L226 Difference]: Without dead ends: 289 [2024-11-11 21:12:18,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:18,965 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:18,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1045 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-11 21:12:18,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2024-11-11 21:12:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.3982683982683983) internal successors, (323), 234 states have internal predecessors, (323), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-11 21:12:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 415 transitions. [2024-11-11 21:12:18,983 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 415 transitions. Word has length 75 [2024-11-11 21:12:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:18,983 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 415 transitions. [2024-11-11 21:12:18,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:18,984 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 415 transitions. [2024-11-11 21:12:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 21:12:18,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:18,985 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:18,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 21:12:18,985 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:18,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1917910261, now seen corresponding path program 1 times [2024-11-11 21:12:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:18,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322555666] [2024-11-11 21:12:18,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-11 21:12:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322555666] [2024-11-11 21:12:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322555666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:19,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:19,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:19,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242556824] [2024-11-11 21:12:19,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:19,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:19,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:19,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:19,142 INFO L87 Difference]: Start difference. First operand 287 states and 415 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:19,194 INFO L93 Difference]: Finished difference Result 560 states and 831 transitions. [2024-11-11 21:12:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:19,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-11 21:12:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:19,197 INFO L225 Difference]: With dead ends: 560 [2024-11-11 21:12:19,198 INFO L226 Difference]: Without dead ends: 331 [2024-11-11 21:12:19,199 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:12:19,199 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 25 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:19,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 784 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-11 21:12:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2024-11-11 21:12:19,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 268 states have (on average 1.3619402985074627) internal successors, (365), 271 states have internal predecessors, (365), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-11 21:12:19,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 463 transitions. [2024-11-11 21:12:19,215 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 463 transitions. Word has length 104 [2024-11-11 21:12:19,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:19,216 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 463 transitions. [2024-11-11 21:12:19,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 463 transitions. [2024-11-11 21:12:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 21:12:19,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:19,217 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 21:12:19,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:19,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash -20743229, now seen corresponding path program 1 times [2024-11-11 21:12:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:19,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544343258] [2024-11-11 21:12:19,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-11 21:12:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544343258] [2024-11-11 21:12:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544343258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:19,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:19,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:19,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312814718] [2024-11-11 21:12:19,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:19,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:19,336 INFO L87 Difference]: Start difference. First operand 328 states and 463 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:19,383 INFO L93 Difference]: Finished difference Result 586 states and 851 transitions. [2024-11-11 21:12:19,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:19,383 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-11 21:12:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:19,386 INFO L225 Difference]: With dead ends: 586 [2024-11-11 21:12:19,386 INFO L226 Difference]: Without dead ends: 322 [2024-11-11 21:12:19,387 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:12:19,388 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 9 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:19,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 749 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-11 21:12:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-11-11 21:12:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.3422053231939164) internal successors, (353), 266 states have internal predecessors, (353), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-11 21:12:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2024-11-11 21:12:19,402 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 105 [2024-11-11 21:12:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:19,402 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2024-11-11 21:12:19,402 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, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-11 21:12:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2024-11-11 21:12:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 21:12:19,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:19,404 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:19,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 21:12:19,404 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1679394221, now seen corresponding path program 1 times [2024-11-11 21:12:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288835727] [2024-11-11 21:12:19,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:19,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-11 21:12:19,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:19,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288835727] [2024-11-11 21:12:19,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288835727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:19,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:19,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:19,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120606143] [2024-11-11 21:12:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:19,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:19,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:19,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:19,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:19,540 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:19,572 INFO L93 Difference]: Finished difference Result 561 states and 800 transitions. [2024-11-11 21:12:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:19,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-11 21:12:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:19,576 INFO L225 Difference]: With dead ends: 561 [2024-11-11 21:12:19,576 INFO L226 Difference]: Without dead ends: 324 [2024-11-11 21:12:19,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:19,577 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:19,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1029 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-11 21:12:19,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2024-11-11 21:12:19,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 266 states have internal predecessors, (350), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-11 21:12:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 446 transitions. [2024-11-11 21:12:19,591 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 446 transitions. Word has length 124 [2024-11-11 21:12:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:19,592 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 446 transitions. [2024-11-11 21:12:19,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 446 transitions. [2024-11-11 21:12:19,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-11 21:12:19,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:19,594 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:19,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 21:12:19,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:19,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash 851558858, now seen corresponding path program 1 times [2024-11-11 21:12:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947045267] [2024-11-11 21:12:19,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-11 21:12:19,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:19,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947045267] [2024-11-11 21:12:19,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947045267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:19,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:19,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:19,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156876338] [2024-11-11 21:12:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:19,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:19,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:19,757 INFO L87 Difference]: Start difference. First operand 322 states and 446 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:19,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:19,831 INFO L93 Difference]: Finished difference Result 524 states and 760 transitions. [2024-11-11 21:12:19,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:19,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-11 21:12:19,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:19,835 INFO L225 Difference]: With dead ends: 524 [2024-11-11 21:12:19,835 INFO L226 Difference]: Without dead ends: 320 [2024-11-11 21:12:19,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:19,837 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:19,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 717 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-11 21:12:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2024-11-11 21:12:19,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 262 states have (on average 1.3282442748091603) internal successors, (348), 265 states have internal predecessors, (348), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-11 21:12:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 442 transitions. [2024-11-11 21:12:19,854 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 442 transitions. Word has length 157 [2024-11-11 21:12:19,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:19,855 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 442 transitions. [2024-11-11 21:12:19,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-11 21:12:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 442 transitions. [2024-11-11 21:12:19,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-11 21:12:19,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:19,857 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 21:12:19,858 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:19,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1654746949, now seen corresponding path program 1 times [2024-11-11 21:12:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566313834] [2024-11-11 21:12:19,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,062 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-11 21:12:20,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:20,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566313834] [2024-11-11 21:12:20,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566313834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:20,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:20,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:20,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786598949] [2024-11-11 21:12:20,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:20,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:20,069 INFO L87 Difference]: Start difference. First operand 320 states and 442 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:12:20,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:20,122 INFO L93 Difference]: Finished difference Result 464 states and 656 transitions. [2024-11-11 21:12:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:20,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2024-11-11 21:12:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:20,126 INFO L225 Difference]: With dead ends: 464 [2024-11-11 21:12:20,126 INFO L226 Difference]: Without dead ends: 303 [2024-11-11 21:12:20,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:20,128 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 35 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:20,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 693 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-11 21:12:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2024-11-11 21:12:20,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 248 states have (on average 1.3185483870967742) internal successors, (327), 251 states have internal predecessors, (327), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-11 21:12:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 415 transitions. [2024-11-11 21:12:20,143 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 415 transitions. Word has length 172 [2024-11-11 21:12:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:20,144 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 415 transitions. [2024-11-11 21:12:20,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:12:20,144 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 415 transitions. [2024-11-11 21:12:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-11 21:12:20,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:20,146 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:20,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 21:12:20,146 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:20,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1848961329, now seen corresponding path program 1 times [2024-11-11 21:12:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676081287] [2024-11-11 21:12:20,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:20,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:20,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:20,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,321 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-11 21:12:20,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676081287] [2024-11-11 21:12:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676081287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:20,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:20,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391831989] [2024-11-11 21:12:20,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:20,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:20,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:20,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:20,323 INFO L87 Difference]: Start difference. First operand 303 states and 415 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:12:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:20,385 INFO L93 Difference]: Finished difference Result 447 states and 629 transitions. [2024-11-11 21:12:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2024-11-11 21:12:20,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:20,389 INFO L225 Difference]: With dead ends: 447 [2024-11-11 21:12:20,389 INFO L226 Difference]: Without dead ends: 284 [2024-11-11 21:12:20,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:20,391 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 30 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:20,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 697 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-11 21:12:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-11 21:12:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 232 states have (on average 1.3103448275862069) internal successors, (304), 235 states have internal predecessors, (304), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-11 21:12:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 386 transitions. [2024-11-11 21:12:20,404 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 386 transitions. Word has length 174 [2024-11-11 21:12:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:20,405 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 386 transitions. [2024-11-11 21:12:20,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 21:12:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 386 transitions. [2024-11-11 21:12:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-11 21:12:20,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:20,407 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:20,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 21:12:20,408 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:20,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash 422240720, now seen corresponding path program 1 times [2024-11-11 21:12:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:20,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55780603] [2024-11-11 21:12:20,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:20,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:20,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-11 21:12:20,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:20,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55780603] [2024-11-11 21:12:20,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55780603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:20,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:20,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:20,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23742469] [2024-11-11 21:12:20,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:20,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:20,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:20,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:20,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:20,606 INFO L87 Difference]: Start difference. First operand 284 states and 386 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:12:20,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:20,642 INFO L93 Difference]: Finished difference Result 427 states and 599 transitions. [2024-11-11 21:12:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2024-11-11 21:12:20,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:20,645 INFO L225 Difference]: With dead ends: 427 [2024-11-11 21:12:20,645 INFO L226 Difference]: Without dead ends: 284 [2024-11-11 21:12:20,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:20,646 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 0 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:20,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1007 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-11 21:12:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2024-11-11 21:12:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 232 states have (on average 1.2844827586206897) internal successors, (298), 235 states have internal predecessors, (298), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-11 21:12:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 380 transitions. [2024-11-11 21:12:20,661 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 380 transitions. Word has length 175 [2024-11-11 21:12:20,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:20,662 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 380 transitions. [2024-11-11 21:12:20,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:12:20,662 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 380 transitions. [2024-11-11 21:12:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-11 21:12:20,664 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:20,665 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 21:12:20,665 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1608535476, now seen corresponding path program 1 times [2024-11-11 21:12:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938820901] [2024-11-11 21:12:20,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:20,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 21:12:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938820901] [2024-11-11 21:12:20,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938820901] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102624436] [2024-11-11 21:12:20,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:20,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:20,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:20,826 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:12:20,828 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:12:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:21,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 21:12:21,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-11 21:12:21,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102624436] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:21,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 21:12:21,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-11 21:12:21,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667662357] [2024-11-11 21:12:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:21,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:21,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:21,198 INFO L87 Difference]: Start difference. First operand 284 states and 380 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 21:12:21,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:21,242 INFO L93 Difference]: Finished difference Result 448 states and 621 transitions. [2024-11-11 21:12:21,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:21,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2024-11-11 21:12:21,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:21,244 INFO L225 Difference]: With dead ends: 448 [2024-11-11 21:12:21,245 INFO L226 Difference]: Without dead ends: 263 [2024-11-11 21:12:21,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 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:12:21,246 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 20 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:21,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 696 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:21,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-11 21:12:21,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-11 21:12:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 217 states have internal predecessors, (273), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 21:12:21,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 349 transitions. [2024-11-11 21:12:21,259 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 349 transitions. Word has length 182 [2024-11-11 21:12:21,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:21,261 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 349 transitions. [2024-11-11 21:12:21,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 21:12:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 349 transitions. [2024-11-11 21:12:21,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-11 21:12:21,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:21,263 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:21,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:21,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 21:12:21,464 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:21,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:21,464 INFO L85 PathProgramCache]: Analyzing trace with hash -652430721, now seen corresponding path program 1 times [2024-11-11 21:12:21,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:21,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937774172] [2024-11-11 21:12:21,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:21,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:21,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-11 21:12:21,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:21,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937774172] [2024-11-11 21:12:21,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937774172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:21,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:21,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:21,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709985074] [2024-11-11 21:12:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:21,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:21,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:21,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:21,631 INFO L87 Difference]: Start difference. First operand 263 states and 349 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:12:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:21,661 INFO L93 Difference]: Finished difference Result 403 states and 560 transitions. [2024-11-11 21:12:21,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:21,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2024-11-11 21:12:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:21,663 INFO L225 Difference]: With dead ends: 403 [2024-11-11 21:12:21,663 INFO L226 Difference]: Without dead ends: 267 [2024-11-11 21:12:21,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:21,665 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 3 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:21,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 737 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-11 21:12:21,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-11 21:12:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 217 states have (on average 1.271889400921659) internal successors, (276), 220 states have internal predecessors, (276), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 21:12:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 352 transitions. [2024-11-11 21:12:21,678 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 352 transitions. Word has length 206 [2024-11-11 21:12:21,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:21,680 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 352 transitions. [2024-11-11 21:12:21,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-11 21:12:21,681 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 352 transitions. [2024-11-11 21:12:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-11 21:12:21,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:21,683 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:21,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 21:12:21,684 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:21,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash 755979014, now seen corresponding path program 1 times [2024-11-11 21:12:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441704903] [2024-11-11 21:12:21,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:21,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-11 21:12:21,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441704903] [2024-11-11 21:12:21,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441704903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:21,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512619272] [2024-11-11 21:12:21,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:21,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:21,918 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:12:21,919 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:12:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:22,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:22,139 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-11 21:12:22,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:22,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512619272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:22,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:22,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:22,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727592239] [2024-11-11 21:12:22,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:22,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:22,141 INFO L87 Difference]: Start difference. First operand 267 states and 352 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-11 21:12:22,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:22,173 INFO L93 Difference]: Finished difference Result 412 states and 568 transitions. [2024-11-11 21:12:22,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:22,173 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 213 [2024-11-11 21:12:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:22,176 INFO L225 Difference]: With dead ends: 412 [2024-11-11 21:12:22,176 INFO L226 Difference]: Without dead ends: 272 [2024-11-11 21:12:22,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:22,177 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 4 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:22,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 739 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-11 21:12:22,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2024-11-11 21:12:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 224 states have internal predecessors, (280), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 21:12:22,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 356 transitions. [2024-11-11 21:12:22,189 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 356 transitions. Word has length 213 [2024-11-11 21:12:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:22,190 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 356 transitions. [2024-11-11 21:12:22,190 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, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-11 21:12:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 356 transitions. [2024-11-11 21:12:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 21:12:22,192 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:22,192 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:22,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 21:12:22,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:22,394 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:22,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:22,394 INFO L85 PathProgramCache]: Analyzing trace with hash -375445413, now seen corresponding path program 1 times [2024-11-11 21:12:22,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:22,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900613434] [2024-11-11 21:12:22,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:22,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-11 21:12:22,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:22,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900613434] [2024-11-11 21:12:22,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900613434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:22,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499873951] [2024-11-11 21:12:22,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:22,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:22,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:22,645 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:22,646 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:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:22,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:22,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-11 21:12:22,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:22,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499873951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:22,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:22,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:22,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565544180] [2024-11-11 21:12:22,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:22,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:22,915 INFO L87 Difference]: Start difference. First operand 272 states and 356 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-11 21:12:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:22,966 INFO L93 Difference]: Finished difference Result 416 states and 568 transitions. [2024-11-11 21:12:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:22,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 221 [2024-11-11 21:12:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:22,969 INFO L225 Difference]: With dead ends: 416 [2024-11-11 21:12:22,969 INFO L226 Difference]: Without dead ends: 271 [2024-11-11 21:12:22,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:22,970 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 5 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:22,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 729 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-11 21:12:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-11 21:12:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 221 states have (on average 1.253393665158371) internal successors, (277), 223 states have internal predecessors, (277), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-11 21:12:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 351 transitions. [2024-11-11 21:12:22,982 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 351 transitions. Word has length 221 [2024-11-11 21:12:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:22,982 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 351 transitions. [2024-11-11 21:12:22,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-11 21:12:22,983 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 351 transitions. [2024-11-11 21:12:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-11 21:12:22,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:22,985 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:23,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 21:12:23,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:23,185 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,186 INFO L85 PathProgramCache]: Analyzing trace with hash -258706760, now seen corresponding path program 1 times [2024-11-11 21:12:23,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039268146] [2024-11-11 21:12:23,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-11 21:12:23,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039268146] [2024-11-11 21:12:23,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039268146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:23,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:23,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827985317] [2024-11-11 21:12:23,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:23,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:23,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:23,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:23,372 INFO L87 Difference]: Start difference. First operand 271 states and 351 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-11 21:12:23,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:23,640 INFO L93 Difference]: Finished difference Result 414 states and 557 transitions. [2024-11-11 21:12:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:23,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 229 [2024-11-11 21:12:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:23,643 INFO L225 Difference]: With dead ends: 414 [2024-11-11 21:12:23,643 INFO L226 Difference]: Without dead ends: 270 [2024-11-11 21:12:23,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:23,645 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 59 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:23,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 470 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-11 21:12:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2024-11-11 21:12:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 221 states have (on average 1.248868778280543) internal successors, (276), 222 states have internal predecessors, (276), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-11 21:12:23,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 348 transitions. [2024-11-11 21:12:23,665 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 348 transitions. Word has length 229 [2024-11-11 21:12:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 348 transitions. [2024-11-11 21:12:23,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-11 21:12:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 348 transitions. [2024-11-11 21:12:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-11 21:12:23,668 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:23,668 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:23,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 21:12:23,669 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:23,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:23,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1826651825, now seen corresponding path program 1 times [2024-11-11 21:12:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:23,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947249783] [2024-11-11 21:12:23,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-11 21:12:23,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:23,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947249783] [2024-11-11 21:12:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947249783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456384864] [2024-11-11 21:12:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:23,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:23,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:23,958 INFO L87 Difference]: Start difference. First operand 270 states and 348 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 21:12:24,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:24,451 INFO L93 Difference]: Finished difference Result 619 states and 826 transitions. [2024-11-11 21:12:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:24,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 230 [2024-11-11 21:12:24,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:24,455 INFO L225 Difference]: With dead ends: 619 [2024-11-11 21:12:24,455 INFO L226 Difference]: Without dead ends: 476 [2024-11-11 21:12:24,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:24,456 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 407 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:24,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 617 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:24,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-11 21:12:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 422. [2024-11-11 21:12:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 343 states have (on average 1.2973760932944607) internal successors, (445), 345 states have internal predecessors, (445), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-11 21:12:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 553 transitions. [2024-11-11 21:12:24,484 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 553 transitions. Word has length 230 [2024-11-11 21:12:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:24,484 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 553 transitions. [2024-11-11 21:12:24,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 21:12:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 553 transitions. [2024-11-11 21:12:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-11 21:12:24,487 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:24,487 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:24,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 21:12:24,487 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:24,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -5288995, now seen corresponding path program 1 times [2024-11-11 21:12:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:24,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730373535] [2024-11-11 21:12:24,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:24,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2024-11-11 21:12:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-11 21:12:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-11 21:12:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-11 21:12:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:24,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730373535] [2024-11-11 21:12:24,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730373535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:24,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816651513] [2024-11-11 21:12:24,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:24,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:24,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:24,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:24,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:24,733 INFO L87 Difference]: Start difference. First operand 422 states and 553 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:12:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,160 INFO L93 Difference]: Finished difference Result 890 states and 1219 transitions. [2024-11-11 21:12:25,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 259 [2024-11-11 21:12:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,164 INFO L225 Difference]: With dead ends: 890 [2024-11-11 21:12:25,164 INFO L226 Difference]: Without dead ends: 663 [2024-11-11 21:12:25,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,166 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 216 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 466 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2024-11-11 21:12:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 501. [2024-11-11 21:12:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 412 states have (on average 1.3058252427184467) internal successors, (538), 415 states have internal predecessors, (538), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-11 21:12:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 656 transitions. [2024-11-11 21:12:25,210 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 656 transitions. Word has length 259 [2024-11-11 21:12:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,210 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 656 transitions. [2024-11-11 21:12:25,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:12:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 656 transitions. [2024-11-11 21:12:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-11 21:12:25,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,213 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 21:12:25,214 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1718748118, now seen corresponding path program 1 times [2024-11-11 21:12:25,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957837663] [2024-11-11 21:12:25,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-11 21:12:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-11 21:12:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-11 21:12:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-11 21:12:25,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:25,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957837663] [2024-11-11 21:12:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957837663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514508395] [2024-11-11 21:12:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:25,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:25,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:25,405 INFO L87 Difference]: Start difference. First operand 501 states and 656 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:12:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:25,871 INFO L93 Difference]: Finished difference Result 1061 states and 1444 transitions. [2024-11-11 21:12:25,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 260 [2024-11-11 21:12:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:25,878 INFO L225 Difference]: With dead ends: 1061 [2024-11-11 21:12:25,878 INFO L226 Difference]: Without dead ends: 784 [2024-11-11 21:12:25,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:25,881 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 217 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:25,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 494 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-11 21:12:25,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 609. [2024-11-11 21:12:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 508 states have (on average 1.31496062992126) internal successors, (668), 513 states have internal predecessors, (668), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-11 21:12:25,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 798 transitions. [2024-11-11 21:12:25,935 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 798 transitions. Word has length 260 [2024-11-11 21:12:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:25,936 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 798 transitions. [2024-11-11 21:12:25,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-11 21:12:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 798 transitions. [2024-11-11 21:12:25,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-11 21:12:25,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:25,940 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:25,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 21:12:25,941 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:25,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash -461990696, now seen corresponding path program 1 times [2024-11-11 21:12:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494143811] [2024-11-11 21:12:25,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:25,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-11 21:12:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-11 21:12:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-11 21:12:26,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:26,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494143811] [2024-11-11 21:12:26,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494143811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:26,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:26,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:26,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949199302] [2024-11-11 21:12:26,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:26,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:26,124 INFO L87 Difference]: Start difference. First operand 609 states and 798 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:26,549 INFO L93 Difference]: Finished difference Result 1271 states and 1726 transitions. [2024-11-11 21:12:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:26,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-11-11 21:12:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:26,555 INFO L225 Difference]: With dead ends: 1271 [2024-11-11 21:12:26,555 INFO L226 Difference]: Without dead ends: 918 [2024-11-11 21:12:26,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:26,557 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 217 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:26,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 521 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:26,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-11 21:12:26,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 715. [2024-11-11 21:12:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 606 states have (on average 1.3267326732673268) internal successors, (804), 615 states have internal predecessors, (804), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-11 21:12:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 942 transitions. [2024-11-11 21:12:26,619 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 942 transitions. Word has length 261 [2024-11-11 21:12:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:26,620 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 942 transitions. [2024-11-11 21:12:26,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:26,621 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 942 transitions. [2024-11-11 21:12:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-11 21:12:26,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:26,624 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:26,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 21:12:26,624 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:26,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -187231082, now seen corresponding path program 1 times [2024-11-11 21:12:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339711138] [2024-11-11 21:12:26,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:26,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-11 21:12:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-11 21:12:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-11 21:12:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-11-11 21:12:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339711138] [2024-11-11 21:12:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339711138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646843032] [2024-11-11 21:12:26,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:26,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:26,946 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:26,948 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:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:12:27,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2024-11-11 21:12:27,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:27,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646843032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:27,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:27,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-11 21:12:27,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065406790] [2024-11-11 21:12:27,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:27,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:27,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:12:27,209 INFO L87 Difference]: Start difference. First operand 715 states and 942 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:27,332 INFO L93 Difference]: Finished difference Result 1178 states and 1590 transitions. [2024-11-11 21:12:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2024-11-11 21:12:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:27,337 INFO L225 Difference]: With dead ends: 1178 [2024-11-11 21:12:27,337 INFO L226 Difference]: Without dead ends: 715 [2024-11-11 21:12:27,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:12:27,339 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 31 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:27,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 664 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:27,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-11 21:12:27,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-11-11 21:12:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 606 states have (on average 1.316831683168317) internal successors, (798), 615 states have internal predecessors, (798), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-11 21:12:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 936 transitions. [2024-11-11 21:12:27,387 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 936 transitions. Word has length 261 [2024-11-11 21:12:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:27,387 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 936 transitions. [2024-11-11 21:12:27,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 936 transitions. [2024-11-11 21:12:27,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-11 21:12:27,390 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:27,390 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:27,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:27,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-11 21:12:27,592 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:27,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:27,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1951108443, now seen corresponding path program 1 times [2024-11-11 21:12:27,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:27,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257150426] [2024-11-11 21:12:27,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:27,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-11 21:12:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-11 21:12:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-11 21:12:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2024-11-11 21:12:27,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:27,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257150426] [2024-11-11 21:12:27,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257150426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:27,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1976954070] [2024-11-11 21:12:27,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:27,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:27,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:27,997 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:27,999 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:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 21:12:28,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-11 21:12:28,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:28,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1976954070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:28,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:28,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-11 21:12:28,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640464349] [2024-11-11 21:12:28,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:28,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:28,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:28,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:28,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:12:28,260 INFO L87 Difference]: Start difference. First operand 715 states and 936 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:28,353 INFO L93 Difference]: Finished difference Result 1178 states and 1576 transitions. [2024-11-11 21:12:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2024-11-11 21:12:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:28,358 INFO L225 Difference]: With dead ends: 1178 [2024-11-11 21:12:28,358 INFO L226 Difference]: Without dead ends: 727 [2024-11-11 21:12:28,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:12:28,360 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 7 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:28,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 672 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:28,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-11 21:12:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2024-11-11 21:12:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 616 states have (on average 1.3181818181818181) internal successors, (812), 625 states have internal predecessors, (812), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-11 21:12:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 950 transitions. [2024-11-11 21:12:28,412 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 950 transitions. Word has length 262 [2024-11-11 21:12:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:28,413 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 950 transitions. [2024-11-11 21:12:28,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 950 transitions. [2024-11-11 21:12:28,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-11 21:12:28,417 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:28,417 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:28,436 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:28,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-11 21:12:28,618 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:28,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:28,618 INFO L85 PathProgramCache]: Analyzing trace with hash -981119248, now seen corresponding path program 1 times [2024-11-11 21:12:28,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:28,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911107581] [2024-11-11 21:12:28,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:28,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-11 21:12:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-11 21:12:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-11 21:12:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-11 21:12:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-11 21:12:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-11 21:12:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:28,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911107581] [2024-11-11 21:12:28,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911107581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:28,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:28,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 21:12:28,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245550648] [2024-11-11 21:12:28,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:28,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:28,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:28,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:28,938 INFO L87 Difference]: Start difference. First operand 727 states and 950 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:29,193 INFO L93 Difference]: Finished difference Result 1192 states and 1590 transitions. [2024-11-11 21:12:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 21:12:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 263 [2024-11-11 21:12:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:29,198 INFO L225 Difference]: With dead ends: 1192 [2024-11-11 21:12:29,198 INFO L226 Difference]: Without dead ends: 707 [2024-11-11 21:12:29,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 21:12:29,199 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 59 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:29,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 468 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-11 21:12:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2024-11-11 21:12:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 597 states have (on average 1.3031825795644891) internal successors, (778), 605 states have internal predecessors, (778), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-11 21:12:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 915 transitions. [2024-11-11 21:12:29,242 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 915 transitions. Word has length 263 [2024-11-11 21:12:29,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:29,242 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 915 transitions. [2024-11-11 21:12:29,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 21:12:29,242 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 915 transitions. [2024-11-11 21:12:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-11 21:12:29,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:29,244 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:29,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-11 21:12:29,245 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:29,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:29,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1800454293, now seen corresponding path program 1 times [2024-11-11 21:12:29,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:29,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935337298] [2024-11-11 21:12:29,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:29,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2024-11-11 21:12:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935337298] [2024-11-11 21:12:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935337298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:12:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055531117] [2024-11-11 21:12:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:29,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:12:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:12:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:29,629 INFO L87 Difference]: Start difference. First operand 707 states and 915 transitions. Second operand has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:12:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:30,153 INFO L93 Difference]: Finished difference Result 1020 states and 1392 transitions. [2024-11-11 21:12:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 264 [2024-11-11 21:12:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:30,162 INFO L225 Difference]: With dead ends: 1020 [2024-11-11 21:12:30,162 INFO L226 Difference]: Without dead ends: 1018 [2024-11-11 21:12:30,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-11 21:12:30,164 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 180 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:30,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1528 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:30,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-11 21:12:30,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 713. [2024-11-11 21:12:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 601 states have (on average 1.3011647254575707) internal successors, (782), 610 states have internal predecessors, (782), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-11 21:12:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 921 transitions. [2024-11-11 21:12:30,231 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 921 transitions. Word has length 264 [2024-11-11 21:12:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:30,231 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 921 transitions. [2024-11-11 21:12:30,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.666666666666666) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-11 21:12:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 921 transitions. [2024-11-11 21:12:30,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-11 21:12:30,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:30,235 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:30,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-11 21:12:30,236 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:30,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash -241657348, now seen corresponding path program 1 times [2024-11-11 21:12:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648815077] [2024-11-11 21:12:30,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:30,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-11 21:12:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-11 21:12:30,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:30,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648815077] [2024-11-11 21:12:30,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648815077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661982209] [2024-11-11 21:12:30,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:30,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:30,634 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:30,635 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:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:30,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 21:12:30,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-11 21:12:31,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2024-11-11 21:12:31,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661982209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:31,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:31,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-11-11 21:12:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000646885] [2024-11-11 21:12:31,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:31,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 21:12:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:31,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 21:12:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:12:31,444 INFO L87 Difference]: Start difference. First operand 713 states and 921 transitions. Second operand has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-11 21:12:33,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:33,324 INFO L93 Difference]: Finished difference Result 1709 states and 2286 transitions. [2024-11-11 21:12:33,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 21:12:33,325 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 272 [2024-11-11 21:12:33,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:33,332 INFO L225 Difference]: With dead ends: 1709 [2024-11-11 21:12:33,332 INFO L226 Difference]: Without dead ends: 1258 [2024-11-11 21:12:33,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 585 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-11-11 21:12:33,335 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 266 mSDsluCounter, 2862 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:33,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 3096 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 21:12:33,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2024-11-11 21:12:33,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 988. [2024-11-11 21:12:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 836 states have (on average 1.291866028708134) internal successors, (1080), 846 states have internal predecessors, (1080), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2024-11-11 21:12:33,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1272 transitions. [2024-11-11 21:12:33,427 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1272 transitions. Word has length 272 [2024-11-11 21:12:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:33,427 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1272 transitions. [2024-11-11 21:12:33,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.684210526315789) internal successors, (146), 14 states have internal predecessors, (146), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2024-11-11 21:12:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1272 transitions. [2024-11-11 21:12:33,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-11 21:12:33,430 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:33,430 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:33,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 21:12:33,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:33,635 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:33,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash 719956669, now seen corresponding path program 1 times [2024-11-11 21:12:33,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:33,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163551542] [2024-11-11 21:12:33,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:33,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:33,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-11 21:12:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-11-11 21:12:33,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:33,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163551542] [2024-11-11 21:12:33,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163551542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:33,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592052119] [2024-11-11 21:12:33,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:33,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:33,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:33,843 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:33,845 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:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:34,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-11 21:12:34,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592052119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:34,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:34,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891959253] [2024-11-11 21:12:34,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:34,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:34,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:34,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:34,079 INFO L87 Difference]: Start difference. First operand 988 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 21:12:34,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:34,207 INFO L93 Difference]: Finished difference Result 1839 states and 2408 transitions. [2024-11-11 21:12:34,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:34,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 272 [2024-11-11 21:12:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:34,213 INFO L225 Difference]: With dead ends: 1839 [2024-11-11 21:12:34,213 INFO L226 Difference]: Without dead ends: 972 [2024-11-11 21:12:34,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:34,215 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 4 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:34,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 669 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 21:12:34,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-11 21:12:34,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2024-11-11 21:12:34,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 825 states have (on average 1.28) internal successors, (1056), 835 states have internal predecessors, (1056), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2024-11-11 21:12:34,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1239 transitions. [2024-11-11 21:12:34,271 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1239 transitions. Word has length 272 [2024-11-11 21:12:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:34,271 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1239 transitions. [2024-11-11 21:12:34,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 21:12:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1239 transitions. [2024-11-11 21:12:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-11 21:12:34,273 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:34,274 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:34,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 21:12:34,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2024-11-11 21:12:34,475 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:34,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:34,475 INFO L85 PathProgramCache]: Analyzing trace with hash -413206872, now seen corresponding path program 1 times [2024-11-11 21:12:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315355220] [2024-11-11 21:12:34,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:34,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:34,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-11 21:12:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 21:12:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-11 21:12:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-11 21:12:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-11-11 21:12:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-11 21:12:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-11 21:12:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-11 21:12:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-11 21:12:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2024-11-11 21:12:34,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:34,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315355220] [2024-11-11 21:12:34,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315355220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:34,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612352976] [2024-11-11 21:12:34,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:34,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:34,656 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:34,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 21:12:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:34,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 21:12:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2024-11-11 21:12:34,888 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:34,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612352976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:34,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:34,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-11 21:12:34,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727423071] [2024-11-11 21:12:34,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:34,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 21:12:34,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:34,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 21:12:34,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:34,890 INFO L87 Difference]: Start difference. First operand 972 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:34,979 INFO L93 Difference]: Finished difference Result 1687 states and 2192 transitions. [2024-11-11 21:12:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 21:12:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 275 [2024-11-11 21:12:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:34,985 INFO L225 Difference]: With dead ends: 1687 [2024-11-11 21:12:34,985 INFO L226 Difference]: Without dead ends: 827 [2024-11-11 21:12:34,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:34,988 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 4 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:34,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 697 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 21:12:34,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-11 21:12:35,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 827. [2024-11-11 21:12:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 698 states have (on average 1.2793696275071633) internal successors, (893), 708 states have internal predecessors, (893), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-11 21:12:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1054 transitions. [2024-11-11 21:12:35,043 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1054 transitions. Word has length 275 [2024-11-11 21:12:35,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:35,044 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1054 transitions. [2024-11-11 21:12:35,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 21:12:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1054 transitions. [2024-11-11 21:12:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2024-11-11 21:12:35,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:35,046 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:35,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 21:12:35,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:35,247 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:35,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 642796529, now seen corresponding path program 1 times [2024-11-11 21:12:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:35,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605617034] [2024-11-11 21:12:35,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-11 21:12:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-11 21:12:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 21:12:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2024-11-11 21:12:35,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605617034] [2024-11-11 21:12:35,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605617034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:35,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812542506] [2024-11-11 21:12:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:35,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:35,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:35,667 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:35,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 21:12:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:35,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 21:12:35,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-11 21:12:36,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:36,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812542506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2024-11-11 21:12:36,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533416388] [2024-11-11 21:12:36,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:36,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:12:36,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:36,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:12:36,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2024-11-11 21:12:36,074 INFO L87 Difference]: Start difference. First operand 827 states and 1054 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:36,697 INFO L93 Difference]: Finished difference Result 2212 states and 2831 transitions. [2024-11-11 21:12:36,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:12:36,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 287 [2024-11-11 21:12:36,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:36,705 INFO L225 Difference]: With dead ends: 2212 [2024-11-11 21:12:36,705 INFO L226 Difference]: Without dead ends: 1754 [2024-11-11 21:12:36,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-11 21:12:36,707 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 616 mSDsluCounter, 2212 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 2576 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:36,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 2576 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:36,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2024-11-11 21:12:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1388. [2024-11-11 21:12:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1161 states have (on average 1.2609819121447028) internal successors, (1464), 1176 states have internal predecessors, (1464), 149 states have call successors, (149), 78 states have call predecessors, (149), 77 states have return successors, (148), 140 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-11 21:12:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1761 transitions. [2024-11-11 21:12:36,810 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1761 transitions. Word has length 287 [2024-11-11 21:12:36,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:36,811 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1761 transitions. [2024-11-11 21:12:36,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 9 states have internal predecessors, (106), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1761 transitions. [2024-11-11 21:12:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-11 21:12:36,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:36,813 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:36,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 21:12:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-11 21:12:37,014 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:37,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash -346032050, now seen corresponding path program 1 times [2024-11-11 21:12:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410687342] [2024-11-11 21:12:37,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:37,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:37,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 21:12:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 21:12:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-11 21:12:37,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:37,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410687342] [2024-11-11 21:12:37,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410687342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:37,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:37,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 21:12:37,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154789547] [2024-11-11 21:12:37,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:37,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 21:12:37,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:37,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 21:12:37,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:37,296 INFO L87 Difference]: Start difference. First operand 1388 states and 1761 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:37,677 INFO L93 Difference]: Finished difference Result 2557 states and 3334 transitions. [2024-11-11 21:12:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 21:12:37,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-11 21:12:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:37,686 INFO L225 Difference]: With dead ends: 2557 [2024-11-11 21:12:37,686 INFO L226 Difference]: Without dead ends: 1523 [2024-11-11 21:12:37,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-11 21:12:37,690 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 106 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:37,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 655 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 21:12:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-11-11 21:12:37,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1481. [2024-11-11 21:12:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1233 states have (on average 1.2725060827250607) internal successors, (1569), 1248 states have internal predecessors, (1569), 170 states have call successors, (170), 78 states have call predecessors, (170), 77 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-11 21:12:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1908 transitions. [2024-11-11 21:12:37,809 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1908 transitions. Word has length 293 [2024-11-11 21:12:37,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:37,810 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 1908 transitions. [2024-11-11 21:12:37,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 6 states have internal predecessors, (97), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1908 transitions. [2024-11-11 21:12:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-11 21:12:37,812 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:37,812 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:37,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-11 21:12:37,812 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:37,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2118520266, now seen corresponding path program 1 times [2024-11-11 21:12:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:37,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820389123] [2024-11-11 21:12:37,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 21:12:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 21:12:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:12:38,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820389123] [2024-11-11 21:12:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820389123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812568575] [2024-11-11 21:12:38,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:38,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:38,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:38,306 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 21:12:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:38,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 21:12:38,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-11 21:12:38,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:38,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812568575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:38,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:38,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2024-11-11 21:12:38,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470885990] [2024-11-11 21:12:38,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:38,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:12:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:38,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:12:38,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:12:38,657 INFO L87 Difference]: Start difference. First operand 1481 states and 1908 transitions. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:39,339 INFO L93 Difference]: Finished difference Result 3493 states and 4501 transitions. [2024-11-11 21:12:39,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:12:39,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-11 21:12:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:39,350 INFO L225 Difference]: With dead ends: 3493 [2024-11-11 21:12:39,350 INFO L226 Difference]: Without dead ends: 2367 [2024-11-11 21:12:39,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:12:39,353 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 609 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:39,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2800 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-11 21:12:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1708. [2024-11-11 21:12:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1423 states have (on average 1.2621222768798313) internal successors, (1796), 1440 states have internal predecessors, (1796), 197 states have call successors, (197), 88 states have call predecessors, (197), 87 states have return successors, (196), 186 states have call predecessors, (196), 196 states have call successors, (196) [2024-11-11 21:12:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2189 transitions. [2024-11-11 21:12:39,481 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2189 transitions. Word has length 293 [2024-11-11 21:12:39,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:39,481 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2189 transitions. [2024-11-11 21:12:39,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 9 states have internal predecessors, (114), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2189 transitions. [2024-11-11 21:12:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-11 21:12:39,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:39,484 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:39,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:39,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-11 21:12:39,685 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:39,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1289392182, now seen corresponding path program 1 times [2024-11-11 21:12:39,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:39,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910278711] [2024-11-11 21:12:39,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:39,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:40,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 21:12:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 21:12:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-11 21:12:40,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910278711] [2024-11-11 21:12:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910278711] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130098465] [2024-11-11 21:12:40,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:40,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:40,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:40,139 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:40,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-11 21:12:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:40,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-11 21:12:40,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-11 21:12:40,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 21:12:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130098465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:40,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 21:12:40,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 12 [2024-11-11 21:12:40,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617598262] [2024-11-11 21:12:40,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:40,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 21:12:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 21:12:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-11 21:12:40,544 INFO L87 Difference]: Start difference. First operand 1708 states and 2189 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:41,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:41,185 INFO L93 Difference]: Finished difference Result 3425 states and 4396 transitions. [2024-11-11 21:12:41,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-11 21:12:41,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 293 [2024-11-11 21:12:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:41,198 INFO L225 Difference]: With dead ends: 3425 [2024-11-11 21:12:41,198 INFO L226 Difference]: Without dead ends: 2148 [2024-11-11 21:12:41,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2024-11-11 21:12:41,202 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 598 mSDsluCounter, 2400 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:41,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 2769 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2024-11-11 21:12:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1674. [2024-11-11 21:12:41,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1674 states, 1399 states have (on average 1.2551822730521802) internal successors, (1756), 1416 states have internal predecessors, (1756), 187 states have call successors, (187), 88 states have call predecessors, (187), 87 states have return successors, (186), 176 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-11 21:12:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1674 states to 1674 states and 2129 transitions. [2024-11-11 21:12:41,337 INFO L78 Accepts]: Start accepts. Automaton has 1674 states and 2129 transitions. Word has length 293 [2024-11-11 21:12:41,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:41,338 INFO L471 AbstractCegarLoop]: Abstraction has 1674 states and 2129 transitions. [2024-11-11 21:12:41,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 9 states have internal predecessors, (112), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-11 21:12:41,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1674 states and 2129 transitions. [2024-11-11 21:12:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-11 21:12:41,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:41,340 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:41,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-11 21:12:41,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-11 21:12:41,545 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:41,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:41,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1222506872, now seen corresponding path program 1 times [2024-11-11 21:12:41,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:41,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075770850] [2024-11-11 21:12:41,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:41,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:41,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-11 21:12:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-11 21:12:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-11 21:12:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2024-11-11 21:12:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2024-11-11 21:12:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075770850] [2024-11-11 21:12:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075770850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:41,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 21:12:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240041137] [2024-11-11 21:12:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:41,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 21:12:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 21:12:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 21:12:41,867 INFO L87 Difference]: Start difference. First operand 1674 states and 2129 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-11 21:12:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:42,425 INFO L93 Difference]: Finished difference Result 2995 states and 3845 transitions. [2024-11-11 21:12:42,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 21:12:42,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 293 [2024-11-11 21:12:42,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:42,436 INFO L225 Difference]: With dead ends: 2995 [2024-11-11 21:12:42,436 INFO L226 Difference]: Without dead ends: 1693 [2024-11-11 21:12:42,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 21:12:42,439 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 298 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:42,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 680 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 21:12:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-11-11 21:12:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 1570. [2024-11-11 21:12:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1310 states have (on average 1.2557251908396947) internal successors, (1645), 1326 states have internal predecessors, (1645), 177 states have call successors, (177), 83 states have call predecessors, (177), 82 states have return successors, (176), 167 states have call predecessors, (176), 176 states have call successors, (176) [2024-11-11 21:12:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1998 transitions. [2024-11-11 21:12:42,594 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1998 transitions. Word has length 293 [2024-11-11 21:12:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:42,595 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1998 transitions. [2024-11-11 21:12:42,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2024-11-11 21:12:42,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1998 transitions. [2024-11-11 21:12:42,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2024-11-11 21:12:42,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:42,599 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:42,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-11 21:12:42,599 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:42,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash 671266223, now seen corresponding path program 1 times [2024-11-11 21:12:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:42,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016919756] [2024-11-11 21:12:42,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:42,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-11 21:12:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-11 21:12:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-11 21:12:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-11 21:12:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-11 21:12:42,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:42,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016919756] [2024-11-11 21:12:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016919756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:42,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029173765] [2024-11-11 21:12:42,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:42,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:42,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:42,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:42,860 INFO L87 Difference]: Start difference. First operand 1570 states and 1998 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 21:12:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:43,464 INFO L93 Difference]: Finished difference Result 2830 states and 3623 transitions. [2024-11-11 21:12:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 21:12:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 300 [2024-11-11 21:12:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:43,473 INFO L225 Difference]: With dead ends: 2830 [2024-11-11 21:12:43,473 INFO L226 Difference]: Without dead ends: 1625 [2024-11-11 21:12:43,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:43,477 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 352 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:43,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1006 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:12:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-11 21:12:43,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1386. [2024-11-11 21:12:43,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1164 states have (on average 1.2336769759450172) internal successors, (1436), 1172 states have internal predecessors, (1436), 151 states have call successors, (151), 70 states have call predecessors, (151), 70 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-11 21:12:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1738 transitions. [2024-11-11 21:12:43,583 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1738 transitions. Word has length 300 [2024-11-11 21:12:43,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:43,584 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1738 transitions. [2024-11-11 21:12:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-11 21:12:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1738 transitions. [2024-11-11 21:12:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-11 21:12:43,588 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:43,588 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:43,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-11 21:12:43,588 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:43,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:43,589 INFO L85 PathProgramCache]: Analyzing trace with hash -427609222, now seen corresponding path program 1 times [2024-11-11 21:12:43,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:43,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116135955] [2024-11-11 21:12:43,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-11 21:12:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-11 21:12:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-11 21:12:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-11 21:12:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-11 21:12:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-11 21:12:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-11 21:12:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2024-11-11 21:12:44,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:44,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116135955] [2024-11-11 21:12:44,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116135955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:44,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:44,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 21:12:44,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280861110] [2024-11-11 21:12:44,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:44,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 21:12:44,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:44,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 21:12:44,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 21:12:44,597 INFO L87 Difference]: Start difference. First operand 1386 states and 1738 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-11 21:12:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:45,314 INFO L93 Difference]: Finished difference Result 2824 states and 3571 transitions. [2024-11-11 21:12:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 21:12:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 342 [2024-11-11 21:12:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:45,323 INFO L225 Difference]: With dead ends: 2824 [2024-11-11 21:12:45,323 INFO L226 Difference]: Without dead ends: 1810 [2024-11-11 21:12:45,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-11 21:12:45,327 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 134 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:45,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1180 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 21:12:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-11 21:12:45,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1548. [2024-11-11 21:12:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1548 states, 1286 states have (on average 1.2332814930015552) internal successors, (1586), 1297 states have internal predecessors, (1586), 170 states have call successors, (170), 82 states have call predecessors, (170), 91 states have return successors, (185), 168 states have call predecessors, (185), 170 states have call successors, (185) [2024-11-11 21:12:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 1941 transitions. [2024-11-11 21:12:45,489 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 1941 transitions. Word has length 342 [2024-11-11 21:12:45,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:45,490 INFO L471 AbstractCegarLoop]: Abstraction has 1548 states and 1941 transitions. [2024-11-11 21:12:45,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 6 states have internal predecessors, (103), 3 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-11 21:12:45,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 1941 transitions. [2024-11-11 21:12:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-11 21:12:45,494 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:45,494 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 21:12:45,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-11 21:12:45,495 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:45,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash -624122727, now seen corresponding path program 1 times [2024-11-11 21:12:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357108182] [2024-11-11 21:12:45,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-11 21:12:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-11 21:12:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-11 21:12:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-11 21:12:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-11 21:12:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-11 21:12:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-11 21:12:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-11 21:12:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:45,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357108182] [2024-11-11 21:12:45,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357108182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 21:12:45,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 21:12:45,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 21:12:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054733170] [2024-11-11 21:12:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 21:12:45,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 21:12:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:45,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 21:12:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 21:12:45,721 INFO L87 Difference]: Start difference. First operand 1548 states and 1941 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-11 21:12:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 21:12:46,091 INFO L93 Difference]: Finished difference Result 3119 states and 3918 transitions. [2024-11-11 21:12:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 21:12:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 342 [2024-11-11 21:12:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 21:12:46,099 INFO L225 Difference]: With dead ends: 3119 [2024-11-11 21:12:46,100 INFO L226 Difference]: Without dead ends: 1512 [2024-11-11 21:12:46,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 21:12:46,104 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 97 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 21:12:46,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 604 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 21:12:46,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-11 21:12:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-11-11 21:12:46,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1259 states have (on average 1.2025416997617155) internal successors, (1514), 1270 states have internal predecessors, (1514), 170 states have call successors, (170), 82 states have call predecessors, (170), 82 states have return successors, (170), 159 states have call predecessors, (170), 170 states have call successors, (170) [2024-11-11 21:12:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1854 transitions. [2024-11-11 21:12:46,224 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1854 transitions. Word has length 342 [2024-11-11 21:12:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 21:12:46,225 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 1854 transitions. [2024-11-11 21:12:46,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-11 21:12:46,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1854 transitions. [2024-11-11 21:12:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2024-11-11 21:12:46,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 21:12:46,233 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 21:12:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-11 21:12:46,233 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 21:12:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 21:12:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash -505510017, now seen corresponding path program 1 times [2024-11-11 21:12:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 21:12:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176671806] [2024-11-11 21:12:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 21:12:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 21:12:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-11 21:12:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-11 21:12:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 21:12:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 21:12:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 21:12:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 21:12:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 21:12:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 21:12:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 21:12:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-11 21:12:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 21:12:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 21:12:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 21:12:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 21:12:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-11 21:12:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-11 21:12:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-11 21:12:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-11 21:12:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-11 21:12:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-11 21:12:47,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-11 21:12:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-11 21:12:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-11 21:12:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-11 21:12:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-11-11 21:12:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-11-11 21:12:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-11-11 21:12:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-11 21:12:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-11 21:12:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 51 proven. 53 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2024-11-11 21:12:47,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 21:12:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176671806] [2024-11-11 21:12:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176671806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 21:12:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818861766] [2024-11-11 21:12:47,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 21:12:47,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 21:12:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 21:12:47,700 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 21:12:47,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-11 21:12:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 21:12:47,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-11 21:12:47,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 21:12:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 275 proven. 64 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2024-11-11 21:12:48,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 21:12:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2024-11-11 21:12:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818861766] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 21:12:49,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 21:12:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 12] total 33 [2024-11-11 21:12:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681183910] [2024-11-11 21:12:49,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 21:12:49,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-11 21:12:49,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 21:12:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-11 21:12:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2024-11-11 21:12:49,415 INFO L87 Difference]: Start difference. First operand 1512 states and 1854 transitions. Second operand has 33 states, 32 states have (on average 10.90625) internal successors, (349), 29 states have internal predecessors, (349), 14 states have call successors, (67), 8 states have call predecessors, (67), 11 states have return successors, (65), 15 states have call predecessors, (65), 13 states have call successors, (65)