./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-1loop_file-34.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 aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:42:18,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:42:18,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:42:18,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:42:18,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:42:18,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:42:18,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:42:18,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:42:18,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:42:18,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:42:18,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:42:18,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:42:18,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:42:18,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:42:18,998 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:42:18,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:42:18,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:42:18,999 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:42:19,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:42:19,000 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:42:19,000 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:42:19,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:42:19,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:42:19,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:42:19,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:42:19,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:42:19,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:42:19,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:42:19,003 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:42:19,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:42:19,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:42:19,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:42:19,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:42:19,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:42:19,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:42:19,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:42:19,006 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:42:19,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:42:19,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:42:19,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:42:19,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:42:19,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:42:19,008 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 -> aa1b7e3020c9e54f93d45078f4a249ca3b737cc17c725ce83b71e2a4a5a42766 [2024-11-16 16:42:19,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:42:19,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:42:19,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:42:19,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:42:19,324 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:42:19,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-16 16:42:20,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:42:21,041 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:42:21,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-16 16:42:21,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3658eb5e/f7bf71c7c2d34a1da83c203a3fa556a7/FLAG8085c5819 [2024-11-16 16:42:21,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3658eb5e/f7bf71c7c2d34a1da83c203a3fa556a7 [2024-11-16 16:42:21,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:42:21,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:42:21,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:42:21,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:42:21,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:42:21,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@566e698f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21, skipping insertion in model container [2024-11-16 16:42:21,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:42:21,331 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-1loop_file-34.i[915,928] [2024-11-16 16:42:21,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:42:21,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:42:21,416 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-1loop_file-34.i[915,928] [2024-11-16 16:42:21,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:42:21,461 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:42:21,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21 WrapperNode [2024-11-16 16:42:21,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:42:21,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:42:21,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:42:21,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:42:21,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,519 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-16 16:42:21,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:42:21,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:42:21,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:42:21,521 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:42:21,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,559 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-16 16:42:21,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,574 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:42:21,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:42:21,585 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:42:21,585 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:42:21,586 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (1/1) ... [2024-11-16 16:42:21,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:42:21,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:42:21,632 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-16 16:42:21,635 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-16 16:42:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:42:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:42:21,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:42:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:42:21,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:42:21,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:42:21,752 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:42:21,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:42:22,160 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2024-11-16 16:42:22,203 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-16 16:42:22,203 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:42:22,243 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:42:22,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:42:22,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:42:22 BoogieIcfgContainer [2024-11-16 16:42:22,245 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:42:22,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:42:22,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:42:22,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:42:22,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:42:21" (1/3) ... [2024-11-16 16:42:22,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721c6ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:42:22, skipping insertion in model container [2024-11-16 16:42:22,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:42:21" (2/3) ... [2024-11-16 16:42:22,253 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721c6ce7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:42:22, skipping insertion in model container [2024-11-16 16:42:22,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:42:22" (3/3) ... [2024-11-16 16:42:22,256 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-34.i [2024-11-16 16:42:22,271 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:42:22,271 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:42:22,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:42:22,339 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;@5891ae41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:42:22,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:42:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 16:42:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 16:42:22,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:22,356 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:22,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:22,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1116078717, now seen corresponding path program 1 times [2024-11-16 16:42:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:22,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869228880] [2024-11-16 16:42:22,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:22,801 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:22,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:22,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869228880] [2024-11-16 16:42:22,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869228880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:22,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:22,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:42:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962967974] [2024-11-16 16:42:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:22,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:42:22,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:42:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:42:22,844 INFO L87 Difference]: Start difference. First operand has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:42:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:22,891 INFO L93 Difference]: Finished difference Result 144 states and 231 transitions. [2024-11-16 16:42:22,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:42:22,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-11-16 16:42:22,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:22,910 INFO L225 Difference]: With dead ends: 144 [2024-11-16 16:42:22,910 INFO L226 Difference]: Without dead ends: 69 [2024-11-16 16:42:22,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:42:22,917 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:22,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:42:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-16 16:42:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-16 16:42:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-16 16:42:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-16 16:42:22,959 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 96 [2024-11-16 16:42:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:22,960 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-16 16:42:22,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:42:22,960 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-16 16:42:22,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 16:42:22,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:22,964 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:22,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:42:22,965 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:22,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:22,966 INFO L85 PathProgramCache]: Analyzing trace with hash -948426654, now seen corresponding path program 1 times [2024-11-16 16:42:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:22,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648195537] [2024-11-16 16:42:22,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:22,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:23,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648195537] [2024-11-16 16:42:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648195537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:23,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:23,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:42:23,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110562486] [2024-11-16 16:42:23,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:23,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:42:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:42:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:42:23,548 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:23,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:23,745 INFO L93 Difference]: Finished difference Result 233 states and 350 transitions. [2024-11-16 16:42:23,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:42:23,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-16 16:42:23,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:23,748 INFO L225 Difference]: With dead ends: 233 [2024-11-16 16:42:23,748 INFO L226 Difference]: Without dead ends: 167 [2024-11-16 16:42:23,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:42:23,751 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 133 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:23,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 314 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:42:23,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-16 16:42:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 134. [2024-11-16 16:42:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 16:42:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 202 transitions. [2024-11-16 16:42:23,790 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 202 transitions. Word has length 96 [2024-11-16 16:42:23,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:23,792 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 202 transitions. [2024-11-16 16:42:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 202 transitions. [2024-11-16 16:42:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 16:42:23,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:23,796 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:23,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:42:23,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash 377050540, now seen corresponding path program 1 times [2024-11-16 16:42:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:23,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921411036] [2024-11-16 16:42:23,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:24,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:24,169 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:24,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:24,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921411036] [2024-11-16 16:42:24,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921411036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:24,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:24,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:42:24,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136239218] [2024-11-16 16:42:24,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:24,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:42:24,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:24,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:42:24,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:42:24,172 INFO L87 Difference]: Start difference. First operand 134 states and 202 transitions. 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:24,445 INFO L93 Difference]: Finished difference Result 392 states and 590 transitions. [2024-11-16 16:42:24,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:42:24,446 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-16 16:42:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:24,449 INFO L225 Difference]: With dead ends: 392 [2024-11-16 16:42:24,449 INFO L226 Difference]: Without dead ends: 261 [2024-11-16 16:42:24,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-16 16:42:24,454 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 138 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:24,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 396 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:42:24,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-16 16:42:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 138. [2024-11-16 16:42:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 16:42:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2024-11-16 16:42:24,488 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 206 transitions. Word has length 97 [2024-11-16 16:42:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:24,489 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 206 transitions. [2024-11-16 16:42:24,489 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, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 206 transitions. [2024-11-16 16:42:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:42:24,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:24,491 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:24,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:42:24,494 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:24,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 729838885, now seen corresponding path program 1 times [2024-11-16 16:42:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:24,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760179747] [2024-11-16 16:42:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:27,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:27,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760179747] [2024-11-16 16:42:27,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760179747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:27,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:42:27,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969685356] [2024-11-16 16:42:27,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:27,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:42:27,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:42:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:42:27,595 INFO L87 Difference]: Start difference. First operand 138 states and 206 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:28,103 INFO L93 Difference]: Finished difference Result 441 states and 653 transitions. [2024-11-16 16:42:28,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:42:28,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-16 16:42:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:28,107 INFO L225 Difference]: With dead ends: 441 [2024-11-16 16:42:28,109 INFO L226 Difference]: Without dead ends: 306 [2024-11-16 16:42:28,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:42:28,114 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:28,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 298 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:42:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-16 16:42:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 186. [2024-11-16 16:42:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 143 states have (on average 1.3986013986013985) internal successors, (200), 143 states have internal predecessors, (200), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2024-11-16 16:42:28,161 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 98 [2024-11-16 16:42:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:28,162 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2024-11-16 16:42:28,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2024-11-16 16:42:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:42:28,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:28,163 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:28,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:42:28,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:28,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:28,164 INFO L85 PathProgramCache]: Analyzing trace with hash -62336342, now seen corresponding path program 1 times [2024-11-16 16:42:28,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:28,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949511210] [2024-11-16 16:42:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:37,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:37,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:37,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949511210] [2024-11-16 16:42:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949511210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:37,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 16:42:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378900065] [2024-11-16 16:42:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:37,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 16:42:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 16:42:37,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:42:37,199 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:39,774 INFO L93 Difference]: Finished difference Result 667 states and 958 transitions. [2024-11-16 16:42:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 16:42:39,776 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-16 16:42:39,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:39,779 INFO L225 Difference]: With dead ends: 667 [2024-11-16 16:42:39,779 INFO L226 Difference]: Without dead ends: 515 [2024-11-16 16:42:39,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2024-11-16 16:42:39,782 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 708 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:39,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 628 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 16:42:39,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-16 16:42:39,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 275. [2024-11-16 16:42:39,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 232 states have (on average 1.4094827586206897) internal successors, (327), 232 states have internal predecessors, (327), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 405 transitions. [2024-11-16 16:42:39,808 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 405 transitions. Word has length 98 [2024-11-16 16:42:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:39,809 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 405 transitions. [2024-11-16 16:42:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 405 transitions. [2024-11-16 16:42:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:42:39,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:39,814 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:39,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:42:39,815 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:39,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:39,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1680473993, now seen corresponding path program 1 times [2024-11-16 16:42:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:39,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800602752] [2024-11-16 16:42:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:42,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:42,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:42,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800602752] [2024-11-16 16:42:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800602752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:42,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:42:42,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699730922] [2024-11-16 16:42:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:42,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:42:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:42,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:42:42,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:42:42,705 INFO L87 Difference]: Start difference. First operand 275 states and 405 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:44,198 INFO L93 Difference]: Finished difference Result 646 states and 953 transitions. [2024-11-16 16:42:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:42:44,198 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-16 16:42:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:44,202 INFO L225 Difference]: With dead ends: 646 [2024-11-16 16:42:44,202 INFO L226 Difference]: Without dead ends: 495 [2024-11-16 16:42:44,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:42:44,203 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 393 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:44,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 397 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 16:42:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-16 16:42:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 320. [2024-11-16 16:42:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 277 states have (on average 1.3935018050541517) internal successors, (386), 277 states have internal predecessors, (386), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 464 transitions. [2024-11-16 16:42:44,233 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 464 transitions. Word has length 98 [2024-11-16 16:42:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:44,235 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 464 transitions. [2024-11-16 16:42:44,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:44,235 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 464 transitions. [2024-11-16 16:42:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:42:44,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:44,237 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:44,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:42:44,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash -258849847, now seen corresponding path program 1 times [2024-11-16 16:42:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370929037] [2024-11-16 16:42:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:45,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:45,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370929037] [2024-11-16 16:42:45,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370929037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:45,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:45,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:42:45,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302650957] [2024-11-16 16:42:45,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:45,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:42:45,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:42:45,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:42:45,895 INFO L87 Difference]: Start difference. First operand 320 states and 464 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:42:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:47,033 INFO L93 Difference]: Finished difference Result 639 states and 921 transitions. [2024-11-16 16:42:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 16:42:47,033 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 98 [2024-11-16 16:42:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:47,035 INFO L225 Difference]: With dead ends: 639 [2024-11-16 16:42:47,035 INFO L226 Difference]: Without dead ends: 490 [2024-11-16 16:42:47,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-16 16:42:47,037 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 460 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:47,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 457 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 16:42:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-16 16:42:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 376. [2024-11-16 16:42:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 333 states have (on average 1.4294294294294294) internal successors, (476), 333 states have internal predecessors, (476), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 554 transitions. [2024-11-16 16:42:47,060 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 554 transitions. Word has length 98 [2024-11-16 16:42:47,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:47,060 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 554 transitions. [2024-11-16 16:42:47,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-16 16:42:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 554 transitions. [2024-11-16 16:42:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-16 16:42:47,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:47,062 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:47,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:42:47,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:47,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:47,062 INFO L85 PathProgramCache]: Analyzing trace with hash -2057576602, now seen corresponding path program 1 times [2024-11-16 16:42:47,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:47,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4049206] [2024-11-16 16:42:47,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:47,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:47,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:47,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4049206] [2024-11-16 16:42:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4049206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:47,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:42:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709266270] [2024-11-16 16:42:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:47,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:42:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:47,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:42:47,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:42:47,356 INFO L87 Difference]: Start difference. First operand 376 states and 554 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:47,571 INFO L93 Difference]: Finished difference Result 598 states and 883 transitions. [2024-11-16 16:42:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:42:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-16 16:42:47,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:47,574 INFO L225 Difference]: With dead ends: 598 [2024-11-16 16:42:47,574 INFO L226 Difference]: Without dead ends: 369 [2024-11-16 16:42:47,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:42:47,578 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 84 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:47,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 234 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:42:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-16 16:42:47,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 338. [2024-11-16 16:42:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 295 states have (on average 1.3898305084745763) internal successors, (410), 295 states have internal predecessors, (410), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 488 transitions. [2024-11-16 16:42:47,613 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 488 transitions. Word has length 98 [2024-11-16 16:42:47,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:47,613 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 488 transitions. [2024-11-16 16:42:47,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 488 transitions. [2024-11-16 16:42:47,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:42:47,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:47,616 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:47,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:42:47,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:47,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash -2063595760, now seen corresponding path program 1 times [2024-11-16 16:42:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:47,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488556864] [2024-11-16 16:42:47,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:47,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:50,262 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:50,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:50,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488556864] [2024-11-16 16:42:50,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488556864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:50,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:50,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 16:42:50,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943158371] [2024-11-16 16:42:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:50,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 16:42:50,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:50,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 16:42:50,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:42:50,265 INFO L87 Difference]: Start difference. First operand 338 states and 488 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:52,066 INFO L93 Difference]: Finished difference Result 678 states and 969 transitions. [2024-11-16 16:42:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 16:42:52,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-16 16:42:52,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:52,069 INFO L225 Difference]: With dead ends: 678 [2024-11-16 16:42:52,069 INFO L226 Difference]: Without dead ends: 543 [2024-11-16 16:42:52,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:42:52,071 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 265 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:52,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 428 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 16:42:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-16 16:42:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 362. [2024-11-16 16:42:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 317 states have (on average 1.3690851735015772) internal successors, (434), 317 states have internal predecessors, (434), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 512 transitions. [2024-11-16 16:42:52,100 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 512 transitions. Word has length 99 [2024-11-16 16:42:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 512 transitions. [2024-11-16 16:42:52,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 512 transitions. [2024-11-16 16:42:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:42:52,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:52,102 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:52,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 16:42:52,102 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -401630282, now seen corresponding path program 1 times [2024-11-16 16:42:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:52,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779501994] [2024-11-16 16:42:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:42:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:42:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:42:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:42:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:42:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:42:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:42:56,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:42:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:42:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:42:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:42:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:42:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:42:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:42:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:42:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:42:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779501994] [2024-11-16 16:42:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779501994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:42:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:42:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 16:42:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966889720] [2024-11-16 16:42:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:42:56,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 16:42:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:42:56,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 16:42:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:42:56,097 INFO L87 Difference]: Start difference. First operand 362 states and 512 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:42:58,698 INFO L93 Difference]: Finished difference Result 816 states and 1139 transitions. [2024-11-16 16:42:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 16:42:58,698 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-16 16:42:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:42:58,702 INFO L225 Difference]: With dead ends: 816 [2024-11-16 16:42:58,702 INFO L226 Difference]: Without dead ends: 591 [2024-11-16 16:42:58,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-11-16 16:42:58,706 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 427 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:42:58,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 735 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 16:42:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-16 16:42:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 410. [2024-11-16 16:42:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 365 states have (on average 1.3753424657534246) internal successors, (502), 365 states have internal predecessors, (502), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:42:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 580 transitions. [2024-11-16 16:42:58,744 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 580 transitions. Word has length 99 [2024-11-16 16:42:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:42:58,745 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 580 transitions. [2024-11-16 16:42:58,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:42:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 580 transitions. [2024-11-16 16:42:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 16:42:58,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:42:58,748 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:42:58,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:42:58,749 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:42:58,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:42:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash -598143787, now seen corresponding path program 1 times [2024-11-16 16:42:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:42:58,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730780490] [2024-11-16 16:42:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:42:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:42:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:43:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:43:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:43:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:43:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:43:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:43:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:43:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:43:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:43:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:43:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:43:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:43:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:43:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:43:02,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:43:02,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730780490] [2024-11-16 16:43:02,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730780490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:43:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:43:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 16:43:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238518351] [2024-11-16 16:43:02,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:43:02,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 16:43:02,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:43:02,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 16:43:02,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:43:02,398 INFO L87 Difference]: Start difference. First operand 410 states and 580 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:04,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:43:04,255 INFO L93 Difference]: Finished difference Result 719 states and 989 transitions. [2024-11-16 16:43:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 16:43:04,255 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-16 16:43:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:43:04,258 INFO L225 Difference]: With dead ends: 719 [2024-11-16 16:43:04,258 INFO L226 Difference]: Without dead ends: 568 [2024-11-16 16:43:04,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-16 16:43:04,262 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 330 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 16:43:04,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 644 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 16:43:04,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-11-16 16:43:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 402. [2024-11-16 16:43:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 357 states have (on average 1.3781512605042017) internal successors, (492), 357 states have internal predecessors, (492), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:43:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 570 transitions. [2024-11-16 16:43:04,296 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 570 transitions. Word has length 99 [2024-11-16 16:43:04,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:43:04,296 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 570 transitions. [2024-11-16 16:43:04,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:04,297 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 570 transitions. [2024-11-16 16:43:04,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:43:04,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:43:04,298 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:43:04,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 16:43:04,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:43:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:43:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1587039686, now seen corresponding path program 1 times [2024-11-16 16:43:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:43:04,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633477158] [2024-11-16 16:43:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:43:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:43:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:43:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:43:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:43:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:43:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:43:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:43:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:43:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:43:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:43:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:43:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:43:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:43:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:43:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:43:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:43:06,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633477158] [2024-11-16 16:43:06,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633477158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:43:06,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:43:06,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:43:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709191750] [2024-11-16 16:43:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:43:06,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:43:06,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:43:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:43:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:43:06,958 INFO L87 Difference]: Start difference. First operand 402 states and 570 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:08,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:43:08,592 INFO L93 Difference]: Finished difference Result 816 states and 1156 transitions. [2024-11-16 16:43:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 16:43:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-16 16:43:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:43:08,598 INFO L225 Difference]: With dead ends: 816 [2024-11-16 16:43:08,599 INFO L226 Difference]: Without dead ends: 665 [2024-11-16 16:43:08,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-16 16:43:08,601 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 303 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:43:08,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 504 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:43:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-16 16:43:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 410. [2024-11-16 16:43:08,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 365 states have (on average 1.3753424657534246) internal successors, (502), 365 states have internal predecessors, (502), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:43:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 580 transitions. [2024-11-16 16:43:08,633 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 580 transitions. Word has length 100 [2024-11-16 16:43:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:43:08,636 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 580 transitions. [2024-11-16 16:43:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:08,636 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 580 transitions. [2024-11-16 16:43:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:43:08,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:43:08,638 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:43:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 16:43:08,638 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:43:08,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:43:08,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1390526181, now seen corresponding path program 1 times [2024-11-16 16:43:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:43:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102592156] [2024-11-16 16:43:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:43:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:43:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:43:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:43:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:43:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:43:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:43:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:43:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:43:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:43:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:43:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:43:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:43:15,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:15,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:43:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:43:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:43:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:43:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102592156] [2024-11-16 16:43:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102592156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:43:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:43:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 16:43:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034977915] [2024-11-16 16:43:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:43:16,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 16:43:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:43:16,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 16:43:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:43:16,012 INFO L87 Difference]: Start difference. First operand 410 states and 580 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:43:16,942 INFO L93 Difference]: Finished difference Result 668 states and 929 transitions. [2024-11-16 16:43:16,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 16:43:16,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-16 16:43:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:43:16,945 INFO L225 Difference]: With dead ends: 668 [2024-11-16 16:43:16,945 INFO L226 Difference]: Without dead ends: 497 [2024-11-16 16:43:16,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-11-16 16:43:16,947 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 237 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:43:16,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 509 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 16:43:16,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-16 16:43:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 402. [2024-11-16 16:43:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 357 states have (on average 1.3725490196078431) internal successors, (490), 357 states have internal predecessors, (490), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:43:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 568 transitions. [2024-11-16 16:43:16,977 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 568 transitions. Word has length 100 [2024-11-16 16:43:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:43:16,977 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 568 transitions. [2024-11-16 16:43:16,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 568 transitions. [2024-11-16 16:43:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:43:16,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:43:16,979 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:43:16,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 16:43:16,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:43:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:43:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash 681107983, now seen corresponding path program 1 times [2024-11-16 16:43:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:43:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960361646] [2024-11-16 16:43:16,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:43:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:43:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:43:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:43:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:43:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:43:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:43:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:43:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:43:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:43:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:43:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:43:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:43:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:43:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:43:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:43:20,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:43:20,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960361646] [2024-11-16 16:43:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960361646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:43:20,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:43:20,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 16:43:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217830094] [2024-11-16 16:43:20,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:43:20,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 16:43:20,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:43:20,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 16:43:20,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:43:20,640 INFO L87 Difference]: Start difference. First operand 402 states and 568 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:43:25,722 INFO L93 Difference]: Finished difference Result 847 states and 1190 transitions. [2024-11-16 16:43:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 16:43:25,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-16 16:43:25,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:43:25,726 INFO L225 Difference]: With dead ends: 847 [2024-11-16 16:43:25,726 INFO L226 Difference]: Without dead ends: 690 [2024-11-16 16:43:25,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2024-11-16 16:43:25,727 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 390 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:43:25,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 478 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 16:43:25,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-16 16:43:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 414. [2024-11-16 16:43:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 369 states have (on average 1.3766937669376693) internal successors, (508), 369 states have internal predecessors, (508), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:43:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 586 transitions. [2024-11-16 16:43:25,766 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 586 transitions. Word has length 100 [2024-11-16 16:43:25,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:43:25,767 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 586 transitions. [2024-11-16 16:43:25,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 586 transitions. [2024-11-16 16:43:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:43:25,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:43:25,770 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:43:25,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 16:43:25,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:43:25,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:43:25,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1258215857, now seen corresponding path program 1 times [2024-11-16 16:43:25,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:43:25,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383411406] [2024-11-16 16:43:25,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:43:25,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:43:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:43:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:43:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 16:43:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:43:29,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 16:43:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:43:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:43:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:43:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 16:43:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 16:43:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 16:43:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 16:43:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 16:43:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:43:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-16 16:43:29,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:43:29,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383411406] [2024-11-16 16:43:29,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383411406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:43:29,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:43:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 16:43:29,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693370438] [2024-11-16 16:43:29,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:43:29,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 16:43:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:43:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 16:43:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:43:29,388 INFO L87 Difference]: Start difference. First operand 414 states and 586 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:43:32,208 INFO L93 Difference]: Finished difference Result 989 states and 1390 transitions. [2024-11-16 16:43:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 16:43:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 100 [2024-11-16 16:43:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:43:32,212 INFO L225 Difference]: With dead ends: 989 [2024-11-16 16:43:32,212 INFO L226 Difference]: Without dead ends: 735 [2024-11-16 16:43:32,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-16 16:43:32,216 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 413 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:43:32,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 654 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 16:43:32,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-11-16 16:43:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 448. [2024-11-16 16:43:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 403 states have (on average 1.3746898263027296) internal successors, (554), 403 states have internal predecessors, (554), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-16 16:43:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 632 transitions. [2024-11-16 16:43:32,267 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 632 transitions. Word has length 100 [2024-11-16 16:43:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:43:32,267 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 632 transitions. [2024-11-16 16:43:32,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 13 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-16 16:43:32,274 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 632 transitions. [2024-11-16 16:43:32,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 16:43:32,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:43:32,276 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 16:43:32,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 16:43:32,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:43:32,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:43:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash 484594478, now seen corresponding path program 1 times [2024-11-16 16:43:32,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:43:32,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578343761] [2024-11-16 16:43:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:43:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:43:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat