./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dffb49b583bf1b2953c0c17a06d6fc63bf48c484ad06befbc2660a12f206f89f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:49:08,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:49:08,055 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:49:08,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:49:08,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:49:08,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:49:08,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:49:08,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:49:08,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:49:08,077 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:49:08,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:49:08,078 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:49:08,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:49:08,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:49:08,082 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:49:08,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:49:08,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:49:08,083 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:49:08,083 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:49:08,083 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:49:08,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:49:08,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:49:08,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:49:08,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:49:08,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:49:08,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:49:08,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:49:08,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:49:08,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:49:08,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:49:08,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:49:08,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:49:08,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:49:08,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:49:08,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:49:08,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:49:08,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:49:08,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:49:08,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:49:08,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:49:08,087 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:49:08,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:49:08,087 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dffb49b583bf1b2953c0c17a06d6fc63bf48c484ad06befbc2660a12f206f89f [2024-11-12 05:49:08,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:49:08,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:49:08,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:49:08,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:49:08,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:49:08,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i [2024-11-12 05:49:09,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:49:09,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:49:09,718 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i [2024-11-12 05:49:09,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b6db27f/bf50bbb7811341f8a895a28bce8b18d5/FLAGedbc83dc2 [2024-11-12 05:49:10,124 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1b6db27f/bf50bbb7811341f8a895a28bce8b18d5 [2024-11-12 05:49:10,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:49:10,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:49:10,128 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:49:10,128 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:49:10,133 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:49:10,134 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,135 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b46178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10, skipping insertion in model container [2024-11-12 05:49:10,135 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:49:10,297 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/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i[915,928] [2024-11-12 05:49:10,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:49:10,353 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:49:10,362 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/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-10.i[915,928] [2024-11-12 05:49:10,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:49:10,410 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:49:10,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10 WrapperNode [2024-11-12 05:49:10,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:49:10,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:49:10,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:49:10,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:49:10,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,455 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-12 05:49:10,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:49:10,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:49:10,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:49:10,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:49:10,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,513 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 05:49:10,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:49:10,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:49:10,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:49:10,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:49:10,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (1/1) ... [2024-11-12 05:49:10,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:49:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:49:10,569 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 05:49:10,571 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 05:49:10,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:49:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:49:10,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:49:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:49:10,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:49:10,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:49:10,674 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:49:10,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:49:10,968 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 05:49:10,969 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:49:10,984 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:49:10,985 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:49:10,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:49:10 BoogieIcfgContainer [2024-11-12 05:49:10,985 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:49:10,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:49:10,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:49:10,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:49:10,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:49:10" (1/3) ... [2024-11-12 05:49:10,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b492d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:49:10, skipping insertion in model container [2024-11-12 05:49:10,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:49:10" (2/3) ... [2024-11-12 05:49:10,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b492d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:49:10, skipping insertion in model container [2024-11-12 05:49:10,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:49:10" (3/3) ... [2024-11-12 05:49:10,994 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-10.i [2024-11-12 05:49:11,007 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:49:11,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:49:11,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:49:11,064 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;@411737d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:49:11,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:49:11,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 05:49:11,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 05:49:11,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:49:11,079 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:49:11,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:49:11,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:49:11,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1915142532, now seen corresponding path program 1 times [2024-11-12 05:49:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:49:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145473433] [2024-11-12 05:49:11,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:49:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:49:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:49:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:49:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:49:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:49:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:49:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:49:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:49:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:49:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:49:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:49:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:49:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:49:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:49:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:49:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:49:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:49:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:49:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:49:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:49:11,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:49:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145473433] [2024-11-12 05:49:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145473433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:49:11,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:49:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:49:11,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347672519] [2024-11-12 05:49:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:49:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:49:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:49:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:49:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:49:11,810 INFO L87 Difference]: Start difference. First operand has 74 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:49:12,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:49:12,005 INFO L93 Difference]: Finished difference Result 209 states and 357 transitions. [2024-11-12 05:49:12,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:49:12,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2024-11-12 05:49:12,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:49:12,019 INFO L225 Difference]: With dead ends: 209 [2024-11-12 05:49:12,019 INFO L226 Difference]: Without dead ends: 138 [2024-11-12 05:49:12,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:49:12,025 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:49:12,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 384 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:49:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-12 05:49:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2024-11-12 05:49:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-12 05:49:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2024-11-12 05:49:12,083 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 122 [2024-11-12 05:49:12,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:49:12,085 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2024-11-12 05:49:12,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:49:12,085 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2024-11-12 05:49:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 05:49:12,088 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:49:12,088 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:49:12,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:49:12,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:49:12,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:49:12,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2009744545, now seen corresponding path program 1 times [2024-11-12 05:49:12,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:49:12,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263950934] [2024-11-12 05:49:12,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:49:12,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:49:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:49:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:49:27,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:49:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:49:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:49:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:49:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:49:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:49:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:49:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:49:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:49:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:49:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:49:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:49:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:49:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:49:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:49:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:49:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:49:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:49:27,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:49:27,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263950934] [2024-11-12 05:49:27,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263950934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:49:27,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:49:27,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 05:49:27,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729350429] [2024-11-12 05:49:27,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:49:27,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 05:49:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:49:27,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 05:49:27,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:49:27,182 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 05:49:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:49:28,608 INFO L93 Difference]: Finished difference Result 341 states and 493 transitions. [2024-11-12 05:49:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 05:49:28,609 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-12 05:49:28,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:49:28,612 INFO L225 Difference]: With dead ends: 341 [2024-11-12 05:49:28,614 INFO L226 Difference]: Without dead ends: 274 [2024-11-12 05:49:28,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-11-12 05:49:28,617 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 666 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:49:28,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 562 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:49:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-12 05:49:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 187. [2024-11-12 05:49:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.296875) internal successors, (166), 129 states have internal predecessors, (166), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 05:49:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-12 05:49:28,651 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 123 [2024-11-12 05:49:28,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:49:28,652 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-12 05:49:28,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 05:49:28,653 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-12 05:49:28,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 05:49:28,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:49:28,656 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:49:28,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:49:28,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:49:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:49:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1329686175, now seen corresponding path program 1 times [2024-11-12 05:49:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:49:28,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212455951] [2024-11-12 05:49:28,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:49:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:49:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:50:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:50:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:50:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:50:24,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:50:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:50:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:50:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:50:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:50:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:50:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:50:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:50:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:50:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:50:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:50:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:50:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:50:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:50:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:50:24,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:50:24,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212455951] [2024-11-12 05:50:24,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212455951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:50:24,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:50:24,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 05:50:24,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787292942] [2024-11-12 05:50:24,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:50:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 05:50:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:50:24,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 05:50:24,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:50:24,734 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 05:50:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:50:26,090 INFO L93 Difference]: Finished difference Result 343 states and 492 transitions. [2024-11-12 05:50:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 05:50:26,091 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 123 [2024-11-12 05:50:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:50:26,094 INFO L225 Difference]: With dead ends: 343 [2024-11-12 05:50:26,094 INFO L226 Difference]: Without dead ends: 276 [2024-11-12 05:50:26,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2024-11-12 05:50:26,097 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 499 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:50:26,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 528 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:50:26,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-12 05:50:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 187. [2024-11-12 05:50:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 128 states have (on average 1.296875) internal successors, (166), 129 states have internal predecessors, (166), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 05:50:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-12 05:50:26,115 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 123 [2024-11-12 05:50:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:50:26,115 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-12 05:50:26,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 05:50:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-12 05:50:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 05:50:26,117 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:50:26,117 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:26,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:50:26,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:50:26,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:50:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1137097311, now seen corresponding path program 1 times [2024-11-12 05:50:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:50:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875048671] [2024-11-12 05:50:26,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:50:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:50:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:50:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:50:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:50:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:50:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:50:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:50:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:50:40,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:50:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:50:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:50:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:50:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:50:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:50:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:50:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:50:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:50:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:50:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:50:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:50:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:50:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:50:40,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875048671] [2024-11-12 05:50:40,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875048671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:50:40,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:50:40,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 05:50:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321591831] [2024-11-12 05:50:40,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:50:40,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 05:50:40,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:50:40,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 05:50:40,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-12 05:50:40,975 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-12 05:50:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:50:42,741 INFO L93 Difference]: Finished difference Result 385 states and 538 transitions. [2024-11-12 05:50:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 05:50:42,742 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 123 [2024-11-12 05:50:42,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:50:42,744 INFO L225 Difference]: With dead ends: 385 [2024-11-12 05:50:42,744 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 05:50:42,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-11-12 05:50:42,746 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 922 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:50:42,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 636 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 05:50:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 05:50:42,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 208. [2024-11-12 05:50:42,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.2758620689655173) internal successors, (185), 146 states have internal predecessors, (185), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 05:50:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 293 transitions. [2024-11-12 05:50:42,773 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 293 transitions. Word has length 123 [2024-11-12 05:50:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:50:42,773 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 293 transitions. [2024-11-12 05:50:42,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-12 05:50:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 293 transitions. [2024-11-12 05:50:42,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-12 05:50:42,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:50:42,779 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:42,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:50:42,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:50:42,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:50:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1395262749, now seen corresponding path program 1 times [2024-11-12 05:50:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:50:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665917601] [2024-11-12 05:50:42,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:50:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:50:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat