./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.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 f3efee8c660a339e6d13fe6728631748153baced66b17ec0d4ea728c6f50decb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 00:46:23,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 00:46:23,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 00:46:23,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 00:46:23,627 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 00:46:23,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 00:46:23,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 00:46:23,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 00:46:23,652 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 00:46:23,654 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 00:46:23,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 00:46:23,655 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 00:46:23,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 00:46:23,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 00:46:23,658 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 00:46:23,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 00:46:23,659 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 00:46:23,659 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 00:46:23,659 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 00:46:23,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 00:46:23,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 00:46:23,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 00:46:23,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 00:46:23,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 00:46:23,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 00:46:23,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 00:46:23,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 00:46:23,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 00:46:23,665 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 00:46:23,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 00:46:23,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 00:46:23,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 00:46:23,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:46:23,666 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 00:46:23,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 00:46:23,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 00:46:23,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 00:46:23,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 00:46:23,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 00:46:23,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 00:46:23,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 00:46:23,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 00:46:23,670 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 -> f3efee8c660a339e6d13fe6728631748153baced66b17ec0d4ea728c6f50decb [2024-11-10 00:46:23,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 00:46:23,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 00:46:23,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 00:46:23,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 00:46:23,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 00:46:23,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:46:25,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 00:46:25,812 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 00:46:25,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:46:25,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e130ec023/1d9b10e018d040b1ad816a1219332f68/FLAG87e049219 [2024-11-10 00:46:25,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e130ec023/1d9b10e018d040b1ad816a1219332f68 [2024-11-10 00:46:25,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 00:46:25,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 00:46:25,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 00:46:25,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 00:46:25,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 00:46:25,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:46:25" (1/1) ... [2024-11-10 00:46:25,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4971b652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:25, skipping insertion in model container [2024-11-10 00:46:25,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:46:25" (1/1) ... [2024-11-10 00:46:25,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 00:46:26,389 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/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c[6487,6500] [2024-11-10 00:46:26,462 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/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c[14235,14248] [2024-11-10 00:46:27,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:46:27,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 00:46:27,142 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/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c[6487,6500] [2024-11-10 00:46:27,162 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/combinations/pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c[14235,14248] [2024-11-10 00:46:27,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 00:46:27,599 INFO L204 MainTranslator]: Completed translation [2024-11-10 00:46:27,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27 WrapperNode [2024-11-10 00:46:27,600 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 00:46:27,601 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 00:46:27,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 00:46:27,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 00:46:27,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:27,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:27,927 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4982 [2024-11-10 00:46:27,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 00:46:27,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 00:46:27,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 00:46:27,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 00:46:27,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:27,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:27,980 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,154 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-10 00:46:28,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 00:46:28,400 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 00:46:28,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 00:46:28,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 00:46:28,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (1/1) ... [2024-11-10 00:46:28,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 00:46:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:28,437 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-10 00:46:28,440 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-10 00:46:28,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 00:46:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 00:46:28,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 00:46:28,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 00:46:28,596 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 00:46:28,598 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 00:46:33,919 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1989: havoc calculate_output_#t~ret29#1; [2024-11-10 00:46:33,919 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L3468: havoc calculate_output2_#t~ret30#1; [2024-11-10 00:46:33,920 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L4958: havoc calculate_output3_#t~ret31#1; [2024-11-10 00:46:34,313 INFO L? ?]: Removed 2071 outVars from TransFormulas that were not future-live. [2024-11-10 00:46:34,313 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 00:46:34,352 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 00:46:34,352 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 00:46:34,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:46:34 BoogieIcfgContainer [2024-11-10 00:46:34,353 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 00:46:34,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 00:46:34,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 00:46:34,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 00:46:34,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:46:25" (1/3) ... [2024-11-10 00:46:34,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c70c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:46:34, skipping insertion in model container [2024-11-10 00:46:34,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:46:27" (2/3) ... [2024-11-10 00:46:34,359 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c70c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:46:34, skipping insertion in model container [2024-11-10 00:46:34,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 12:46:34" (3/3) ... [2024-11-10 00:46:34,361 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals+Problem12_label09.c [2024-11-10 00:46:34,376 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 00:46:34,377 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 00:46:34,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 00:46:34,477 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;@31a3d8ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 00:46:34,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 00:46:34,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:46:34,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:34,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:34,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 516537996, now seen corresponding path program 1 times [2024-11-10 00:46:34,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:34,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442926807] [2024-11-10 00:46:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:34,761 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-10 00:46:34,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:34,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442926807] [2024-11-10 00:46:34,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442926807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:34,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:34,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 00:46:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259723810] [2024-11-10 00:46:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:34,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 00:46:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:34,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 00:46:34,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:46:34,799 INFO L87 Difference]: Start difference. First operand has 881 states, 878 states have (on average 2.673120728929385) internal successors, (2347), 880 states have internal predecessors, (2347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:34,894 INFO L93 Difference]: Finished difference Result 1736 states and 4650 transitions. [2024-11-10 00:46:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 00:46:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:46:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:34,915 INFO L225 Difference]: With dead ends: 1736 [2024-11-10 00:46:34,915 INFO L226 Difference]: Without dead ends: 813 [2024-11-10 00:46:34,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 00:46:34,923 INFO L432 NwaCegarLoop]: 2276 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:34,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2276 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:34,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-10 00:46:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-11-10 00:46:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 2.727496917385943) internal successors, (2212), 812 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 2212 transitions. [2024-11-10 00:46:35,027 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 2212 transitions. Word has length 22 [2024-11-10 00:46:35,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:35,027 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 2212 transitions. [2024-11-10 00:46:35,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 2212 transitions. [2024-11-10 00:46:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 00:46:35,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:35,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:35,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 00:46:35,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:35,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:35,031 INFO L85 PathProgramCache]: Analyzing trace with hash 6003819, now seen corresponding path program 1 times [2024-11-10 00:46:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:35,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85970185] [2024-11-10 00:46:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:35,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:35,239 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-10 00:46:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:35,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85970185] [2024-11-10 00:46:35,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85970185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:35,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:35,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687712135] [2024-11-10 00:46:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:35,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:35,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:35,246 INFO L87 Difference]: Start difference. First operand 813 states and 2212 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:35,357 INFO L93 Difference]: Finished difference Result 852 states and 2269 transitions. [2024-11-10 00:46:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:35,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 00:46:35,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:35,364 INFO L225 Difference]: With dead ends: 852 [2024-11-10 00:46:35,364 INFO L226 Difference]: Without dead ends: 813 [2024-11-10 00:46:35,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10 00:46:35,366 INFO L432 NwaCegarLoop]: 2210 mSDtfsCounter, 0 mSDsluCounter, 6609 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8819 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:35,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8819 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2024-11-10 00:46:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2024-11-10 00:46:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 811 states have (on average 2.7077681874229347) internal successors, (2196), 812 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 2196 transitions. [2024-11-10 00:46:35,389 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 2196 transitions. Word has length 22 [2024-11-10 00:46:35,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:35,389 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 2196 transitions. [2024-11-10 00:46:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 2196 transitions. [2024-11-10 00:46:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 00:46:35,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:35,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:35,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 00:46:35,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:35,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1519636538, now seen corresponding path program 1 times [2024-11-10 00:46:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:35,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533491958] [2024-11-10 00:46:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:35,517 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-10 00:46:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533491958] [2024-11-10 00:46:35,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533491958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:35,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:35,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:35,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499745290] [2024-11-10 00:46:35,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:35,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:35,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:35,520 INFO L87 Difference]: Start difference. First operand 813 states and 2196 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:35,663 INFO L93 Difference]: Finished difference Result 1023 states and 2514 transitions. [2024-11-10 00:46:35,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 00:46:35,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-10 00:46:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:35,670 INFO L225 Difference]: With dead ends: 1023 [2024-11-10 00:46:35,671 INFO L226 Difference]: Without dead ends: 988 [2024-11-10 00:46:35,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:46:35,673 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 6708 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6708 SdHoareTripleChecker+Valid, 2492 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:35,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6708 Valid, 2492 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 00:46:35,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-10 00:46:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 845. [2024-11-10 00:46:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 2.663107947805457) internal successors, (2245), 844 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2245 transitions. [2024-11-10 00:46:35,705 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2245 transitions. Word has length 37 [2024-11-10 00:46:35,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:35,706 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 2245 transitions. [2024-11-10 00:46:35,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:35,706 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2245 transitions. [2024-11-10 00:46:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-10 00:46:35,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:35,708 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:35,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 00:46:35,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:35,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2087439128, now seen corresponding path program 1 times [2024-11-10 00:46:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:35,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230238922] [2024-11-10 00:46:35,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:35,943 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-10 00:46:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230238922] [2024-11-10 00:46:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230238922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:35,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:35,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:35,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020453749] [2024-11-10 00:46:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:35,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:35,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:35,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:35,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:35,946 INFO L87 Difference]: Start difference. First operand 845 states and 2245 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:36,049 INFO L93 Difference]: Finished difference Result 915 states and 2349 transitions. [2024-11-10 00:46:36,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:36,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-10 00:46:36,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:36,053 INFO L225 Difference]: With dead ends: 915 [2024-11-10 00:46:36,053 INFO L226 Difference]: Without dead ends: 848 [2024-11-10 00:46:36,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 00:46:36,056 INFO L432 NwaCegarLoop]: 2191 mSDtfsCounter, 6478 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6478 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:36,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6478 Valid, 2289 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:36,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-10 00:46:36,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 845. [2024-11-10 00:46:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 843 states have (on average 2.6619217081850532) internal successors, (2244), 844 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 2244 transitions. [2024-11-10 00:46:36,077 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 2244 transitions. Word has length 39 [2024-11-10 00:46:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:36,077 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 2244 transitions. [2024-11-10 00:46:36,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,078 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 2244 transitions. [2024-11-10 00:46:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 00:46:36,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:36,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:36,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 00:46:36,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:36,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:36,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1437715677, now seen corresponding path program 1 times [2024-11-10 00:46:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890904171] [2024-11-10 00:46:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:36,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:36,167 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-10 00:46:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890904171] [2024-11-10 00:46:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890904171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:36,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:36,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478796338] [2024-11-10 00:46:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:36,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:36,169 INFO L87 Difference]: Start difference. First operand 845 states and 2244 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:36,210 INFO L93 Difference]: Finished difference Result 967 states and 2426 transitions. [2024-11-10 00:46:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:36,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-10 00:46:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:36,215 INFO L225 Difference]: With dead ends: 967 [2024-11-10 00:46:36,215 INFO L226 Difference]: Without dead ends: 900 [2024-11-10 00:46:36,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:36,218 INFO L432 NwaCegarLoop]: 2192 mSDtfsCounter, 2152 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:36,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 2238 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-11-10 00:46:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 895. [2024-11-10 00:46:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 893 states have (on average 2.593505039193729) internal successors, (2316), 894 states have internal predecessors, (2316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2316 transitions. [2024-11-10 00:46:36,243 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2316 transitions. Word has length 40 [2024-11-10 00:46:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:36,244 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 2316 transitions. [2024-11-10 00:46:36,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,244 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2316 transitions. [2024-11-10 00:46:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:46:36,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:36,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:36,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 00:46:36,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:36,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1044566890, now seen corresponding path program 1 times [2024-11-10 00:46:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:36,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198596291] [2024-11-10 00:46:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:36,296 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-10 00:46:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198596291] [2024-11-10 00:46:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198596291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:36,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:36,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598382641] [2024-11-10 00:46:36,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:36,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:36,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:36,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:36,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:36,299 INFO L87 Difference]: Start difference. First operand 895 states and 2316 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:36,333 INFO L93 Difference]: Finished difference Result 1113 states and 2634 transitions. [2024-11-10 00:46:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:46:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:36,338 INFO L225 Difference]: With dead ends: 1113 [2024-11-10 00:46:36,339 INFO L226 Difference]: Without dead ends: 996 [2024-11-10 00:46:36,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:36,340 INFO L432 NwaCegarLoop]: 2225 mSDtfsCounter, 2161 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:36,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 2283 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-11-10 00:46:36,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 993. [2024-11-10 00:46:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 991 states have (on average 2.477295660948537) internal successors, (2455), 992 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 2455 transitions. [2024-11-10 00:46:36,371 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 2455 transitions. Word has length 41 [2024-11-10 00:46:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 993 states and 2455 transitions. [2024-11-10 00:46:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 2455 transitions. [2024-11-10 00:46:36,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:46:36,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:36,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:36,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 00:46:36,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:36,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:36,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1158797654, now seen corresponding path program 1 times [2024-11-10 00:46:36,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:36,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726805013] [2024-11-10 00:46:36,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:36,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:36,432 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-10 00:46:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726805013] [2024-11-10 00:46:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726805013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:36,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441674815] [2024-11-10 00:46:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:36,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:36,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:36,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:36,434 INFO L87 Difference]: Start difference. First operand 993 states and 2455 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:36,470 INFO L93 Difference]: Finished difference Result 1391 states and 3023 transitions. [2024-11-10 00:46:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:46:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:36,475 INFO L225 Difference]: With dead ends: 1391 [2024-11-10 00:46:36,476 INFO L226 Difference]: Without dead ends: 1176 [2024-11-10 00:46:36,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:36,479 INFO L432 NwaCegarLoop]: 2223 mSDtfsCounter, 2159 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 2285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:36,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 2285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2024-11-10 00:46:36,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1173. [2024-11-10 00:46:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1171 states have (on average 2.3065755764304012) internal successors, (2701), 1172 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 2701 transitions. [2024-11-10 00:46:36,511 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 2701 transitions. Word has length 41 [2024-11-10 00:46:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:36,511 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 2701 transitions. [2024-11-10 00:46:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 2701 transitions. [2024-11-10 00:46:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 00:46:36,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:36,512 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:36,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 00:46:36,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:36,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1683074709, now seen corresponding path program 1 times [2024-11-10 00:46:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:36,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799018092] [2024-11-10 00:46:36,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:36,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:36,702 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-10 00:46:36,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:36,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799018092] [2024-11-10 00:46:36,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799018092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:36,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:36,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 00:46:36,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005309483] [2024-11-10 00:46:36,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:36,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 00:46:36,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:36,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 00:46:36,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:46:36,705 INFO L87 Difference]: Start difference. First operand 1173 states and 2701 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:36,801 INFO L93 Difference]: Finished difference Result 1200 states and 2735 transitions. [2024-11-10 00:46:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 00:46:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 00:46:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:36,807 INFO L225 Difference]: With dead ends: 1200 [2024-11-10 00:46:36,808 INFO L226 Difference]: Without dead ends: 1197 [2024-11-10 00:46:36,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 00:46:36,809 INFO L432 NwaCegarLoop]: 2190 mSDtfsCounter, 0 mSDsluCounter, 13127 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15317 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:36,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15317 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-10 00:46:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1197. [2024-11-10 00:46:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1195 states have (on average 2.276987447698745) internal successors, (2721), 1196 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 2721 transitions. [2024-11-10 00:46:36,840 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 2721 transitions. Word has length 41 [2024-11-10 00:46:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:36,841 INFO L471 AbstractCegarLoop]: Abstraction has 1197 states and 2721 transitions. [2024-11-10 00:46:36,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 2721 transitions. [2024-11-10 00:46:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 00:46:36,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:36,842 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:36,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 00:46:36,842 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:36,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1278516470, now seen corresponding path program 1 times [2024-11-10 00:46:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:36,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473699809] [2024-11-10 00:46:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:36,893 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-10 00:46:36,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473699809] [2024-11-10 00:46:36,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473699809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:36,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:36,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:36,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889805912] [2024-11-10 00:46:36,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:36,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:36,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:36,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:36,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:36,895 INFO L87 Difference]: Start difference. First operand 1197 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:36,929 INFO L93 Difference]: Finished difference Result 1655 states and 3362 transitions. [2024-11-10 00:46:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:36,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-10 00:46:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:36,938 INFO L225 Difference]: With dead ends: 1655 [2024-11-10 00:46:36,938 INFO L226 Difference]: Without dead ends: 1403 [2024-11-10 00:46:36,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:36,940 INFO L432 NwaCegarLoop]: 2230 mSDtfsCounter, 2160 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2160 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:36,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2160 Valid, 2284 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:36,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-10 00:46:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1400. [2024-11-10 00:46:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1398 states have (on average 2.140200286123033) internal successors, (2992), 1399 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 2992 transitions. [2024-11-10 00:46:36,974 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 2992 transitions. Word has length 43 [2024-11-10 00:46:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:36,974 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 2992 transitions. [2024-11-10 00:46:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 2992 transitions. [2024-11-10 00:46:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:46:36,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:36,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 00:46:36,976 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:36,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 2051803116, now seen corresponding path program 1 times [2024-11-10 00:46:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:36,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500672076] [2024-11-10 00:46:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 00:46:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:37,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500672076] [2024-11-10 00:46:37,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500672076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:37,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:37,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742700178] [2024-11-10 00:46:37,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:37,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:37,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:37,139 INFO L87 Difference]: Start difference. First operand 1400 states and 2992 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:37,243 INFO L93 Difference]: Finished difference Result 3404 states and 5720 transitions. [2024-11-10 00:46:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:37,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:46:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:37,255 INFO L225 Difference]: With dead ends: 3404 [2024-11-10 00:46:37,255 INFO L226 Difference]: Without dead ends: 2785 [2024-11-10 00:46:37,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:46:37,257 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4428 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4428 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:37,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4428 Valid, 4538 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:37,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-11-10 00:46:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2016. [2024-11-10 00:46:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2016 states, 2014 states have (on average 1.8987090367428003) internal successors, (3824), 2015 states have internal predecessors, (3824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2016 states to 2016 states and 3824 transitions. [2024-11-10 00:46:37,365 INFO L78 Accepts]: Start accepts. Automaton has 2016 states and 3824 transitions. Word has length 58 [2024-11-10 00:46:37,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:37,366 INFO L471 AbstractCegarLoop]: Abstraction has 2016 states and 3824 transitions. [2024-11-10 00:46:37,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2016 states and 3824 transitions. [2024-11-10 00:46:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-10 00:46:37,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:37,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:37,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 00:46:37,367 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:37,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -151561428, now seen corresponding path program 1 times [2024-11-10 00:46:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:37,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423832995] [2024-11-10 00:46:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:37,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 00:46:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423832995] [2024-11-10 00:46:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423832995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:37,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:37,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:37,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506184200] [2024-11-10 00:46:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:37,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:37,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:37,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:37,493 INFO L87 Difference]: Start difference. First operand 2016 states and 3824 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:37,608 INFO L93 Difference]: Finished difference Result 4020 states and 6552 transitions. [2024-11-10 00:46:37,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:37,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-11-10 00:46:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:37,622 INFO L225 Difference]: With dead ends: 4020 [2024-11-10 00:46:37,623 INFO L226 Difference]: Without dead ends: 3401 [2024-11-10 00:46:37,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:46:37,625 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 4433 mSDsluCounter, 2287 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4433 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:37,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4433 Valid, 4527 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2024-11-10 00:46:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 2944. [2024-11-10 00:46:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2942 states have (on average 1.7212780421481986) internal successors, (5064), 2943 states have internal predecessors, (5064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 5064 transitions. [2024-11-10 00:46:37,700 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 5064 transitions. Word has length 58 [2024-11-10 00:46:37,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:37,701 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 5064 transitions. [2024-11-10 00:46:37,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,701 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 5064 transitions. [2024-11-10 00:46:37,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:46:37,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:37,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:37,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 00:46:37,702 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:37,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1612801138, now seen corresponding path program 1 times [2024-11-10 00:46:37,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:37,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647661769] [2024-11-10 00:46:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:37,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:37,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:37,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647661769] [2024-11-10 00:46:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647661769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:37,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:37,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:37,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360907645] [2024-11-10 00:46:37,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:37,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:37,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:37,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:37,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:37,796 INFO L87 Difference]: Start difference. First operand 2944 states and 5064 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:37,848 INFO L93 Difference]: Finished difference Result 4536 states and 7243 transitions. [2024-11-10 00:46:37,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:37,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:46:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:37,858 INFO L225 Difference]: With dead ends: 4536 [2024-11-10 00:46:37,858 INFO L226 Difference]: Without dead ends: 2373 [2024-11-10 00:46:37,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:37,862 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 35 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 4403 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-10 00:46:37,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 4403 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2024-11-10 00:46:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2370. [2024-11-10 00:46:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2370 states, 2368 states have (on average 1.8133445945945945) internal successors, (4294), 2369 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2370 states to 2370 states and 4294 transitions. [2024-11-10 00:46:37,917 INFO L78 Accepts]: Start accepts. Automaton has 2370 states and 4294 transitions. Word has length 60 [2024-11-10 00:46:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 2370 states and 4294 transitions. [2024-11-10 00:46:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2370 states and 4294 transitions. [2024-11-10 00:46:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 00:46:37,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:37,918 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:37,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 00:46:37,919 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:37,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash 307855116, now seen corresponding path program 1 times [2024-11-10 00:46:37,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:37,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438177995] [2024-11-10 00:46:37,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:37,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:38,020 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:46:38,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438177995] [2024-11-10 00:46:38,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438177995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:38,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:38,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 00:46:38,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151258863] [2024-11-10 00:46:38,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:38,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 00:46:38,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:38,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 00:46:38,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 00:46:38,022 INFO L87 Difference]: Start difference. First operand 2370 states and 4294 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:38,122 INFO L93 Difference]: Finished difference Result 3726 states and 6150 transitions. [2024-11-10 00:46:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 00:46:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-10 00:46:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:38,134 INFO L225 Difference]: With dead ends: 3726 [2024-11-10 00:46:38,138 INFO L226 Difference]: Without dead ends: 3275 [2024-11-10 00:46:38,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 00:46:38,141 INFO L432 NwaCegarLoop]: 2236 mSDtfsCounter, 4431 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4431 SdHoareTripleChecker+Valid, 4554 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:38,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4431 Valid, 4554 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2024-11-10 00:46:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2818. [2024-11-10 00:46:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2816 states have (on average 1.7407670454545454) internal successors, (4902), 2817 states have internal predecessors, (4902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4902 transitions. [2024-11-10 00:46:38,207 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 4902 transitions. Word has length 60 [2024-11-10 00:46:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:38,208 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 4902 transitions. [2024-11-10 00:46:38,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4902 transitions. [2024-11-10 00:46:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 00:46:38,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:38,209 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:38,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 00:46:38,210 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:38,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1785383598, now seen corresponding path program 1 times [2024-11-10 00:46:38,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:38,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477738710] [2024-11-10 00:46:38,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:38,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477738710] [2024-11-10 00:46:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477738710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243166370] [2024-11-10 00:46:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:38,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:38,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:38,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:38,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:38,290 INFO L87 Difference]: Start difference. First operand 2818 states and 4902 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:38,338 INFO L93 Difference]: Finished difference Result 3832 states and 6274 transitions. [2024-11-10 00:46:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:38,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-10 00:46:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:38,344 INFO L225 Difference]: With dead ends: 3832 [2024-11-10 00:46:38,344 INFO L226 Difference]: Without dead ends: 1813 [2024-11-10 00:46:38,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:38,350 INFO L432 NwaCegarLoop]: 2215 mSDtfsCounter, 28 mSDsluCounter, 2173 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 4388 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-10 00:46:38,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 4388 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-10 00:46:38,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1810. [2024-11-10 00:46:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1808 states have (on average 1.9446902654867257) internal successors, (3516), 1809 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 3516 transitions. [2024-11-10 00:46:38,400 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 3516 transitions. Word has length 62 [2024-11-10 00:46:38,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:38,401 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 3516 transitions. [2024-11-10 00:46:38,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 3516 transitions. [2024-11-10 00:46:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 00:46:38,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:38,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:38,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 00:46:38,405 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:38,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash -909439056, now seen corresponding path program 1 times [2024-11-10 00:46:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:38,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091154712] [2024-11-10 00:46:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:38,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:38,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:38,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091154712] [2024-11-10 00:46:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091154712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:46:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:46:38,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:46:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57814497] [2024-11-10 00:46:38,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:46:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 00:46:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 00:46:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 00:46:38,493 INFO L87 Difference]: Start difference. First operand 1810 states and 3516 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:38,573 INFO L93 Difference]: Finished difference Result 2320 states and 4195 transitions. [2024-11-10 00:46:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 00:46:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 00:46:38,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:38,577 INFO L225 Difference]: With dead ends: 2320 [2024-11-10 00:46:38,578 INFO L226 Difference]: Without dead ends: 1309 [2024-11-10 00:46:38,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10 00:46:38,579 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 23 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4373 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-10 00:46:38,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4373 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 00:46:38,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-11-10 00:46:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1306. [2024-11-10 00:46:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 1304 states have (on average 2.1717791411042944) internal successors, (2832), 1305 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 2832 transitions. [2024-11-10 00:46:38,617 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 2832 transitions. Word has length 64 [2024-11-10 00:46:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:38,618 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 2832 transitions. [2024-11-10 00:46:38,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 2832 transitions. [2024-11-10 00:46:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:46:38,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:38,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:38,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 00:46:38,620 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1765907433, now seen corresponding path program 1 times [2024-11-10 00:46:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004976367] [2024-11-10 00:46:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:39,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004976367] [2024-11-10 00:46:39,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004976367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:39,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170947356] [2024-11-10 00:46:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:39,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:39,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:39,128 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-10 00:46:39,129 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-10 00:46:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:39,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 00:46:39,298 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:39,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:40,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170947356] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:40,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:40,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-10 00:46:40,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625828397] [2024-11-10 00:46:40,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:40,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 00:46:40,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 00:46:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-10 00:46:40,708 INFO L87 Difference]: Start difference. First operand 1306 states and 2832 transitions. Second operand has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:41,251 INFO L93 Difference]: Finished difference Result 2377 states and 4251 transitions. [2024-11-10 00:46:41,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 00:46:41,252 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 00:46:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:41,256 INFO L225 Difference]: With dead ends: 2377 [2024-11-10 00:46:41,257 INFO L226 Difference]: Without dead ends: 1870 [2024-11-10 00:46:41,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2024-11-10 00:46:41,258 INFO L432 NwaCegarLoop]: 2177 mSDtfsCounter, 22149 mSDsluCounter, 6786 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22149 SdHoareTripleChecker+Valid, 8963 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:41,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22149 Valid, 8963 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 00:46:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2024-11-10 00:46:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1846. [2024-11-10 00:46:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1844 states have (on average 1.9116052060737527) internal successors, (3525), 1845 states have internal predecessors, (3525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 3525 transitions. [2024-11-10 00:46:41,300 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 3525 transitions. Word has length 66 [2024-11-10 00:46:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:41,301 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 3525 transitions. [2024-11-10 00:46:41,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.818181818181818) internal successors, (150), 21 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 3525 transitions. [2024-11-10 00:46:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 00:46:41,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:41,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:41,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 00:46:41,502 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,SelfDestructingSolverStorable15 [2024-11-10 00:46:41,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:41,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash 248454647, now seen corresponding path program 1 times [2024-11-10 00:46:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000244780] [2024-11-10 00:46:41,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:41,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:41,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000244780] [2024-11-10 00:46:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000244780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111516037] [2024-11-10 00:46:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:41,811 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-10 00:46:41,813 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-10 00:46:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:41,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 00:46:41,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:46:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:46,398 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:46:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:48,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111516037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:46:48,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:46:48,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 20] total 44 [2024-11-10 00:46:48,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772213537] [2024-11-10 00:46:48,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:46:48,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-10 00:46:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:46:48,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-10 00:46:48,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2024-11-10 00:46:48,286 INFO L87 Difference]: Start difference. First operand 1846 states and 3525 transitions. Second operand has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:46:56,530 INFO L93 Difference]: Finished difference Result 8497 states and 12145 transitions. [2024-11-10 00:46:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2024-11-10 00:46:56,530 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-10 00:46:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:46:56,544 INFO L225 Difference]: With dead ends: 8497 [2024-11-10 00:46:56,545 INFO L226 Difference]: Without dead ends: 7450 [2024-11-10 00:46:56,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3071, Invalid=11691, Unknown=0, NotChecked=0, Total=14762 [2024-11-10 00:46:56,553 INFO L432 NwaCegarLoop]: 2198 mSDtfsCounter, 18371 mSDsluCounter, 20644 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18371 SdHoareTripleChecker+Valid, 22842 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 00:46:56,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18371 Valid, 22842 Invalid, 1475 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 00:46:56,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7450 states. [2024-11-10 00:46:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7450 to 4186. [2024-11-10 00:46:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 4184 states have (on average 1.560946462715105) internal successors, (6531), 4185 states have internal predecessors, (6531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 6531 transitions. [2024-11-10 00:46:56,700 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 6531 transitions. Word has length 66 [2024-11-10 00:46:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:46:56,700 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 6531 transitions. [2024-11-10 00:46:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 4.0) internal successors, (176), 44 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:46:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 6531 transitions. [2024-11-10 00:46:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 00:46:56,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:46:56,702 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:46:56,720 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-10 00:46:56,906 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-10 00:46:56,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:46:56,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:46:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash 762992487, now seen corresponding path program 1 times [2024-11-10 00:46:56,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:46:56,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412036216] [2024-11-10 00:46:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:56,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:46:56,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:46:58,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:46:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412036216] [2024-11-10 00:46:58,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412036216] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:46:58,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770857981] [2024-11-10 00:46:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:46:58,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:46:58,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:46:58,261 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-10 00:46:58,262 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-10 00:46:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:46:58,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:46:58,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:00,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770857981] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:01,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 57 [2024-11-10 00:47:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672676382] [2024-11-10 00:47:01,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-10 00:47:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:01,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-10 00:47:01,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2885, Unknown=0, NotChecked=0, Total=3192 [2024-11-10 00:47:01,784 INFO L87 Difference]: Start difference. First operand 4186 states and 6531 transitions. Second operand has 57 states, 57 states have (on average 3.1578947368421053) internal successors, (180), 57 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:14,270 INFO L93 Difference]: Finished difference Result 11233 states and 15546 transitions. [2024-11-10 00:47:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-11-10 00:47:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.1578947368421053) internal successors, (180), 57 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-10 00:47:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:14,288 INFO L225 Difference]: With dead ends: 11233 [2024-11-10 00:47:14,288 INFO L226 Difference]: Without dead ends: 9430 [2024-11-10 00:47:14,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6579 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=4780, Invalid=19400, Unknown=0, NotChecked=0, Total=24180 [2024-11-10 00:47:14,298 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 41062 mSDsluCounter, 39291 mSDsCounter, 0 mSdLazyCounter, 2803 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41062 SdHoareTripleChecker+Valid, 41526 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:14,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41062 Valid, 41526 Invalid, 2932 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [129 Valid, 2803 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 00:47:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9430 states. [2024-11-10 00:47:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9430 to 3970. [2024-11-10 00:47:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3970 states, 3968 states have (on average 1.5730846774193548) internal successors, (6242), 3969 states have internal predecessors, (6242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3970 states to 3970 states and 6242 transitions. [2024-11-10 00:47:14,450 INFO L78 Accepts]: Start accepts. Automaton has 3970 states and 6242 transitions. Word has length 67 [2024-11-10 00:47:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:14,450 INFO L471 AbstractCegarLoop]: Abstraction has 3970 states and 6242 transitions. [2024-11-10 00:47:14,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.1578947368421053) internal successors, (180), 57 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 3970 states and 6242 transitions. [2024-11-10 00:47:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 00:47:14,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:14,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:14,469 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-10 00:47:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 00:47:14,653 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1220188773, now seen corresponding path program 1 times [2024-11-10 00:47:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146780865] [2024-11-10 00:47:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:15,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:15,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146780865] [2024-11-10 00:47:15,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146780865] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:15,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100417449] [2024-11-10 00:47:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:15,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:15,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:15,032 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-10 00:47:15,033 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-10 00:47:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:15,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 00:47:15,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:15,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 00:47:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100417449] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:15,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 16 [2024-11-10 00:47:15,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266425402] [2024-11-10 00:47:15,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:15,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 00:47:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:15,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 00:47:15,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-10 00:47:15,443 INFO L87 Difference]: Start difference. First operand 3970 states and 6242 transitions. Second operand has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:16,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:16,842 INFO L93 Difference]: Finished difference Result 11252 states and 15416 transitions. [2024-11-10 00:47:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 00:47:16,843 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-10 00:47:16,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:16,857 INFO L225 Difference]: With dead ends: 11252 [2024-11-10 00:47:16,857 INFO L226 Difference]: Without dead ends: 8081 [2024-11-10 00:47:16,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=371, Invalid=1269, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 00:47:16,863 INFO L432 NwaCegarLoop]: 2199 mSDtfsCounter, 13433 mSDsluCounter, 8988 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13433 SdHoareTripleChecker+Valid, 11187 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:16,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13433 Valid, 11187 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 00:47:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8081 states. [2024-11-10 00:47:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8081 to 7988. [2024-11-10 00:47:17,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7988 states, 7986 states have (on average 1.3648885549711995) internal successors, (10900), 7987 states have internal predecessors, (10900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7988 states to 7988 states and 10900 transitions. [2024-11-10 00:47:17,193 INFO L78 Accepts]: Start accepts. Automaton has 7988 states and 10900 transitions. Word has length 68 [2024-11-10 00:47:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:17,194 INFO L471 AbstractCegarLoop]: Abstraction has 7988 states and 10900 transitions. [2024-11-10 00:47:17,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.3125) internal successors, (181), 16 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 7988 states and 10900 transitions. [2024-11-10 00:47:17,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:47:17,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:17,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 00:47:17,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 00:47:17,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:17,400 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:17,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:17,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1724484754, now seen corresponding path program 1 times [2024-11-10 00:47:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164380980] [2024-11-10 00:47:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:17,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:17,517 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-10 00:47:17,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:17,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164380980] [2024-11-10 00:47:17,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164380980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 00:47:17,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 00:47:17,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 00:47:17,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606708134] [2024-11-10 00:47:17,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 00:47:17,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 00:47:17,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 00:47:17,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 00:47:17,519 INFO L87 Difference]: Start difference. First operand 7988 states and 10900 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:24,495 INFO L93 Difference]: Finished difference Result 10247 states and 17253 transitions. [2024-11-10 00:47:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 00:47:24,496 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:47:24,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:24,512 INFO L225 Difference]: With dead ends: 10247 [2024-11-10 00:47:24,512 INFO L226 Difference]: Without dead ends: 9492 [2024-11-10 00:47:24,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10 00:47:24,516 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 4377 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7874 mSolverCounterSat, 1245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 9119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1245 IncrementalHoareTripleChecker+Valid, 7874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:24,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4377 Valid, 793 Invalid, 9119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1245 Valid, 7874 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-10 00:47:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9492 states. [2024-11-10 00:47:24,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9492 to 9492. [2024-11-10 00:47:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9492 states, 9490 states have (on average 1.5003161222339305) internal successors, (14238), 9491 states have internal predecessors, (14238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9492 states to 9492 states and 14238 transitions. [2024-11-10 00:47:24,938 INFO L78 Accepts]: Start accepts. Automaton has 9492 states and 14238 transitions. Word has length 69 [2024-11-10 00:47:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:24,938 INFO L471 AbstractCegarLoop]: Abstraction has 9492 states and 14238 transitions. [2024-11-10 00:47:24,938 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 9492 states and 14238 transitions. [2024-11-10 00:47:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-10 00:47:24,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:24,939 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 00:47:24,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 00:47:24,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:24,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1496641001, now seen corresponding path program 1 times [2024-11-10 00:47:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:24,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023618600] [2024-11-10 00:47:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:24,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:26,310 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023618600] [2024-11-10 00:47:26,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023618600] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:26,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859463436] [2024-11-10 00:47:26,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:26,313 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-10 00:47:26,314 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-10 00:47:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:26,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 00:47:26,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:27,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 00:47:30,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859463436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 00:47:30,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 00:47:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 18] total 52 [2024-11-10 00:47:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438807357] [2024-11-10 00:47:30,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 00:47:30,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 00:47:30,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 00:47:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 00:47:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2418, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 00:47:30,211 INFO L87 Difference]: Start difference. First operand 9492 states and 14238 transitions. Second operand has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 00:47:37,916 INFO L93 Difference]: Finished difference Result 15401 states and 21437 transitions. [2024-11-10 00:47:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-11-10 00:47:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-10 00:47:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 00:47:37,934 INFO L225 Difference]: With dead ends: 15401 [2024-11-10 00:47:37,934 INFO L226 Difference]: Without dead ends: 11296 [2024-11-10 00:47:37,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2590 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1848, Invalid=9072, Unknown=0, NotChecked=0, Total=10920 [2024-11-10 00:47:37,945 INFO L432 NwaCegarLoop]: 2185 mSDtfsCounter, 39893 mSDsluCounter, 42580 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39893 SdHoareTripleChecker+Valid, 44765 SdHoareTripleChecker+Invalid, 2554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 00:47:37,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39893 Valid, 44765 Invalid, 2554 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [80 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 00:47:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-10 00:47:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 8074. [2024-11-10 00:47:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8074 states, 8072 states have (on average 1.5561199207135779) internal successors, (12561), 8073 states have internal predecessors, (12561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:38,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8074 states to 8074 states and 12561 transitions. [2024-11-10 00:47:38,366 INFO L78 Accepts]: Start accepts. Automaton has 8074 states and 12561 transitions. Word has length 69 [2024-11-10 00:47:38,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 00:47:38,366 INFO L471 AbstractCegarLoop]: Abstraction has 8074 states and 12561 transitions. [2024-11-10 00:47:38,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.423076923076923) internal successors, (178), 52 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 00:47:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 8074 states and 12561 transitions. [2024-11-10 00:47:38,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 00:47:38,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 00:47:38,369 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 00:47:38,384 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-10 00:47:38,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:38,570 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 00:47:38,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 00:47:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash 54424277, now seen corresponding path program 1 times [2024-11-10 00:47:38,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 00:47:38,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750296966] [2024-11-10 00:47:38,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:38,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 00:47:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 00:47:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750296966] [2024-11-10 00:47:39,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750296966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 00:47:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804750438] [2024-11-10 00:47:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 00:47:39,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 00:47:39,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 00:47:39,339 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-10 00:47:39,340 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-10 00:47:39,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 00:47:39,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 00:47:39,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 00:47:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 33 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 00:47:40,667 INFO L311 TraceCheckSpWp]: Computing backward predicates...