./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a615b663b5895b4b891110151ed37d2c5777d9e61c5a340653346e5f4d27eeef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 00:56:01,620 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 00:56:01,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-12 00:56:01,691 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 00:56:01,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 00:56:01,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 00:56:01,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 00:56:01,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 00:56:01,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 00:56:01,727 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 00:56:01,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 00:56:01,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 00:56:01,728 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 00:56:01,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 00:56:01,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 00:56:01,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 00:56:01,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 00:56:01,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 00:56:01,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 00:56:01,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 00:56:01,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 00:56:01,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 00:56:01,736 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 00:56:01,736 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 00:56:01,737 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 00:56:01,737 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 00:56:01,737 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 00:56:01,737 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 00:56:01,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 00:56:01,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:56:01,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 00:56:01,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 00:56:01,739 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a615b663b5895b4b891110151ed37d2c5777d9e61c5a340653346e5f4d27eeef [2024-11-12 00:56:01,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 00:56:02,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 00:56:02,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 00:56:02,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 00:56:02,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 00:56:02,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c [2024-11-12 00:56:03,369 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 00:56:03,632 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 00:56:03,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c [2024-11-12 00:56:03,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be813c9ca/352a357cda514cac838cb6947afced3d/FLAG1edf2b0a4 [2024-11-12 00:56:03,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be813c9ca/352a357cda514cac838cb6947afced3d [2024-11-12 00:56:03,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 00:56:03,943 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 00:56:03,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 00:56:03,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 00:56:03,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 00:56:03,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:03" (1/1) ... [2024-11-12 00:56:03,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@303121b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:03, skipping insertion in model container [2024-11-12 00:56:03,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:56:03" (1/1) ... [2024-11-12 00:56:03,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 00:56:04,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c[1257,1270] [2024-11-12 00:56:04,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:56:04,470 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 00:56:04,479 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p1.c[1257,1270] [2024-11-12 00:56:04,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 00:56:04,580 INFO L204 MainTranslator]: Completed translation [2024-11-12 00:56:04,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04 WrapperNode [2024-11-12 00:56:04,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 00:56:04,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 00:56:04,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 00:56:04,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 00:56:04,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:04,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:04,862 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2921 [2024-11-12 00:56:04,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 00:56:04,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 00:56:04,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 00:56:04,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 00:56:04,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:04,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:04,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,064 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 00:56:05,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 00:56:05,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 00:56:05,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 00:56:05,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 00:56:05,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (1/1) ... [2024-11-12 00:56:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 00:56:05,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:56:05,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 00:56:05,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 00:56:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 00:56:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 00:56:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 00:56:05,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 00:56:05,648 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 00:56:05,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 00:56:07,897 INFO L? ?]: Removed 1802 outVars from TransFormulas that were not future-live. [2024-11-12 00:56:07,897 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 00:56:07,928 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 00:56:07,928 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 00:56:07,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:07 BoogieIcfgContainer [2024-11-12 00:56:07,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 00:56:07,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 00:56:07,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 00:56:07,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 00:56:07,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:56:03" (1/3) ... [2024-11-12 00:56:07,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ad9a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:07, skipping insertion in model container [2024-11-12 00:56:07,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:56:04" (2/3) ... [2024-11-12 00:56:07,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ad9a0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:56:07, skipping insertion in model container [2024-11-12 00:56:07,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:56:07" (3/3) ... [2024-11-12 00:56:07,941 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p1.c [2024-11-12 00:56:07,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 00:56:07,958 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 00:56:08,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 00:56:08,058 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;@2bd90cf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 00:56:08,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 00:56:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 842 states, 840 states have (on average 1.4988095238095238) internal successors, (1259), 841 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:08,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-12 00:56:08,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:08,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:08,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1223641875, now seen corresponding path program 1 times [2024-11-12 00:56:08,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:08,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915961246] [2024-11-12 00:56:08,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:08,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915961246] [2024-11-12 00:56:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915961246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:09,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:56:09,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994751378] [2024-11-12 00:56:09,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:09,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:56:09,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:09,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:56:09,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:56:09,536 INFO L87 Difference]: Start difference. First operand has 842 states, 840 states have (on average 1.4988095238095238) internal successors, (1259), 841 states have internal predecessors, (1259), 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 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:09,675 INFO L93 Difference]: Finished difference Result 1641 states and 2457 transitions. [2024-11-12 00:56:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:56:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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 59 [2024-11-12 00:56:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:09,699 INFO L225 Difference]: With dead ends: 1641 [2024-11-12 00:56:09,699 INFO L226 Difference]: Without dead ends: 841 [2024-11-12 00:56:09,708 INFO L434 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-11-12 00:56:09,710 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 0 mSDsluCounter, 2500 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3753 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:09,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3753 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2024-11-12 00:56:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 841. [2024-11-12 00:56:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.4964285714285714) internal successors, (1257), 840 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1257 transitions. [2024-11-12 00:56:09,793 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1257 transitions. Word has length 59 [2024-11-12 00:56:09,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:09,794 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1257 transitions. [2024-11-12 00:56:09,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:09,795 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1257 transitions. [2024-11-12 00:56:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 00:56:09,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:09,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:09,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 00:56:09,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash 723503043, now seen corresponding path program 1 times [2024-11-12 00:56:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804820240] [2024-11-12 00:56:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804820240] [2024-11-12 00:56:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804820240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:10,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:56:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527925843] [2024-11-12 00:56:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:56:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:56:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:56:10,252 INFO L87 Difference]: Start difference. First operand 841 states and 1257 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:10,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:10,298 INFO L93 Difference]: Finished difference Result 1642 states and 2455 transitions. [2024-11-12 00:56:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:56:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-12 00:56:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:10,303 INFO L225 Difference]: With dead ends: 1642 [2024-11-12 00:56:10,303 INFO L226 Difference]: Without dead ends: 843 [2024-11-12 00:56:10,309 INFO L434 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-11-12 00:56:10,310 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 0 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3749 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:10,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3749 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:10,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-12 00:56:10,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2024-11-12 00:56:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.495249406175772) internal successors, (1259), 842 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1259 transitions. [2024-11-12 00:56:10,332 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1259 transitions. Word has length 60 [2024-11-12 00:56:10,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:10,332 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1259 transitions. [2024-11-12 00:56:10,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1259 transitions. [2024-11-12 00:56:10,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-12 00:56:10,336 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:10,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:10,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 00:56:10,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:10,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash -144207738, now seen corresponding path program 1 times [2024-11-12 00:56:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:10,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301742710] [2024-11-12 00:56:10,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:10,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:11,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:11,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301742710] [2024-11-12 00:56:11,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301742710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:11,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:11,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 00:56:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366209628] [2024-11-12 00:56:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:11,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 00:56:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:11,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 00:56:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 00:56:11,448 INFO L87 Difference]: Start difference. First operand 843 states and 1259 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:11,494 INFO L93 Difference]: Finished difference Result 1646 states and 2459 transitions. [2024-11-12 00:56:11,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 00:56:11,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-12 00:56:11,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:11,501 INFO L225 Difference]: With dead ends: 1646 [2024-11-12 00:56:11,501 INFO L226 Difference]: Without dead ends: 845 [2024-11-12 00:56:11,503 INFO L434 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-11-12 00:56:11,504 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 0 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3749 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:11,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3749 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-11-12 00:56:11,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2024-11-12 00:56:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4940758293838863) internal successors, (1261), 844 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1261 transitions. [2024-11-12 00:56:11,529 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1261 transitions. Word has length 61 [2024-11-12 00:56:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:11,529 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1261 transitions. [2024-11-12 00:56:11,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1261 transitions. [2024-11-12 00:56:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-12 00:56:11,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:11,534 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:11,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 00:56:11,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:11,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:11,535 INFO L85 PathProgramCache]: Analyzing trace with hash 733414570, now seen corresponding path program 1 times [2024-11-12 00:56:11,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:11,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508828573] [2024-11-12 00:56:11,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:11,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508828573] [2024-11-12 00:56:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508828573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:11,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885474265] [2024-11-12 00:56:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:11,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:11,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:11,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:11,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:11,921 INFO L87 Difference]: Start difference. First operand 845 states and 1261 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:11,979 INFO L93 Difference]: Finished difference Result 1654 states and 2469 transitions. [2024-11-12 00:56:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:11,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-12 00:56:11,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:11,983 INFO L225 Difference]: With dead ends: 1654 [2024-11-12 00:56:11,984 INFO L226 Difference]: Without dead ends: 851 [2024-11-12 00:56:11,985 INFO L434 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-11-12 00:56:11,985 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4 mSDsluCounter, 4990 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6242 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:11,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6242 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2024-11-12 00:56:11,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2024-11-12 00:56:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.4929411764705882) internal successors, (1269), 850 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1269 transitions. [2024-11-12 00:56:12,001 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1269 transitions. Word has length 62 [2024-11-12 00:56:12,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:12,002 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1269 transitions. [2024-11-12 00:56:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1269 transitions. [2024-11-12 00:56:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-12 00:56:12,004 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:12,004 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:12,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 00:56:12,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:12,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2106156792, now seen corresponding path program 1 times [2024-11-12 00:56:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:12,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000777047] [2024-11-12 00:56:12,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:12,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:12,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000777047] [2024-11-12 00:56:12,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000777047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:12,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:12,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563578120] [2024-11-12 00:56:12,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:12,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:12,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:12,306 INFO L87 Difference]: Start difference. First operand 851 states and 1269 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:12,362 INFO L93 Difference]: Finished difference Result 1666 states and 2485 transitions. [2024-11-12 00:56:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:12,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-12 00:56:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:12,366 INFO L225 Difference]: With dead ends: 1666 [2024-11-12 00:56:12,366 INFO L226 Difference]: Without dead ends: 857 [2024-11-12 00:56:12,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:12,369 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:12,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4996 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:12,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-12 00:56:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 857. [2024-11-12 00:56:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 856 states have (on average 1.4918224299065421) internal successors, (1277), 856 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1277 transitions. [2024-11-12 00:56:12,383 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1277 transitions. Word has length 63 [2024-11-12 00:56:12,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:12,383 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1277 transitions. [2024-11-12 00:56:12,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,384 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1277 transitions. [2024-11-12 00:56:12,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-12 00:56:12,385 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:12,385 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:12,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 00:56:12,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:12,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -416324680, now seen corresponding path program 1 times [2024-11-12 00:56:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227655143] [2024-11-12 00:56:12,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227655143] [2024-11-12 00:56:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227655143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:12,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:12,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:12,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662093525] [2024-11-12 00:56:12,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:12,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:12,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:12,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:12,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:12,777 INFO L87 Difference]: Start difference. First operand 857 states and 1277 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:12,832 INFO L93 Difference]: Finished difference Result 1678 states and 2501 transitions. [2024-11-12 00:56:12,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:12,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-12 00:56:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:12,835 INFO L225 Difference]: With dead ends: 1678 [2024-11-12 00:56:12,836 INFO L226 Difference]: Without dead ends: 863 [2024-11-12 00:56:12,838 INFO L434 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-11-12 00:56:12,839 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:12,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4996 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-12 00:56:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2024-11-12 00:56:12,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 862 states have (on average 1.4907192575406032) internal successors, (1285), 862 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1285 transitions. [2024-11-12 00:56:12,857 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1285 transitions. Word has length 64 [2024-11-12 00:56:12,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:12,857 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1285 transitions. [2024-11-12 00:56:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1285 transitions. [2024-11-12 00:56:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-12 00:56:12,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:12,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 00:56:12,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:12,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1736182378, now seen corresponding path program 1 times [2024-11-12 00:56:12,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:12,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695516201] [2024-11-12 00:56:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:13,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695516201] [2024-11-12 00:56:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695516201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:13,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:13,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218631487] [2024-11-12 00:56:13,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:13,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:13,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:13,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:13,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:13,162 INFO L87 Difference]: Start difference. First operand 863 states and 1285 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:13,234 INFO L93 Difference]: Finished difference Result 1690 states and 2517 transitions. [2024-11-12 00:56:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 65 [2024-11-12 00:56:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:13,238 INFO L225 Difference]: With dead ends: 1690 [2024-11-12 00:56:13,238 INFO L226 Difference]: Without dead ends: 869 [2024-11-12 00:56:13,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:13,241 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:13,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4996 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-12 00:56:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2024-11-12 00:56:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.48963133640553) internal successors, (1293), 868 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1293 transitions. [2024-11-12 00:56:13,259 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1293 transitions. Word has length 65 [2024-11-12 00:56:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:13,259 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1293 transitions. [2024-11-12 00:56:13,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1293 transitions. [2024-11-12 00:56:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-12 00:56:13,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:13,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:13,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 00:56:13,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 189302214, now seen corresponding path program 1 times [2024-11-12 00:56:13,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:13,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755978431] [2024-11-12 00:56:13,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:13,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755978431] [2024-11-12 00:56:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755978431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:13,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:13,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421362755] [2024-11-12 00:56:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:13,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:13,666 INFO L87 Difference]: Start difference. First operand 869 states and 1293 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:13,721 INFO L93 Difference]: Finished difference Result 1702 states and 2533 transitions. [2024-11-12 00:56:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:13,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-11-12 00:56:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:13,725 INFO L225 Difference]: With dead ends: 1702 [2024-11-12 00:56:13,725 INFO L226 Difference]: Without dead ends: 875 [2024-11-12 00:56:13,726 INFO L434 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-11-12 00:56:13,727 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:13,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4996 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-12 00:56:13,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 875. [2024-11-12 00:56:13,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.488558352402746) internal successors, (1301), 874 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1301 transitions. [2024-11-12 00:56:13,743 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1301 transitions. Word has length 66 [2024-11-12 00:56:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:13,743 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1301 transitions. [2024-11-12 00:56:13,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1301 transitions. [2024-11-12 00:56:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-12 00:56:13,746 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:13,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:13,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 00:56:13,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:13,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 335829724, now seen corresponding path program 1 times [2024-11-12 00:56:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:13,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710295761] [2024-11-12 00:56:13,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:13,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710295761] [2024-11-12 00:56:14,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710295761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:14,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:14,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900574343] [2024-11-12 00:56:14,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:14,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:14,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:14,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:14,041 INFO L87 Difference]: Start difference. First operand 875 states and 1301 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:14,085 INFO L93 Difference]: Finished difference Result 1714 states and 2549 transitions. [2024-11-12 00:56:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:14,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-12 00:56:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:14,088 INFO L225 Difference]: With dead ends: 1714 [2024-11-12 00:56:14,088 INFO L226 Difference]: Without dead ends: 881 [2024-11-12 00:56:14,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:14,091 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 4 mSDsluCounter, 3744 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4996 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:14,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4996 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-11-12 00:56:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 881. [2024-11-12 00:56:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.4875) internal successors, (1309), 880 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1309 transitions. [2024-11-12 00:56:14,107 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1309 transitions. Word has length 67 [2024-11-12 00:56:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:14,108 INFO L471 AbstractCegarLoop]: Abstraction has 881 states and 1309 transitions. [2024-11-12 00:56:14,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1309 transitions. [2024-11-12 00:56:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-12 00:56:14,109 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:14,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 00:56:14,109 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:14,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1196586284, now seen corresponding path program 1 times [2024-11-12 00:56:14,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023101950] [2024-11-12 00:56:14,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:14,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:14,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:14,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023101950] [2024-11-12 00:56:14,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023101950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:14,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:14,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:14,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265575615] [2024-11-12 00:56:14,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:14,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:14,706 INFO L87 Difference]: Start difference. First operand 881 states and 1309 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:14,753 INFO L93 Difference]: Finished difference Result 1722 states and 2559 transitions. [2024-11-12 00:56:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:14,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-12 00:56:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:14,756 INFO L225 Difference]: With dead ends: 1722 [2024-11-12 00:56:14,756 INFO L226 Difference]: Without dead ends: 883 [2024-11-12 00:56:14,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:14,758 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1231 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 3746 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:14,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 3746 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:14,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-12 00:56:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-11-12 00:56:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:14,772 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 68 [2024-11-12 00:56:14,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:14,772 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:14,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:14,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-12 00:56:14,773 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:14,773 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:14,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 00:56:14,774 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:14,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:14,774 INFO L85 PathProgramCache]: Analyzing trace with hash -794746315, now seen corresponding path program 1 times [2024-11-12 00:56:14,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:14,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608098113] [2024-11-12 00:56:14,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:14,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:15,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608098113] [2024-11-12 00:56:15,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608098113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:15,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:15,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666758335] [2024-11-12 00:56:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:15,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:15,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:15,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:15,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:15,404 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:15,453 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:15,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:15,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-12 00:56:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:15,459 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:15,459 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:15,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:15,461 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1210 mSDsluCounter, 2494 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1210 SdHoareTripleChecker+Valid, 3746 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:15,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1210 Valid, 3746 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:15,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:15,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:15,480 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 69 [2024-11-12 00:56:15,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:15,481 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:15,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:15,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-12 00:56:15,482 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:15,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:15,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 00:56:15,482 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:15,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:15,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1669284108, now seen corresponding path program 1 times [2024-11-12 00:56:15,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:15,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968725175] [2024-11-12 00:56:15,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:15,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968725175] [2024-11-12 00:56:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968725175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:16,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517131438] [2024-11-12 00:56:16,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:16,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:16,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:16,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:16,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:16,135 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:16,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:16,198 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:16,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:16,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2024-11-12 00:56:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:16,202 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:16,202 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:16,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:16,203 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1215 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:16,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 4993 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:16,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:16,219 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 70 [2024-11-12 00:56:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:16,220 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:16,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 00:56:16,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:16,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:16,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 00:56:16,221 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1793173323, now seen corresponding path program 1 times [2024-11-12 00:56:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:16,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684350225] [2024-11-12 00:56:16,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:16,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:16,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684350225] [2024-11-12 00:56:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684350225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:16,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837301013] [2024-11-12 00:56:16,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:16,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:16,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:16,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:16,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:16,948 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:17,016 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:17,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:17,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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 71 [2024-11-12 00:56:17,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:17,020 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:17,020 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:17,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:17,022 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1203 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:17,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 4993 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:17,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:17,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:17,038 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 71 [2024-11-12 00:56:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:17,038 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:17,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-12 00:56:17,039 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:17,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:17,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 00:56:17,040 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:17,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:17,040 INFO L85 PathProgramCache]: Analyzing trace with hash 173883860, now seen corresponding path program 1 times [2024-11-12 00:56:17,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:17,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586595375] [2024-11-12 00:56:17,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:17,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:17,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:17,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586595375] [2024-11-12 00:56:17,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586595375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:17,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079129951] [2024-11-12 00:56:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:17,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:17,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:17,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:17,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:17,710 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:17,766 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2024-11-12 00:56:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:17,769 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:17,769 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:17,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:17,771 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1225 mSDsluCounter, 3740 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1225 SdHoareTripleChecker+Valid, 4992 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:17,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1225 Valid, 4992 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:17,784 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 72 [2024-11-12 00:56:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-12 00:56:17,785 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:17,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:17,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 00:56:17,786 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:17,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:17,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1498363051, now seen corresponding path program 1 times [2024-11-12 00:56:17,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:17,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15976438] [2024-11-12 00:56:17,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:17,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:18,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15976438] [2024-11-12 00:56:18,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15976438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:18,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357747239] [2024-11-12 00:56:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:18,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:18,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:18,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:18,465 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:18,507 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:18,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-12 00:56:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:18,513 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:18,513 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:18,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:18,515 INFO L435 NwaCegarLoop]: 1252 mSDtfsCounter, 1219 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 3747 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:18,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 3747 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 00:56:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:18,531 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 73 [2024-11-12 00:56:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:18,532 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:18,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:18,532 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 00:56:18,532 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:18,533 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:18,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 00:56:18,533 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:18,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:18,533 INFO L85 PathProgramCache]: Analyzing trace with hash -505560236, now seen corresponding path program 1 times [2024-11-12 00:56:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165297419] [2024-11-12 00:56:18,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:19,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165297419] [2024-11-12 00:56:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165297419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:19,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:19,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:19,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353448517] [2024-11-12 00:56:19,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:19,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:19,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:19,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:19,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:19,230 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:19,450 INFO L93 Difference]: Finished difference Result 1726 states and 2563 transitions. [2024-11-12 00:56:19,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:19,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2024-11-12 00:56:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:19,453 INFO L225 Difference]: With dead ends: 1726 [2024-11-12 00:56:19,453 INFO L226 Difference]: Without dead ends: 885 [2024-11-12 00:56:19,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:19,454 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 1229 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 3467 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:19,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 3467 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:19,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-12 00:56:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2024-11-12 00:56:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:19,467 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 74 [2024-11-12 00:56:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:19,467 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:19,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:19,468 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-12 00:56:19,468 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:19,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:19,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 00:56:19,469 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:19,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2099278738, now seen corresponding path program 1 times [2024-11-12 00:56:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:19,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711609033] [2024-11-12 00:56:19,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:19,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711609033] [2024-11-12 00:56:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711609033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320498133] [2024-11-12 00:56:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:20,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:20,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:20,187 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:20,474 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:20,475 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2024-11-12 00:56:20,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:20,477 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:20,478 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:20,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:20,479 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 1198 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:20,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 4618 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:20,495 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 75 [2024-11-12 00:56:20,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:20,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:20,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-12 00:56:20,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:20,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:20,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 00:56:20,497 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:20,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:20,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1884563700, now seen corresponding path program 1 times [2024-11-12 00:56:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562899145] [2024-11-12 00:56:20,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:20,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:21,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:21,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562899145] [2024-11-12 00:56:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562899145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:21,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:21,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:21,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507195462] [2024-11-12 00:56:21,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:21,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:21,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:21,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:21,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:21,215 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:21,422 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2024-11-12 00:56:21,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:21,424 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:21,424 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:21,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:21,426 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 1216 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 3467 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:21,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 3467 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:21,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:21,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:21,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:21,440 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 76 [2024-11-12 00:56:21,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:21,440 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:21,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:21,440 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-12 00:56:21,441 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:21,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 00:56:21,441 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -681649934, now seen corresponding path program 1 times [2024-11-12 00:56:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292034060] [2024-11-12 00:56:21,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:22,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:22,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292034060] [2024-11-12 00:56:22,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292034060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:22,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:22,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:22,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140793909] [2024-11-12 00:56:22,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:22,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:22,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:22,356 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:22,625 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:22,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 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 77 [2024-11-12 00:56:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:22,629 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:22,629 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:22,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:22,630 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 1222 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:22,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 4618 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:22,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:22,643 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 77 [2024-11-12 00:56:22,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:22,643 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:22,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:22,643 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:22,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 00:56:22,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:22,644 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:22,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 00:56:22,644 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:22,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash -320283564, now seen corresponding path program 1 times [2024-11-12 00:56:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:22,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327648843] [2024-11-12 00:56:22,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:22,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:23,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:23,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327648843] [2024-11-12 00:56:23,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327648843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:23,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:23,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 00:56:23,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654468225] [2024-11-12 00:56:23,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:23,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 00:56:23,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 00:56:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 00:56:23,352 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:23,638 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:23,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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 78 [2024-11-12 00:56:23,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:23,641 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:23,641 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:23,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 00:56:23,643 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 1208 mSDsluCounter, 3460 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:23,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 4618 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:23,661 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 78 [2024-11-12 00:56:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:23,661 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:23,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-12 00:56:23,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:23,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:23,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 00:56:23,664 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:23,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:23,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1515352370, now seen corresponding path program 1 times [2024-11-12 00:56:23,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:23,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629123920] [2024-11-12 00:56:23,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:23,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:24,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:24,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629123920] [2024-11-12 00:56:24,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629123920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:24,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:24,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 00:56:24,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572654573] [2024-11-12 00:56:24,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:24,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 00:56:24,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:24,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 00:56:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 00:56:24,226 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:24,432 INFO L93 Difference]: Finished difference Result 1728 states and 2565 transitions. [2024-11-12 00:56:24,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 00:56:24,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2024-11-12 00:56:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:24,435 INFO L225 Difference]: With dead ends: 1728 [2024-11-12 00:56:24,435 INFO L226 Difference]: Without dead ends: 887 [2024-11-12 00:56:24,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:24,437 INFO L435 NwaCegarLoop]: 1158 mSDtfsCounter, 1201 mSDsluCounter, 2309 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 3467 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:24,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 3467 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-11-12 00:56:24,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 883. [2024-11-12 00:56:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 1.4863945578231292) internal successors, (1311), 882 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:24,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1311 transitions. [2024-11-12 00:56:24,452 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1311 transitions. Word has length 79 [2024-11-12 00:56:24,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:24,452 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1311 transitions. [2024-11-12 00:56:24,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:24,452 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1311 transitions. [2024-11-12 00:56:24,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 00:56:24,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:24,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:24,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 00:56:24,453 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:24,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1688891468, now seen corresponding path program 1 times [2024-11-12 00:56:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505529809] [2024-11-12 00:56:24,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:25,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:25,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505529809] [2024-11-12 00:56:25,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505529809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:25,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:25,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 00:56:25,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272259863] [2024-11-12 00:56:25,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:25,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 00:56:25,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:25,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 00:56:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 00:56:25,994 INFO L87 Difference]: Start difference. First operand 883 states and 1311 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:26,278 INFO L93 Difference]: Finished difference Result 2369 states and 3516 transitions. [2024-11-12 00:56:26,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 00:56:26,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 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 80 [2024-11-12 00:56:26,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:26,282 INFO L225 Difference]: With dead ends: 2369 [2024-11-12 00:56:26,283 INFO L226 Difference]: Without dead ends: 1528 [2024-11-12 00:56:26,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 00:56:26,285 INFO L435 NwaCegarLoop]: 1220 mSDtfsCounter, 3043 mSDsluCounter, 4875 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3043 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:26,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3043 Valid, 6095 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:26,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2024-11-12 00:56:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 919. [2024-11-12 00:56:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 1.4869281045751634) internal successors, (1365), 918 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1365 transitions. [2024-11-12 00:56:26,301 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1365 transitions. Word has length 80 [2024-11-12 00:56:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:26,301 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1365 transitions. [2024-11-12 00:56:26,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:26,302 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1365 transitions. [2024-11-12 00:56:26,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2024-11-12 00:56:26,306 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:26,306 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:26,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 00:56:26,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:26,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:26,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1151264780, now seen corresponding path program 1 times [2024-11-12 00:56:26,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:26,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324605224] [2024-11-12 00:56:26,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 00:56:32,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324605224] [2024-11-12 00:56:32,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324605224] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:56:32,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063160441] [2024-11-12 00:56:32,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:32,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:56:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:56:32,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:56:32,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 00:56:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:34,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 3699 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 00:56:34,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:56:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:36,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 00:56:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-12 00:56:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063160441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 00:56:39,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 00:56:39,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 18 [2024-11-12 00:56:39,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311137993] [2024-11-12 00:56:39,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 00:56:39,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 00:56:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 00:56:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:56:39,262 INFO L87 Difference]: Start difference. First operand 919 states and 1365 transitions. Second operand has 18 states, 18 states have (on average 77.27777777777777) internal successors, (1391), 18 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:40,746 INFO L93 Difference]: Finished difference Result 1991 states and 2948 transitions. [2024-11-12 00:56:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 00:56:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 77.27777777777777) internal successors, (1391), 18 states have internal predecessors, (1391), 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 479 [2024-11-12 00:56:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:40,753 INFO L225 Difference]: With dead ends: 1991 [2024-11-12 00:56:40,753 INFO L226 Difference]: Without dead ends: 1150 [2024-11-12 00:56:40,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2024-11-12 00:56:40,755 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 3801 mSDsluCounter, 6784 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3801 SdHoareTripleChecker+Valid, 7656 SdHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:40,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3801 Valid, 7656 Invalid, 3406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 00:56:40,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-12 00:56:40,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 919. [2024-11-12 00:56:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 918 states have (on average 1.4869281045751634) internal successors, (1365), 918 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1365 transitions. [2024-11-12 00:56:40,775 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1365 transitions. Word has length 479 [2024-11-12 00:56:40,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:40,776 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1365 transitions. [2024-11-12 00:56:40,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 77.27777777777777) internal successors, (1391), 18 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1365 transitions. [2024-11-12 00:56:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2024-11-12 00:56:40,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:40,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:40,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 00:56:40,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-12 00:56:40,983 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:40,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1851303939, now seen corresponding path program 1 times [2024-11-12 00:56:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058445460] [2024-11-12 00:56:40,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:56:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:56:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:56:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058445460] [2024-11-12 00:56:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058445460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 00:56:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 00:56:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 00:56:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467595829] [2024-11-12 00:56:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 00:56:50,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 00:56:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 00:56:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 00:56:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 00:56:50,415 INFO L87 Difference]: Start difference. First operand 919 states and 1365 transitions. Second operand has 10 states, 10 states have (on average 48.0) internal successors, (480), 10 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 00:56:50,680 INFO L93 Difference]: Finished difference Result 2202 states and 3266 transitions. [2024-11-12 00:56:50,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 00:56:50,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 48.0) internal successors, (480), 10 states have internal predecessors, (480), 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 480 [2024-11-12 00:56:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 00:56:50,685 INFO L225 Difference]: With dead ends: 2202 [2024-11-12 00:56:50,685 INFO L226 Difference]: Without dead ends: 1361 [2024-11-12 00:56:50,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-12 00:56:50,688 INFO L435 NwaCegarLoop]: 1236 mSDtfsCounter, 2426 mSDsluCounter, 7950 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2426 SdHoareTripleChecker+Valid, 9186 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 00:56:50,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2426 Valid, 9186 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 00:56:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-12 00:56:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1304. [2024-11-12 00:56:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1303 states have (on average 1.4819646968534153) internal successors, (1931), 1303 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1931 transitions. [2024-11-12 00:56:50,707 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1931 transitions. Word has length 480 [2024-11-12 00:56:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 00:56:50,707 INFO L471 AbstractCegarLoop]: Abstraction has 1304 states and 1931 transitions. [2024-11-12 00:56:50,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 48.0) internal successors, (480), 10 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 00:56:50,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1931 transitions. [2024-11-12 00:56:50,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2024-11-12 00:56:50,712 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 00:56:50,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 00:56:50,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 00:56:50,713 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 00:56:50,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 00:56:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1553173598, now seen corresponding path program 1 times [2024-11-12 00:56:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 00:56:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024054441] [2024-11-12 00:56:50,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:56:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 00:56:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:00,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 00:57:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024054441] [2024-11-12 00:57:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024054441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 00:57:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951757611] [2024-11-12 00:57:00,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 00:57:00,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 00:57:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 00:57:00,171 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 00:57:00,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 00:57:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 00:57:05,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 3705 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-11-12 00:57:05,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 00:57:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 00:57:09,686 INFO L312 TraceCheckSpWp]: Computing backward predicates...