./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:02:57,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:02:57,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:02:57,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:02:57,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:02:57,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:02:57,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:02:57,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:02:57,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:02:57,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:02:57,462 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:02:57,462 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:02:57,463 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:02:57,463 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:02:57,464 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:02:57,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:02:57,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:02:57,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:02:57,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:02:57,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:02:57,465 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:02:57,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:02:57,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:02:57,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:02:57,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:02:57,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:02:57,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:02:57,467 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:02:57,468 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:02:57,468 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:02:57,468 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:02:57,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:02:57,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:02:57,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:02:57,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:02:57,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:02:57,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:02:57,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:02:57,470 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:02:57,470 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:02:57,471 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:02:57,471 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:02:57,471 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-clean/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-clean/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 -> de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 [2024-10-11 00:02:57,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:02:57,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:02:57,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:02:57,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:02:57,718 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:02:57,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2024-10-11 00:02:59,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:02:59,737 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:02:59,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2024-10-11 00:02:59,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5d9e9e54/2305e800f9e0426ca7da3c23760a1902/FLAGb27ceca5e [2024-10-11 00:03:00,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f5d9e9e54/2305e800f9e0426ca7da3c23760a1902 [2024-10-11 00:03:00,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:03:00,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:03:00,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:03:00,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:03:00,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:03:00,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:03:00" (1/1) ... [2024-10-11 00:03:00,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d28d109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:00, skipping insertion in model container [2024-10-11 00:03:00,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:03:00" (1/1) ... [2024-10-11 00:03:00,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:03:01,749 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c[2349407,2349420] [2024-10-11 00:03:01,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:03:01,825 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:03:02,437 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c[2349407,2349420] [2024-10-11 00:03:02,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:03:02,496 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:03:02,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02 WrapperNode [2024-10-11 00:03:02,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:03:02,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:03:02,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:03:02,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:03:02,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:02,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:03,676 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53158 [2024-10-11 00:03:03,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:03:03,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:03:03,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:03:03,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:03:03,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:03,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:03,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:04,083 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 00:03:04,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:04,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:04,475 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:04,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:04,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:04,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:05,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:03:05,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:03:05,019 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:03:05,019 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:03:05,020 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (1/1) ... [2024-10-11 00:03:05,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:03:05,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:03:05,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:03:05,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:03:05,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:03:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:03:05,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:03:05,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:03:05,526 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:03:05,529 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:03:17,573 INFO L? ?]: Removed 10714 outVars from TransFormulas that were not future-live. [2024-10-11 00:03:17,573 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:03:17,743 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:03:17,743 INFO L314 CfgBuilder]: Removed 1130 assume(true) statements. [2024-10-11 00:03:17,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:03:17 BoogieIcfgContainer [2024-10-11 00:03:17,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:03:17,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:03:17,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:03:17,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:03:17,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:03:00" (1/3) ... [2024-10-11 00:03:17,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af2f96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:03:17, skipping insertion in model container [2024-10-11 00:03:17,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:03:02" (2/3) ... [2024-10-11 00:03:17,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af2f96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:03:17, skipping insertion in model container [2024-10-11 00:03:17,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:03:17" (3/3) ... [2024-10-11 00:03:17,753 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2024-10-11 00:03:17,767 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:03:17,767 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:03:17,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:03:17,952 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;@297700a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:03:17,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:03:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 9209 states, 9207 states have (on average 1.9996741609644835) internal successors, (18411), 9208 states have internal predecessors, (18411), 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-10-11 00:03:17,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 00:03:17,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:17,986 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:17,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:17,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:17,992 INFO L85 PathProgramCache]: Analyzing trace with hash 182211473, now seen corresponding path program 1 times [2024-10-11 00:03:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699611186] [2024-10-11 00:03:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:18,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:18,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:18,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:18,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699611186] [2024-10-11 00:03:18,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699611186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:03:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580588306] [2024-10-11 00:03:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:18,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:03:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:03:18,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:03:18,278 INFO L87 Difference]: Start difference. First operand has 9209 states, 9207 states have (on average 1.9996741609644835) internal successors, (18411), 9208 states have internal predecessors, (18411), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-11 00:03:18,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:18,475 INFO L93 Difference]: Finished difference Result 17695 states and 35377 transitions. [2024-10-11 00:03:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:03:18,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2024-10-11 00:03:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:18,525 INFO L225 Difference]: With dead ends: 17695 [2024-10-11 00:03:18,525 INFO L226 Difference]: Without dead ends: 8279 [2024-10-11 00:03:18,539 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-10-11 00:03:18,541 INFO L432 NwaCegarLoop]: 14143 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14143 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:18,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14143 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:03:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2024-10-11 00:03:18,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8279. [2024-10-11 00:03:18,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8278 states have (on average 1.5699444310219859) internal successors, (12996), 8278 states have internal predecessors, (12996), 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-10-11 00:03:18,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 12996 transitions. [2024-10-11 00:03:18,739 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 12996 transitions. Word has length 8 [2024-10-11 00:03:18,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:18,740 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 12996 transitions. [2024-10-11 00:03:18,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-11 00:03:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 12996 transitions. [2024-10-11 00:03:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 00:03:18,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:18,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:18,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:03:18,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:18,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:18,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1884649833, now seen corresponding path program 1 times [2024-10-11 00:03:18,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621043226] [2024-10-11 00:03:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:18,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:18,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:18,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621043226] [2024-10-11 00:03:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621043226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:03:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77278187] [2024-10-11 00:03:18,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:18,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:18,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:18,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:18,860 INFO L87 Difference]: Start difference. First operand 8279 states and 12996 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-10-11 00:03:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:20,222 INFO L93 Difference]: Finished difference Result 16560 states and 25995 transitions. [2024-10-11 00:03:20,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:20,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2024-10-11 00:03:20,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:20,247 INFO L225 Difference]: With dead ends: 16560 [2024-10-11 00:03:20,247 INFO L226 Difference]: Without dead ends: 8282 [2024-10-11 00:03:20,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:20,259 INFO L432 NwaCegarLoop]: 12994 mSDtfsCounter, 4 mSDsluCounter, 11519 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24513 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:20,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24513 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 00:03:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8282 states. [2024-10-11 00:03:20,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8282 to 8282. [2024-10-11 00:03:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8282 states, 8281 states have (on average 1.569737954353339) internal successors, (12999), 8281 states have internal predecessors, (12999), 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-10-11 00:03:20,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 12999 transitions. [2024-10-11 00:03:20,572 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 12999 transitions. Word has length 9 [2024-10-11 00:03:20,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:20,573 INFO L471 AbstractCegarLoop]: Abstraction has 8282 states and 12999 transitions. [2024-10-11 00:03:20,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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-10-11 00:03:20,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 12999 transitions. [2024-10-11 00:03:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 00:03:20,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:20,574 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:20,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:03:20,574 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:20,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:20,574 INFO L85 PathProgramCache]: Analyzing trace with hash 897026676, now seen corresponding path program 1 times [2024-10-11 00:03:20,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:20,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461742058] [2024-10-11 00:03:20,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:20,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461742058] [2024-10-11 00:03:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461742058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:20,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399017701] [2024-10-11 00:03:20,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:20,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:20,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:20,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:20,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:20,706 INFO L87 Difference]: Start difference. First operand 8282 states and 12999 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 00:03:22,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:22,040 INFO L93 Difference]: Finished difference Result 16568 states and 26004 transitions. [2024-10-11 00:03:22,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:22,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-10-11 00:03:22,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:22,065 INFO L225 Difference]: With dead ends: 16568 [2024-10-11 00:03:22,065 INFO L226 Difference]: Without dead ends: 8288 [2024-10-11 00:03:22,072 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-10-11 00:03:22,076 INFO L432 NwaCegarLoop]: 12993 mSDtfsCounter, 329 mSDsluCounter, 11196 mSDsCounter, 0 mSdLazyCounter, 1443 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 24189 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:22,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 24189 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1443 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 00:03:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8288 states. [2024-10-11 00:03:22,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8288 to 8286. [2024-10-11 00:03:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8286 states, 8285 states have (on average 1.5694628847314425) internal successors, (13003), 8285 states have internal predecessors, (13003), 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-10-11 00:03:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8286 states to 8286 states and 13003 transitions. [2024-10-11 00:03:22,222 INFO L78 Accepts]: Start accepts. Automaton has 8286 states and 13003 transitions. Word has length 14 [2024-10-11 00:03:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:22,223 INFO L471 AbstractCegarLoop]: Abstraction has 8286 states and 13003 transitions. [2024-10-11 00:03:22,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-10-11 00:03:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8286 states and 13003 transitions. [2024-10-11 00:03:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 00:03:22,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:22,224 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:22,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:03:22,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:22,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:22,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1409738145, now seen corresponding path program 1 times [2024-10-11 00:03:22,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:22,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42701061] [2024-10-11 00:03:22,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:22,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:22,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42701061] [2024-10-11 00:03:22,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42701061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:22,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:22,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:22,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404127926] [2024-10-11 00:03:22,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:22,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:22,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:22,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:22,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:22,317 INFO L87 Difference]: Start difference. First operand 8286 states and 13003 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 00:03:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:24,833 INFO L93 Difference]: Finished difference Result 16492 states and 25885 transitions. [2024-10-11 00:03:24,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-10-11 00:03:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:24,856 INFO L225 Difference]: With dead ends: 16492 [2024-10-11 00:03:24,857 INFO L226 Difference]: Without dead ends: 8166 [2024-10-11 00:03:24,863 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-10-11 00:03:24,864 INFO L432 NwaCegarLoop]: 9996 mSDtfsCounter, 10370 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10370 SdHoareTripleChecker+Valid, 9997 SdHoareTripleChecker+Invalid, 4914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:24,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10370 Valid, 9997 Invalid, 4914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 00:03:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8166 states. [2024-10-11 00:03:24,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8166 to 8164. [2024-10-11 00:03:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8164 states, 8163 states have (on average 1.516599289476908) internal successors, (12380), 8163 states have internal predecessors, (12380), 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-10-11 00:03:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 12380 transitions. [2024-10-11 00:03:24,979 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 12380 transitions. Word has length 18 [2024-10-11 00:03:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:24,979 INFO L471 AbstractCegarLoop]: Abstraction has 8164 states and 12380 transitions. [2024-10-11 00:03:24,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10-11 00:03:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 12380 transitions. [2024-10-11 00:03:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 00:03:24,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:24,981 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:24,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:03:24,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:24,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1096116993, now seen corresponding path program 1 times [2024-10-11 00:03:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256012307] [2024-10-11 00:03:24,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256012307] [2024-10-11 00:03:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256012307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257096150] [2024-10-11 00:03:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:25,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:25,055 INFO L87 Difference]: Start difference. First operand 8164 states and 12380 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-10-11 00:03:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:27,334 INFO L93 Difference]: Finished difference Result 24488 states and 37136 transitions. [2024-10-11 00:03:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-10-11 00:03:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:27,364 INFO L225 Difference]: With dead ends: 24488 [2024-10-11 00:03:27,364 INFO L226 Difference]: Without dead ends: 16276 [2024-10-11 00:03:27,373 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-10-11 00:03:27,374 INFO L432 NwaCegarLoop]: 10922 mSDtfsCounter, 10931 mSDsluCounter, 10880 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10931 SdHoareTripleChecker+Valid, 21802 SdHoareTripleChecker+Invalid, 4239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:27,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10931 Valid, 21802 Invalid, 4239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 00:03:27,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16276 states. [2024-10-11 00:03:27,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16276 to 14962. [2024-10-11 00:03:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14962 states, 14961 states have (on average 1.5566472829356326) internal successors, (23289), 14961 states have internal predecessors, (23289), 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-10-11 00:03:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14962 states to 14962 states and 23289 transitions. [2024-10-11 00:03:27,582 INFO L78 Accepts]: Start accepts. Automaton has 14962 states and 23289 transitions. Word has length 22 [2024-10-11 00:03:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:27,583 INFO L471 AbstractCegarLoop]: Abstraction has 14962 states and 23289 transitions. [2024-10-11 00:03:27,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-10-11 00:03:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14962 states and 23289 transitions. [2024-10-11 00:03:27,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 00:03:27,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:27,585 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:27,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 00:03:27,585 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:27,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1423449426, now seen corresponding path program 1 times [2024-10-11 00:03:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922637053] [2024-10-11 00:03:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:27,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:27,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:27,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922637053] [2024-10-11 00:03:27,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922637053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:27,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:27,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:27,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546244284] [2024-10-11 00:03:27,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:27,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:27,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:27,687 INFO L87 Difference]: Start difference. First operand 14962 states and 23289 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-11 00:03:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:31,041 INFO L93 Difference]: Finished difference Result 37762 states and 58559 transitions. [2024-10-11 00:03:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:31,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2024-10-11 00:03:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:31,089 INFO L225 Difference]: With dead ends: 37762 [2024-10-11 00:03:31,090 INFO L226 Difference]: Without dead ends: 22520 [2024-10-11 00:03:31,108 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-10-11 00:03:31,110 INFO L432 NwaCegarLoop]: 10501 mSDtfsCounter, 10112 mSDsluCounter, 9628 mSDsCounter, 0 mSdLazyCounter, 4520 mSolverCounterSat, 1455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10112 SdHoareTripleChecker+Valid, 20129 SdHoareTripleChecker+Invalid, 5975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1455 IncrementalHoareTripleChecker+Valid, 4520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:31,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10112 Valid, 20129 Invalid, 5975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1455 Valid, 4520 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 00:03:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22520 states. [2024-10-11 00:03:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22520 to 21280. [2024-10-11 00:03:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21280 states, 21279 states have (on average 1.5519056346632831) internal successors, (33023), 21279 states have internal predecessors, (33023), 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-10-11 00:03:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21280 states to 21280 states and 33023 transitions. [2024-10-11 00:03:31,539 INFO L78 Accepts]: Start accepts. Automaton has 21280 states and 33023 transitions. Word has length 24 [2024-10-11 00:03:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:31,539 INFO L471 AbstractCegarLoop]: Abstraction has 21280 states and 33023 transitions. [2024-10-11 00:03:31,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-11 00:03:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 21280 states and 33023 transitions. [2024-10-11 00:03:31,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 00:03:31,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:31,540 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 00:03:31,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 00:03:31,540 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:31,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:31,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1092028023, now seen corresponding path program 1 times [2024-10-11 00:03:31,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:31,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140611334] [2024-10-11 00:03:31,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:31,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:31,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:31,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:31,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140611334] [2024-10-11 00:03:31,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140611334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:31,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:31,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:31,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757186561] [2024-10-11 00:03:31,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:31,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:31,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:31,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:31,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:31,645 INFO L87 Difference]: Start difference. First operand 21280 states and 33023 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-11 00:03:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:36,177 INFO L93 Difference]: Finished difference Result 63806 states and 99005 transitions. [2024-10-11 00:03:36,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:36,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2024-10-11 00:03:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:36,273 INFO L225 Difference]: With dead ends: 63806 [2024-10-11 00:03:36,274 INFO L226 Difference]: Without dead ends: 42528 [2024-10-11 00:03:36,297 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-10-11 00:03:36,298 INFO L432 NwaCegarLoop]: 21588 mSDtfsCounter, 10226 mSDsluCounter, 9572 mSDsCounter, 0 mSdLazyCounter, 6372 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10226 SdHoareTripleChecker+Valid, 31160 SdHoareTripleChecker+Invalid, 7520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 6372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:36,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10226 Valid, 31160 Invalid, 7520 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1148 Valid, 6372 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 00:03:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2024-10-11 00:03:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 40444. [2024-10-11 00:03:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40444 states, 40443 states have (on average 1.5746606334841629) internal successors, (63684), 40443 states have internal predecessors, (63684), 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-10-11 00:03:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40444 states to 40444 states and 63684 transitions. [2024-10-11 00:03:36,981 INFO L78 Accepts]: Start accepts. Automaton has 40444 states and 63684 transitions. Word has length 29 [2024-10-11 00:03:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:36,981 INFO L471 AbstractCegarLoop]: Abstraction has 40444 states and 63684 transitions. [2024-10-11 00:03:36,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-10-11 00:03:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 40444 states and 63684 transitions. [2024-10-11 00:03:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-11 00:03:36,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:36,984 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:36,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 00:03:36,984 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:36,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash -197265190, now seen corresponding path program 1 times [2024-10-11 00:03:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:36,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747859752] [2024-10-11 00:03:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:37,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 00:03:37,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:37,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747859752] [2024-10-11 00:03:37,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747859752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:37,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:37,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:37,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518000366] [2024-10-11 00:03:37,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:37,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:37,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:37,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:37,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:37,257 INFO L87 Difference]: Start difference. First operand 40444 states and 63684 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-11 00:03:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:38,661 INFO L93 Difference]: Finished difference Result 80918 states and 127421 transitions. [2024-10-11 00:03:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:38,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 35 [2024-10-11 00:03:38,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:38,750 INFO L225 Difference]: With dead ends: 80918 [2024-10-11 00:03:38,751 INFO L226 Difference]: Without dead ends: 40476 [2024-10-11 00:03:38,792 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-10-11 00:03:38,793 INFO L432 NwaCegarLoop]: 12340 mSDtfsCounter, 305 mSDsluCounter, 10698 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 23038 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:38,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 23038 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 00:03:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40476 states. [2024-10-11 00:03:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40476 to 40474. [2024-10-11 00:03:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40474 states, 40473 states have (on average 1.5742346749684974) internal successors, (63714), 40473 states have internal predecessors, (63714), 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-10-11 00:03:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40474 states to 40474 states and 63714 transitions. [2024-10-11 00:03:39,673 INFO L78 Accepts]: Start accepts. Automaton has 40474 states and 63714 transitions. Word has length 35 [2024-10-11 00:03:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:39,674 INFO L471 AbstractCegarLoop]: Abstraction has 40474 states and 63714 transitions. [2024-10-11 00:03:39,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-10-11 00:03:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 40474 states and 63714 transitions. [2024-10-11 00:03:39,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 00:03:39,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:39,680 INFO L215 NwaCegarLoop]: trace histogram [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-10-11 00:03:39,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 00:03:39,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:39,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:39,681 INFO L85 PathProgramCache]: Analyzing trace with hash -504887773, now seen corresponding path program 1 times [2024-10-11 00:03:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226321621] [2024-10-11 00:03:39,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:39,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:39,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226321621] [2024-10-11 00:03:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226321621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:39,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:39,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054009530] [2024-10-11 00:03:39,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:39,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:39,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:39,773 INFO L87 Difference]: Start difference. First operand 40474 states and 63714 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-11 00:03:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:43,144 INFO L93 Difference]: Finished difference Result 109022 states and 171832 transitions. [2024-10-11 00:03:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:43,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2024-10-11 00:03:43,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:43,278 INFO L225 Difference]: With dead ends: 109022 [2024-10-11 00:03:43,278 INFO L226 Difference]: Without dead ends: 68500 [2024-10-11 00:03:43,309 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-10-11 00:03:43,309 INFO L432 NwaCegarLoop]: 10922 mSDtfsCounter, 10915 mSDsluCounter, 10880 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 1313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10915 SdHoareTripleChecker+Valid, 21802 SdHoareTripleChecker+Invalid, 4143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:43,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10915 Valid, 21802 Invalid, 4143 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1313 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 00:03:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68500 states. [2024-10-11 00:03:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68500 to 66770. [2024-10-11 00:03:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66770 states, 66769 states have (on average 1.585136814988992) internal successors, (105838), 66769 states have internal predecessors, (105838), 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-10-11 00:03:44,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66770 states to 66770 states and 105838 transitions. [2024-10-11 00:03:44,787 INFO L78 Accepts]: Start accepts. Automaton has 66770 states and 105838 transitions. Word has length 38 [2024-10-11 00:03:44,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:44,787 INFO L471 AbstractCegarLoop]: Abstraction has 66770 states and 105838 transitions. [2024-10-11 00:03:44,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-11 00:03:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 66770 states and 105838 transitions. [2024-10-11 00:03:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 00:03:44,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:44,788 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:44,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 00:03:44,789 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:44,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2095911498, now seen corresponding path program 1 times [2024-10-11 00:03:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414197873] [2024-10-11 00:03:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 00:03:44,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:44,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414197873] [2024-10-11 00:03:44,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414197873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:44,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:44,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:44,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106110107] [2024-10-11 00:03:44,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:44,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:44,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:44,957 INFO L87 Difference]: Start difference. First operand 66770 states and 105838 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-11 00:03:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:47,048 INFO L93 Difference]: Finished difference Result 129326 states and 204979 transitions. [2024-10-11 00:03:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 45 [2024-10-11 00:03:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:47,184 INFO L225 Difference]: With dead ends: 129326 [2024-10-11 00:03:47,185 INFO L226 Difference]: Without dead ends: 62558 [2024-10-11 00:03:47,252 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-10-11 00:03:47,252 INFO L432 NwaCegarLoop]: 12045 mSDtfsCounter, 10323 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10323 SdHoareTripleChecker+Valid, 12595 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1190 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:47,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10323 Valid, 12595 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1190 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 00:03:47,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62558 states. [2024-10-11 00:03:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62558 to 62556. [2024-10-11 00:03:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62556 states, 62555 states have (on average 1.584237870673807) internal successors, (99102), 62555 states have internal predecessors, (99102), 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-10-11 00:03:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62556 states to 62556 states and 99102 transitions. [2024-10-11 00:03:48,860 INFO L78 Accepts]: Start accepts. Automaton has 62556 states and 99102 transitions. Word has length 45 [2024-10-11 00:03:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:48,861 INFO L471 AbstractCegarLoop]: Abstraction has 62556 states and 99102 transitions. [2024-10-11 00:03:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-10-11 00:03:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 62556 states and 99102 transitions. [2024-10-11 00:03:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 00:03:48,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:48,862 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:48,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 00:03:48,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:48,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:48,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1850197707, now seen corresponding path program 1 times [2024-10-11 00:03:48,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:48,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9019449] [2024-10-11 00:03:48,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:48,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:03:49,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:49,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9019449] [2024-10-11 00:03:49,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9019449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:49,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:49,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:03:49,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892316656] [2024-10-11 00:03:49,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:49,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:03:49,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:49,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:03:49,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:03:49,104 INFO L87 Difference]: Start difference. First operand 62556 states and 99102 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-10-11 00:03:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:54,538 INFO L93 Difference]: Finished difference Result 119613 states and 189346 transitions. [2024-10-11 00:03:54,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:03:54,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-10-11 00:03:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:54,670 INFO L225 Difference]: With dead ends: 119613 [2024-10-11 00:03:54,671 INFO L226 Difference]: Without dead ends: 62792 [2024-10-11 00:03:54,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:03:54,710 INFO L432 NwaCegarLoop]: 9460 mSDtfsCounter, 19672 mSDsluCounter, 9231 mSDsCounter, 0 mSdLazyCounter, 4621 mSolverCounterSat, 2448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19672 SdHoareTripleChecker+Valid, 18691 SdHoareTripleChecker+Invalid, 7069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2448 IncrementalHoareTripleChecker+Valid, 4621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:54,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19672 Valid, 18691 Invalid, 7069 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2448 Valid, 4621 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 00:03:54,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62792 states. [2024-10-11 00:03:55,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62792 to 60394. [2024-10-11 00:03:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60394 states, 60393 states have (on average 1.56274733826768) internal successors, (94379), 60393 states have internal predecessors, (94379), 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-10-11 00:03:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60394 states to 60394 states and 94379 transitions. [2024-10-11 00:03:55,890 INFO L78 Accepts]: Start accepts. Automaton has 60394 states and 94379 transitions. Word has length 51 [2024-10-11 00:03:55,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:55,890 INFO L471 AbstractCegarLoop]: Abstraction has 60394 states and 94379 transitions. [2024-10-11 00:03:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-10-11 00:03:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 60394 states and 94379 transitions. [2024-10-11 00:03:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 00:03:55,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:55,891 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 00:03:55,892 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:55,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1545744311, now seen corresponding path program 1 times [2024-10-11 00:03:55,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:55,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596213733] [2024-10-11 00:03:55,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 00:03:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:55,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596213733] [2024-10-11 00:03:55,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596213733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:55,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989691213] [2024-10-11 00:03:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:55,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:55,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:55,984 INFO L87 Difference]: Start difference. First operand 60394 states and 94379 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-10-11 00:03:57,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:03:57,811 INFO L93 Difference]: Finished difference Result 120431 states and 188192 transitions. [2024-10-11 00:03:57,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:03:57,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 52 [2024-10-11 00:03:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:03:57,936 INFO L225 Difference]: With dead ends: 120431 [2024-10-11 00:03:57,937 INFO L226 Difference]: Without dead ends: 60456 [2024-10-11 00:03:57,967 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-10-11 00:03:57,968 INFO L432 NwaCegarLoop]: 11635 mSDtfsCounter, 277 mSDsluCounter, 10273 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 21908 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 00:03:57,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 21908 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 00:03:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60456 states. [2024-10-11 00:03:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60456 to 60454. [2024-10-11 00:03:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60454 states, 60453 states have (on average 1.5621888078341852) internal successors, (94439), 60453 states have internal predecessors, (94439), 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-10-11 00:03:59,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60454 states to 60454 states and 94439 transitions. [2024-10-11 00:03:59,344 INFO L78 Accepts]: Start accepts. Automaton has 60454 states and 94439 transitions. Word has length 52 [2024-10-11 00:03:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:03:59,345 INFO L471 AbstractCegarLoop]: Abstraction has 60454 states and 94439 transitions. [2024-10-11 00:03:59,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-10-11 00:03:59,345 INFO L276 IsEmpty]: Start isEmpty. Operand 60454 states and 94439 transitions. [2024-10-11 00:03:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 00:03:59,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:03:59,346 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:03:59,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 00:03:59,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:03:59,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:03:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash -645596173, now seen corresponding path program 1 times [2024-10-11 00:03:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:03:59,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108418015] [2024-10-11 00:03:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:03:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:03:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:03:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 00:03:59,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:03:59,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108418015] [2024-10-11 00:03:59,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108418015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:03:59,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:03:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:03:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386545360] [2024-10-11 00:03:59,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:03:59,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:03:59,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:03:59,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:03:59,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:03:59,492 INFO L87 Difference]: Start difference. First operand 60454 states and 94439 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-11 00:04:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:04:03,137 INFO L93 Difference]: Finished difference Result 110046 states and 171349 transitions. [2024-10-11 00:04:03,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:04:03,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 57 [2024-10-11 00:04:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:04:03,267 INFO L225 Difference]: With dead ends: 110046 [2024-10-11 00:04:03,268 INFO L226 Difference]: Without dead ends: 61420 [2024-10-11 00:04:03,308 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-10-11 00:04:03,309 INFO L432 NwaCegarLoop]: 10157 mSDtfsCounter, 9658 mSDsluCounter, 9401 mSDsCounter, 0 mSdLazyCounter, 2922 mSolverCounterSat, 1080 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9658 SdHoareTripleChecker+Valid, 19558 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1080 IncrementalHoareTripleChecker+Valid, 2922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 00:04:03,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9658 Valid, 19558 Invalid, 4002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1080 Valid, 2922 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 00:04:03,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61420 states. [2024-10-11 00:04:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61420 to 60198. [2024-10-11 00:04:04,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60198 states, 60197 states have (on average 1.551821519344818) internal successors, (93415), 60197 states have internal predecessors, (93415), 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-10-11 00:04:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60198 states to 60198 states and 93415 transitions. [2024-10-11 00:04:04,617 INFO L78 Accepts]: Start accepts. Automaton has 60198 states and 93415 transitions. Word has length 57 [2024-10-11 00:04:04,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:04:04,617 INFO L471 AbstractCegarLoop]: Abstraction has 60198 states and 93415 transitions. [2024-10-11 00:04:04,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-11 00:04:04,618 INFO L276 IsEmpty]: Start isEmpty. Operand 60198 states and 93415 transitions. [2024-10-11 00:04:04,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 00:04:04,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:04:04,619 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:04:04,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 00:04:04,619 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:04:04,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:04:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash 2088051592, now seen corresponding path program 1 times [2024-10-11 00:04:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:04:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250875212] [2024-10-11 00:04:04,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:04:04,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:04:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:04:04,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:04:04,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:04:04,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250875212] [2024-10-11 00:04:04,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250875212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:04:04,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:04:04,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:04:04,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142285193] [2024-10-11 00:04:04,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:04:04,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:04:04,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:04:04,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:04:04,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:04:04,740 INFO L87 Difference]: Start difference. First operand 60198 states and 93415 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-11 00:04:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:04:08,617 INFO L93 Difference]: Finished difference Result 122229 states and 188540 transitions. [2024-10-11 00:04:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:04:08,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 63 [2024-10-11 00:04:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:04:08,749 INFO L225 Difference]: With dead ends: 122229 [2024-10-11 00:04:08,750 INFO L226 Difference]: Without dead ends: 62410 [2024-10-11 00:04:08,806 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-10-11 00:04:08,806 INFO L432 NwaCegarLoop]: 10084 mSDtfsCounter, 9795 mSDsluCounter, 9165 mSDsCounter, 0 mSdLazyCounter, 3960 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9795 SdHoareTripleChecker+Valid, 19249 SdHoareTripleChecker+Invalid, 4806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 3960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 00:04:08,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9795 Valid, 19249 Invalid, 4806 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [846 Valid, 3960 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 00:04:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62410 states. [2024-10-11 00:04:09,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62410 to 59892. [2024-10-11 00:04:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59892 states, 59891 states have (on average 1.548279374196457) internal successors, (92728), 59891 states have internal predecessors, (92728), 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-10-11 00:04:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59892 states to 59892 states and 92728 transitions. [2024-10-11 00:04:10,034 INFO L78 Accepts]: Start accepts. Automaton has 59892 states and 92728 transitions. Word has length 63 [2024-10-11 00:04:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:04:10,034 INFO L471 AbstractCegarLoop]: Abstraction has 59892 states and 92728 transitions. [2024-10-11 00:04:10,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-10-11 00:04:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 59892 states and 92728 transitions. [2024-10-11 00:04:10,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 00:04:10,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:04:10,036 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:04:10,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 00:04:10,037 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:04:10,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:04:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1015894375, now seen corresponding path program 1 times [2024-10-11 00:04:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:04:10,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581807088] [2024-10-11 00:04:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:04:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:04:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:04:10,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:04:10,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:04:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581807088] [2024-10-11 00:04:10,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581807088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:04:10,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:04:10,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 00:04:10,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949352241] [2024-10-11 00:04:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:04:10,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 00:04:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:04:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 00:04:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 00:04:10,329 INFO L87 Difference]: Start difference. First operand 59892 states and 92728 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-10-11 00:04:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:04:15,407 INFO L93 Difference]: Finished difference Result 97851 states and 150309 transitions. [2024-10-11 00:04:15,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 00:04:15,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-10-11 00:04:15,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:04:15,574 INFO L225 Difference]: With dead ends: 97851 [2024-10-11 00:04:15,574 INFO L226 Difference]: Without dead ends: 72843 [2024-10-11 00:04:15,626 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-10-11 00:04:15,626 INFO L432 NwaCegarLoop]: 19382 mSDtfsCounter, 9130 mSDsluCounter, 8887 mSDsCounter, 0 mSdLazyCounter, 5615 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9130 SdHoareTripleChecker+Valid, 28269 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 5615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-11 00:04:15,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9130 Valid, 28269 Invalid, 6249 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [634 Valid, 5615 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-11 00:04:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72843 states. [2024-10-11 00:04:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72843 to 71071. [2024-10-11 00:04:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71071 states, 71070 states have (on average 1.5502884480090051) internal successors, (110179), 71070 states have internal predecessors, (110179), 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)