./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 4b67d651ed8b1fa1f4edbbff70276f688183332c7d0932c0d0b5d67a2f44f4d5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:03:06,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:03:06,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 07:03:06,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:03:06,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:03:06,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:03:06,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:03:06,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:03:06,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:03:06,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:03:06,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:03:06,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:03:06,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:03:06,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:03:06,377 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:03:06,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:03:06,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:03:06,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:03:06,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:03:06,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:03:06,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:03:06,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:03:06,383 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:03:06,383 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:03:06,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:03:06,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:03:06,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:03:06,385 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:03:06,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:03:06,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:06,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:03:06,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:03:06,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:03:06,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:03:06,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:03:06,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:03:06,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:03:06,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:03:06,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:03:06,388 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b67d651ed8b1fa1f4edbbff70276f688183332c7d0932c0d0b5d67a2f44f4d5 [2024-10-11 07:03:06,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:03:06,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:03:06,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:03:06,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:03:06,712 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:03:06,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c [2024-10-11 07:03:08,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:03:08,524 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:03:08,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c [2024-10-11 07:03:08,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16d88a775/f9d72dfa869641ca8209889e522cd61f/FLAG4aa3123cc [2024-10-11 07:03:08,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16d88a775/f9d72dfa869641ca8209889e522cd61f [2024-10-11 07:03:08,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:03:08,768 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:03:08,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:08,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:03:08,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:03:08,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:08" (1/1) ... [2024-10-11 07:03:08,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ece98fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:08, skipping insertion in model container [2024-10-11 07:03:08,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:08" (1/1) ... [2024-10-11 07:03:08,841 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:03:09,083 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c[1260,1273] [2024-10-11 07:03:09,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:09,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:03:09,490 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/hardware-verification-bv/btor2c-lazyMod.vis_arrays_vsa16a_p6.c[1260,1273] [2024-10-11 07:03:09,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:03:09,669 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:03:09,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09 WrapperNode [2024-10-11 07:03:09,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:03:09,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:09,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:03:09,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:03:09,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:09,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,271 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4536 [2024-10-11 07:03:10,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:03:10,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:03:10,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:03:10,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:03:10,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,643 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 07:03:10,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:10,924 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:11,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:03:11,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:03:11,005 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:03:11,005 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:03:11,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (1/1) ... [2024-10-11 07:03:11,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:03:11,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:03:11,040 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 07:03:11,043 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 07:03:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:03:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:03:11,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:03:11,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:03:11,690 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:03:11,692 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:03:16,135 INFO L? ?]: Removed 2696 outVars from TransFormulas that were not future-live. [2024-10-11 07:03:16,135 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:03:16,242 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:03:16,243 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:03:16,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:16 BoogieIcfgContainer [2024-10-11 07:03:16,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:03:16,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:03:16,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:03:16,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:03:16,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:08" (1/3) ... [2024-10-11 07:03:16,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f135fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:16, skipping insertion in model container [2024-10-11 07:03:16,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:09" (2/3) ... [2024-10-11 07:03:16,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f135fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:16, skipping insertion in model container [2024-10-11 07:03:16,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:16" (3/3) ... [2024-10-11 07:03:16,253 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_vsa16a_p6.c [2024-10-11 07:03:16,270 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:03:16,271 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:03:16,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:03:16,389 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;@2077b384, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:03:16,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:03:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 1356 states, 1354 states have (on average 1.500738552437223) internal successors, (2032), 1355 states have internal predecessors, (2032), 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 07:03:16,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-11 07:03:16,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:16,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:16,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:16,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash 194344346, now seen corresponding path program 1 times [2024-10-11 07:03:16,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323884453] [2024-10-11 07:03:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:17,283 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 07:03:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323884453] [2024-10-11 07:03:17,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323884453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:17,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:17,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:17,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064459560] [2024-10-11 07:03:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:17,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:17,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:17,321 INFO L87 Difference]: Start difference. First operand has 1356 states, 1354 states have (on average 1.500738552437223) internal successors, (2032), 1355 states have internal predecessors, (2032), 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 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 07:03:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:17,490 INFO L93 Difference]: Finished difference Result 2660 states and 3988 transitions. [2024-10-11 07:03:17,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-11 07:03:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:17,520 INFO L225 Difference]: With dead ends: 2660 [2024-10-11 07:03:17,521 INFO L226 Difference]: Without dead ends: 1357 [2024-10-11 07:03:17,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:17,535 INFO L432 NwaCegarLoop]: 2027 mSDtfsCounter, 0 mSDsluCounter, 4049 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6076 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:17,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6076 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2024-10-11 07:03:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1357. [2024-10-11 07:03:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1356 states have (on average 1.4985250737463127) internal successors, (2032), 1356 states have internal predecessors, (2032), 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 07:03:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2032 transitions. [2024-10-11 07:03:17,643 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2032 transitions. Word has length 50 [2024-10-11 07:03:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:17,643 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 2032 transitions. [2024-10-11 07:03:17,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 07:03:17,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2032 transitions. [2024-10-11 07:03:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 07:03:17,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:17,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:17,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:03:17,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:17,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:17,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1731402882, now seen corresponding path program 1 times [2024-10-11 07:03:17,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:17,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452240439] [2024-10-11 07:03:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:17,923 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 07:03:17,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:17,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452240439] [2024-10-11 07:03:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452240439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:17,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552674640] [2024-10-11 07:03:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:17,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:03:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:17,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:03:17,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:17,930 INFO L87 Difference]: Start difference. First operand 1357 states and 2032 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 07:03:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:18,000 INFO L93 Difference]: Finished difference Result 2663 states and 3988 transitions. [2024-10-11 07:03:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:03:18,001 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 07:03:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:18,008 INFO L225 Difference]: With dead ends: 2663 [2024-10-11 07:03:18,008 INFO L226 Difference]: Without dead ends: 1359 [2024-10-11 07:03:18,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:03:18,011 INFO L432 NwaCegarLoop]: 2027 mSDtfsCounter, 0 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6073 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:18,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6073 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-10-11 07:03:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1359. [2024-10-11 07:03:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 1.4977908689248896) internal successors, (2034), 1358 states have internal predecessors, (2034), 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 07:03:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2034 transitions. [2024-10-11 07:03:18,043 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2034 transitions. Word has length 51 [2024-10-11 07:03:18,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:18,044 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2034 transitions. [2024-10-11 07:03:18,045 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 07:03:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2034 transitions. [2024-10-11 07:03:18,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 07:03:18,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:18,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:18,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:03:18,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:18,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1035916147, now seen corresponding path program 1 times [2024-10-11 07:03:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932886243] [2024-10-11 07:03:18,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:18,882 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 07:03:18,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:18,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932886243] [2024-10-11 07:03:18,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932886243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:18,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:18,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:03:18,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979800516] [2024-10-11 07:03:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:18,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:18,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:18,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:18,888 INFO L87 Difference]: Start difference. First operand 1359 states and 2034 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:19,056 INFO L93 Difference]: Finished difference Result 2673 states and 4001 transitions. [2024-10-11 07:03:19,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:03:19,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-11 07:03:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:19,062 INFO L225 Difference]: With dead ends: 2673 [2024-10-11 07:03:19,063 INFO L226 Difference]: Without dead ends: 1367 [2024-10-11 07:03:19,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:19,066 INFO L432 NwaCegarLoop]: 2018 mSDtfsCounter, 4 mSDsluCounter, 8065 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10083 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:19,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10083 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:19,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-10-11 07:03:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1363. [2024-10-11 07:03:19,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1362 states have (on average 1.4970631424375918) internal successors, (2039), 1362 states have internal predecessors, (2039), 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 07:03:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2039 transitions. [2024-10-11 07:03:19,104 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2039 transitions. Word has length 52 [2024-10-11 07:03:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:19,105 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 2039 transitions. [2024-10-11 07:03:19,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:19,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2039 transitions. [2024-10-11 07:03:19,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 07:03:19,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:19,107 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:19,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:03:19,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:19,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:19,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1337450711, now seen corresponding path program 1 times [2024-10-11 07:03:19,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:19,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902866880] [2024-10-11 07:03:19,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:19,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:19,484 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 07:03:19,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:19,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902866880] [2024-10-11 07:03:19,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902866880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:19,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:19,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:03:19,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602112065] [2024-10-11 07:03:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:19,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:03:19,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:03:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:03:19,488 INFO L87 Difference]: Start difference. First operand 1363 states and 2039 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 07:03:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:19,635 INFO L93 Difference]: Finished difference Result 2681 states and 4011 transitions. [2024-10-11 07:03:19,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:03:19,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 53 [2024-10-11 07:03:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:19,642 INFO L225 Difference]: With dead ends: 2681 [2024-10-11 07:03:19,642 INFO L226 Difference]: Without dead ends: 1371 [2024-10-11 07:03:19,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:03:19,647 INFO L432 NwaCegarLoop]: 2021 mSDtfsCounter, 5 mSDsluCounter, 10095 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 12116 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:19,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 12116 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-10-11 07:03:19,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1370. [2024-10-11 07:03:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 1369 states have (on average 1.4967129291453616) internal successors, (2049), 1369 states have internal predecessors, (2049), 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 07:03:19,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 2049 transitions. [2024-10-11 07:03:19,678 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 2049 transitions. Word has length 53 [2024-10-11 07:03:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:19,679 INFO L471 AbstractCegarLoop]: Abstraction has 1370 states and 2049 transitions. [2024-10-11 07:03:19,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 07:03:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 2049 transitions. [2024-10-11 07:03:19,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-11 07:03:19,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:19,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:19,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:03:19,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:19,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:19,685 INFO L85 PathProgramCache]: Analyzing trace with hash 877250295, now seen corresponding path program 1 times [2024-10-11 07:03:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685571998] [2024-10-11 07:03:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:19,956 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 07:03:19,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:19,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685571998] [2024-10-11 07:03:19,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685571998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:19,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:19,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:03:19,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424479104] [2024-10-11 07:03:19,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:19,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:19,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:19,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:19,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:19,959 INFO L87 Difference]: Start difference. First operand 1370 states and 2049 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 07:03:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:20,046 INFO L93 Difference]: Finished difference Result 2697 states and 4034 transitions. [2024-10-11 07:03:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:20,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2024-10-11 07:03:20,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:20,053 INFO L225 Difference]: With dead ends: 2697 [2024-10-11 07:03:20,053 INFO L226 Difference]: Without dead ends: 1380 [2024-10-11 07:03:20,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:20,059 INFO L432 NwaCegarLoop]: 2026 mSDtfsCounter, 8 mSDsluCounter, 8090 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 10116 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:20,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 10116 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:20,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-10-11 07:03:20,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2024-10-11 07:03:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.4960116026105874) internal successors, (2063), 1379 states have internal predecessors, (2063), 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 07:03:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2063 transitions. [2024-10-11 07:03:20,083 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2063 transitions. Word has length 53 [2024-10-11 07:03:20,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:20,084 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2063 transitions. [2024-10-11 07:03:20,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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 07:03:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2063 transitions. [2024-10-11 07:03:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 07:03:20,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:20,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:03:20,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:20,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1808047504, now seen corresponding path program 1 times [2024-10-11 07:03:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:20,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810960463] [2024-10-11 07:03:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:20,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:20,698 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 07:03:20,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:20,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810960463] [2024-10-11 07:03:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810960463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:20,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:20,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:03:20,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471830509] [2024-10-11 07:03:20,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:20,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:20,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:20,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:20,700 INFO L87 Difference]: Start difference. First operand 1380 states and 2063 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:20,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:20,937 INFO L93 Difference]: Finished difference Result 3036 states and 4535 transitions. [2024-10-11 07:03:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:03:20,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 07:03:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:20,951 INFO L225 Difference]: With dead ends: 3036 [2024-10-11 07:03:20,953 INFO L226 Difference]: Without dead ends: 1709 [2024-10-11 07:03:20,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:03:20,959 INFO L432 NwaCegarLoop]: 2011 mSDtfsCounter, 2917 mSDsluCounter, 6029 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 8040 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:20,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 8040 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:03:20,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-10-11 07:03:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1414. [2024-10-11 07:03:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.494692144373673) internal successors, (2112), 1413 states have internal predecessors, (2112), 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 07:03:20,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2112 transitions. [2024-10-11 07:03:20,989 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2112 transitions. Word has length 54 [2024-10-11 07:03:20,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:20,989 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2112 transitions. [2024-10-11 07:03:20,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2112 transitions. [2024-10-11 07:03:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 07:03:20,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:20,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:20,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:03:20,991 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:20,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:20,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2145133058, now seen corresponding path program 1 times [2024-10-11 07:03:20,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:20,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217135424] [2024-10-11 07:03:20,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:20,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:21,351 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 07:03:21,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217135424] [2024-10-11 07:03:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217135424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:21,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:03:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152504004] [2024-10-11 07:03:21,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:21,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:03:21,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:03:21,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:03:21,353 INFO L87 Difference]: Start difference. First operand 1414 states and 2112 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:21,619 INFO L93 Difference]: Finished difference Result 2759 states and 4122 transitions. [2024-10-11 07:03:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 07:03:21,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-11 07:03:21,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:21,625 INFO L225 Difference]: With dead ends: 2759 [2024-10-11 07:03:21,625 INFO L226 Difference]: Without dead ends: 1418 [2024-10-11 07:03:21,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:03:21,630 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 2023 mSDsluCounter, 12069 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 14084 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:21,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 14084 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:03:21,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-10-11 07:03:21,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2024-10-11 07:03:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1417 states have (on average 1.4932956951305576) internal successors, (2116), 1417 states have internal predecessors, (2116), 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 07:03:21,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2116 transitions. [2024-10-11 07:03:21,654 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2116 transitions. Word has length 54 [2024-10-11 07:03:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:21,654 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2116 transitions. [2024-10-11 07:03:21,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2116 transitions. [2024-10-11 07:03:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 07:03:21,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:21,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:21,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:03:21,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:21,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:21,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1202662370, now seen corresponding path program 1 times [2024-10-11 07:03:21,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:21,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978079069] [2024-10-11 07:03:21,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:21,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:21,953 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 07:03:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978079069] [2024-10-11 07:03:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978079069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:21,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:21,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:03:21,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511396191] [2024-10-11 07:03:21,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:21,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:03:21,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:21,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:03:21,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:03:21,956 INFO L87 Difference]: Start difference. First operand 1418 states and 2116 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 07:03:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:21,996 INFO L93 Difference]: Finished difference Result 2745 states and 4100 transitions. [2024-10-11 07:03:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:03:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 55 [2024-10-11 07:03:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:22,002 INFO L225 Difference]: With dead ends: 2745 [2024-10-11 07:03:22,002 INFO L226 Difference]: Without dead ends: 1416 [2024-10-11 07:03:22,004 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 07:03:22,005 INFO L432 NwaCegarLoop]: 2024 mSDtfsCounter, 2 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4046 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:22,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4046 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:03:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-10-11 07:03:22,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1380. [2024-10-11 07:03:22,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1379 states have (on average 1.4945612762871645) internal successors, (2061), 1379 states have internal predecessors, (2061), 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 07:03:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2061 transitions. [2024-10-11 07:03:22,036 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2061 transitions. Word has length 55 [2024-10-11 07:03:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:22,036 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2061 transitions. [2024-10-11 07:03:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 07:03:22,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2061 transitions. [2024-10-11 07:03:22,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 07:03:22,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:22,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 07:03:22,038 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:22,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:22,038 INFO L85 PathProgramCache]: Analyzing trace with hash -595305267, now seen corresponding path program 1 times [2024-10-11 07:03:22,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028772788] [2024-10-11 07:03:22,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:22,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:22,605 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 07:03:22,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:22,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028772788] [2024-10-11 07:03:22,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028772788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:22,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:22,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 07:03:22,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210645171] [2024-10-11 07:03:22,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:22,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:03:22,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:22,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:03:22,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:03:22,608 INFO L87 Difference]: Start difference. First operand 1380 states and 2061 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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 07:03:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:22,830 INFO L93 Difference]: Finished difference Result 2714 states and 4052 transitions. [2024-10-11 07:03:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 07:03:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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 55 [2024-10-11 07:03:22,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:22,836 INFO L225 Difference]: With dead ends: 2714 [2024-10-11 07:03:22,837 INFO L226 Difference]: Without dead ends: 1387 [2024-10-11 07:03:22,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-11 07:03:22,840 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 2002 mSDsluCounter, 12081 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 14096 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:22,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2002 Valid, 14096 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-10-11 07:03:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1384. [2024-10-11 07:03:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.4938539407086044) internal successors, (2066), 1383 states have internal predecessors, (2066), 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 07:03:22,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2066 transitions. [2024-10-11 07:03:22,869 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2066 transitions. Word has length 55 [2024-10-11 07:03:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:22,869 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2066 transitions. [2024-10-11 07:03:22,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 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 07:03:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2066 transitions. [2024-10-11 07:03:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 07:03:22,870 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:22,870 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:22,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 07:03:22,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:22,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:22,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1868737883, now seen corresponding path program 1 times [2024-10-11 07:03:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236205727] [2024-10-11 07:03:22,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:23,138 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 07:03:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236205727] [2024-10-11 07:03:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236205727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:23,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:23,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:03:23,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203464329] [2024-10-11 07:03:23,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:23,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:03:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:23,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:03:23,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:23,140 INFO L87 Difference]: Start difference. First operand 1384 states and 2066 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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 07:03:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:23,258 INFO L93 Difference]: Finished difference Result 2723 states and 4064 transitions. [2024-10-11 07:03:23,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:03:23,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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 56 [2024-10-11 07:03:23,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:23,263 INFO L225 Difference]: With dead ends: 2723 [2024-10-11 07:03:23,264 INFO L226 Difference]: Without dead ends: 1392 [2024-10-11 07:03:23,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:23,266 INFO L432 NwaCegarLoop]: 2022 mSDtfsCounter, 2011 mSDsluCounter, 6057 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 8079 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:23,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 8079 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:03:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2024-10-11 07:03:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1388. [2024-10-11 07:03:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1387 states have (on average 1.4938716654650324) internal successors, (2072), 1387 states have internal predecessors, (2072), 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 07:03:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2072 transitions. [2024-10-11 07:03:23,293 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2072 transitions. Word has length 56 [2024-10-11 07:03:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:23,295 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 2072 transitions. [2024-10-11 07:03:23,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 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 07:03:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2072 transitions. [2024-10-11 07:03:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 07:03:23,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:23,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:23,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 07:03:23,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:23,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:23,299 INFO L85 PathProgramCache]: Analyzing trace with hash 289951307, now seen corresponding path program 1 times [2024-10-11 07:03:23,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:23,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283747355] [2024-10-11 07:03:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:23,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:23,618 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 07:03:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283747355] [2024-10-11 07:03:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283747355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:23,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734773548] [2024-10-11 07:03:23,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:23,621 INFO L87 Difference]: Start difference. First operand 1388 states and 2072 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 07:03:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:23,848 INFO L93 Difference]: Finished difference Result 3062 states and 4564 transitions. [2024-10-11 07:03:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 56 [2024-10-11 07:03:23,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:23,854 INFO L225 Difference]: With dead ends: 3062 [2024-10-11 07:03:23,855 INFO L226 Difference]: Without dead ends: 1727 [2024-10-11 07:03:23,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:23,858 INFO L432 NwaCegarLoop]: 2015 mSDtfsCounter, 2888 mSDsluCounter, 4030 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2888 SdHoareTripleChecker+Valid, 6045 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:23,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2888 Valid, 6045 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:03:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-11 07:03:23,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1434. [2024-10-11 07:03:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1433 states have (on average 1.490579204466155) internal successors, (2136), 1433 states have internal predecessors, (2136), 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 07:03:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2136 transitions. [2024-10-11 07:03:23,890 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2136 transitions. Word has length 56 [2024-10-11 07:03:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:23,890 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2136 transitions. [2024-10-11 07:03:23,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 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 07:03:23,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2136 transitions. [2024-10-11 07:03:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 07:03:23,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:23,895 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:23,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 07:03:23,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:23,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:23,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1588031755, now seen corresponding path program 1 times [2024-10-11 07:03:23,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:23,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203510333] [2024-10-11 07:03:23,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:23,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:25,955 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 07:03:25,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:25,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203510333] [2024-10-11 07:03:25,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203510333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:25,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:25,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:03:25,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828312827] [2024-10-11 07:03:25,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:25,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:03:25,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:25,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:03:25,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:03:25,958 INFO L87 Difference]: Start difference. First operand 1434 states and 2136 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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 07:03:26,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:26,846 INFO L93 Difference]: Finished difference Result 3060 states and 4559 transitions. [2024-10-11 07:03:26,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 07:03:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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 07:03:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:26,858 INFO L225 Difference]: With dead ends: 3060 [2024-10-11 07:03:26,862 INFO L226 Difference]: Without dead ends: 1725 [2024-10-11 07:03:26,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-10-11 07:03:26,866 INFO L432 NwaCegarLoop]: 2004 mSDtfsCounter, 2918 mSDsluCounter, 16018 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 18022 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:26,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2918 Valid, 18022 Invalid, 256 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:03:26,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2024-10-11 07:03:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1438. [2024-10-11 07:03:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1437 states have (on average 1.4899095337508699) internal successors, (2141), 1437 states have internal predecessors, (2141), 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 07:03:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 2141 transitions. [2024-10-11 07:03:26,909 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 2141 transitions. Word has length 57 [2024-10-11 07:03:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:26,910 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 2141 transitions. [2024-10-11 07:03:26,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 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 07:03:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 2141 transitions. [2024-10-11 07:03:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 07:03:26,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:26,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:03:26,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 07:03:26,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:26,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:26,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1900729108, now seen corresponding path program 1 times [2024-10-11 07:03:26,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:26,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591270094] [2024-10-11 07:03:26,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:27,422 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 07:03:27,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:27,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591270094] [2024-10-11 07:03:27,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591270094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:27,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:27,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 07:03:27,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834772433] [2024-10-11 07:03:27,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:27,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:03:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:27,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:03:27,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:03:27,426 INFO L87 Difference]: Start difference. First operand 1438 states and 2141 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:28,165 INFO L93 Difference]: Finished difference Result 3240 states and 4818 transitions. [2024-10-11 07:03:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 07:03:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-11 07:03:28,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:28,173 INFO L225 Difference]: With dead ends: 3240 [2024-10-11 07:03:28,173 INFO L226 Difference]: Without dead ends: 1861 [2024-10-11 07:03:28,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=725, Unknown=0, NotChecked=0, Total=870 [2024-10-11 07:03:28,177 INFO L432 NwaCegarLoop]: 2001 mSDtfsCounter, 3759 mSDsluCounter, 17994 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3759 SdHoareTripleChecker+Valid, 19995 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:28,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3759 Valid, 19995 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:03:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2024-10-11 07:03:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1413. [2024-10-11 07:03:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.4900849858356942) internal successors, (2104), 1412 states have internal predecessors, (2104), 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 07:03:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2104 transitions. [2024-10-11 07:03:28,212 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2104 transitions. Word has length 58 [2024-10-11 07:03:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:28,213 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2104 transitions. [2024-10-11 07:03:28,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 07:03:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2104 transitions. [2024-10-11 07:03:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2024-10-11 07:03:28,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:28,227 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:03:28,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 07:03:28,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:28,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:28,227 INFO L85 PathProgramCache]: Analyzing trace with hash 734410982, now seen corresponding path program 1 times [2024-10-11 07:03:28,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394846680] [2024-10-11 07:03:28,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:28,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394846680] [2024-10-11 07:03:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394846680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:42,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213724482] [2024-10-11 07:03:42,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:42,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:42,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:42,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:42,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:42,728 INFO L87 Difference]: Start difference. First operand 1413 states and 2104 transitions. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 4 states have internal predecessors, (709), 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 07:03:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:43,063 INFO L93 Difference]: Finished difference Result 3016 states and 4496 transitions. [2024-10-11 07:03:43,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:03:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 4 states have internal predecessors, (709), 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 709 [2024-10-11 07:03:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:43,071 INFO L225 Difference]: With dead ends: 3016 [2024-10-11 07:03:43,071 INFO L226 Difference]: Without dead ends: 1681 [2024-10-11 07:03:43,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:03:43,073 INFO L432 NwaCegarLoop]: 1971 mSDtfsCounter, 2841 mSDsluCounter, 3940 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2841 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:43,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2841 Valid, 5911 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:03:43,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2024-10-11 07:03:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1421. [2024-10-11 07:03:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1420 states have (on average 1.4873239436619718) internal successors, (2112), 1420 states have internal predecessors, (2112), 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 07:03:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2112 transitions. [2024-10-11 07:03:43,102 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2112 transitions. Word has length 709 [2024-10-11 07:03:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:43,102 INFO L471 AbstractCegarLoop]: Abstraction has 1421 states and 2112 transitions. [2024-10-11 07:03:43,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 4 states have internal predecessors, (709), 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 07:03:43,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2112 transitions. [2024-10-11 07:03:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-10-11 07:03:43,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:43,117 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:03:43,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 07:03:43,118 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2072685703, now seen corresponding path program 1 times [2024-10-11 07:03:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:43,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812983890] [2024-10-11 07:03:43,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:43,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:03:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:03:52,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:03:52,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812983890] [2024-10-11 07:03:52,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812983890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:03:52,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:03:52,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:03:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203119481] [2024-10-11 07:03:52,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:03:52,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:03:52,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:03:52,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:03:52,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:03:52,277 INFO L87 Difference]: Start difference. First operand 1421 states and 2112 transitions. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 4 states have internal predecessors, (710), 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 07:03:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:03:52,585 INFO L93 Difference]: Finished difference Result 3016 states and 4495 transitions. [2024-10-11 07:03:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 07:03:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 4 states have internal predecessors, (710), 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 710 [2024-10-11 07:03:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:03:52,593 INFO L225 Difference]: With dead ends: 3016 [2024-10-11 07:03:52,593 INFO L226 Difference]: Without dead ends: 1681 [2024-10-11 07:03:52,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:03:52,597 INFO L432 NwaCegarLoop]: 1974 mSDtfsCounter, 2812 mSDsluCounter, 3946 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 5920 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:03:52,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 5920 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:03:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2024-10-11 07:03:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 1422. [2024-10-11 07:03:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1421 states have (on average 1.4869809992962701) internal successors, (2113), 1421 states have internal predecessors, (2113), 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 07:03:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2113 transitions. [2024-10-11 07:03:52,626 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2113 transitions. Word has length 710 [2024-10-11 07:03:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:03:52,626 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2113 transitions. [2024-10-11 07:03:52,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 4 states have internal predecessors, (710), 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 07:03:52,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2113 transitions. [2024-10-11 07:03:52,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2024-10-11 07:03:52,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:03:52,643 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:03:52,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 07:03:52,643 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:03:52,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:03:52,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1481165495, now seen corresponding path program 1 times [2024-10-11 07:03:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:03:52,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739579501] [2024-10-11 07:03:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:03:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:03:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:02,388 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:04:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739579501] [2024-10-11 07:04:02,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739579501] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:04:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854532845] [2024-10-11 07:04:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:04:02,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:04:02,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:04:02,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:04:02,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:04:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:04:07,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 4585 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 07:04:07,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:04:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:11,025 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:04:14,551 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 07:04:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854532845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:04:14,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:04:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 18 [2024-10-11 07:04:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468658611] [2024-10-11 07:04:14,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:04:14,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 07:04:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:04:14,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 07:04:14,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-10-11 07:04:14,560 INFO L87 Difference]: Start difference. First operand 1422 states and 2113 transitions. Second operand has 19 states, 19 states have (on average 111.3157894736842) internal successors, (2115), 18 states have internal predecessors, (2115), 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)