./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.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 15cc89c7e1960c2febb69088039cfa5518d1d373f8e6bef80768aca87eabe926 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:32:19,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:32:19,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:32:19,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:32:19,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:32:19,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:32:19,353 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:32:19,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:32:19,355 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:32:19,355 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:32:19,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:32:19,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:32:19,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:32:19,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:32:19,357 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:32:19,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:32:19,358 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:32:19,358 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:32:19,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:32:19,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:32:19,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:32:19,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:32:19,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:32:19,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:32:19,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:32:19,367 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:32:19,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:32:19,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:32:19,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:32:19,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:32:19,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:32:19,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:32:19,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:32:19,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:32:19,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:32:19,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:32:19,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:32:19,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:32:19,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:32:19,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:32:19,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:32:19,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:32:19,371 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 -> 15cc89c7e1960c2febb69088039cfa5518d1d373f8e6bef80768aca87eabe926 [2024-10-24 10:32:19,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:32:19,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:32:19,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:32:19,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:32:19,668 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:32:19,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i [2024-10-24 10:32:21,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:32:21,305 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:32:21,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i [2024-10-24 10:32:21,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bea4933c/94dbf852d36c468990fcad122e2c1f06/FLAG7802fa40b [2024-10-24 10:32:21,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bea4933c/94dbf852d36c468990fcad122e2c1f06 [2024-10-24 10:32:21,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:32:21,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:32:21,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:32:21,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:32:21,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:32:21,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bed3029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21, skipping insertion in model container [2024-10-24 10:32:21,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,378 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:32:21,566 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i[914,927] [2024-10-24 10:32:21,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:32:21,633 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:32:21,646 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-2.i[914,927] [2024-10-24 10:32:21,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:32:21,699 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:32:21,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21 WrapperNode [2024-10-24 10:32:21,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:32:21,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:32:21,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:32:21,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:32:21,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,749 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-10-24 10:32:21,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:32:21,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:32:21,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:32:21,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:32:21,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,791 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:32:21,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:32:21,811 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:32:21,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:32:21,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:32:21,814 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (1/1) ... [2024-10-24 10:32:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:32:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:21,848 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-10-24 10:32:21,857 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-10-24 10:32:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:32:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:32:21,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:32:21,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:32:21,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:32:21,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:32:22,011 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:32:22,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:32:22,276 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 10:32:22,277 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:32:22,345 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:32:22,345 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:32:22,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:32:22 BoogieIcfgContainer [2024-10-24 10:32:22,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:32:22,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:32:22,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:32:22,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:32:22,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:32:21" (1/3) ... [2024-10-24 10:32:22,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6b0801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:32:22, skipping insertion in model container [2024-10-24 10:32:22,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:32:21" (2/3) ... [2024-10-24 10:32:22,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6b0801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:32:22, skipping insertion in model container [2024-10-24 10:32:22,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:32:22" (3/3) ... [2024-10-24 10:32:22,357 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-2.i [2024-10-24 10:32:22,375 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:32:22,376 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:32:22,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:32:22,456 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;@2cec8a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:32:22,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:32:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:32:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 10:32:22,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:22,472 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:22,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:22,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1099332257, now seen corresponding path program 1 times [2024-10-24 10:32:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:22,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284389045] [2024-10-24 10:32:22,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:22,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:22,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:22,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284389045] [2024-10-24 10:32:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284389045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:22,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:22,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:32:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436445048] [2024-10-24 10:32:22,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:22,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:32:22,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:22,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:32:22,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:32:22,802 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:32:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:22,859 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2024-10-24 10:32:22,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:32:22,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-24 10:32:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:22,875 INFO L225 Difference]: With dead ends: 63 [2024-10-24 10:32:22,875 INFO L226 Difference]: Without dead ends: 31 [2024-10-24 10:32:22,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:32:22,883 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:22,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:32:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-24 10:32:22,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-24 10:32:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:32:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-24 10:32:22,921 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 54 [2024-10-24 10:32:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:22,922 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-24 10:32:22,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:32:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-24 10:32:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 10:32:22,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:22,926 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:22,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:32:22,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1927738719, now seen corresponding path program 1 times [2024-10-24 10:32:22,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:22,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631745140] [2024-10-24 10:32:22,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:22,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:23,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:23,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631745140] [2024-10-24 10:32:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631745140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:23,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:23,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:32:23,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637418972] [2024-10-24 10:32:23,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:32:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:23,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:32:23,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:32:23,681 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:32:23,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:23,879 INFO L93 Difference]: Finished difference Result 101 states and 143 transitions. [2024-10-24 10:32:23,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:32:23,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-24 10:32:23,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:23,882 INFO L225 Difference]: With dead ends: 101 [2024-10-24 10:32:23,882 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 10:32:23,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:32:23,884 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 66 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:23,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 186 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 10:32:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2024-10-24 10:32:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:32:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-10-24 10:32:23,927 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 54 [2024-10-24 10:32:23,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:23,927 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-10-24 10:32:23,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 10:32:23,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-10-24 10:32:23,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 10:32:23,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:23,929 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:23,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:32:23,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:23,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:23,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1118392093, now seen corresponding path program 1 times [2024-10-24 10:32:23,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:23,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309578132] [2024-10-24 10:32:23,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:23,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:26,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:26,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309578132] [2024-10-24 10:32:26,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309578132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:26,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:26,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:32:26,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759502665] [2024-10-24 10:32:26,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:32:26,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:32:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:32:26,044 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:26,541 INFO L93 Difference]: Finished difference Result 89 states and 123 transitions. [2024-10-24 10:32:26,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:32:26,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 54 [2024-10-24 10:32:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:26,543 INFO L225 Difference]: With dead ends: 89 [2024-10-24 10:32:26,543 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 10:32:26,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:32:26,545 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 58 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:26,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 127 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:26,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 10:32:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2024-10-24 10:32:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-24 10:32:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-10-24 10:32:26,568 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 54 [2024-10-24 10:32:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:26,569 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-10-24 10:32:26,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-10-24 10:32:26,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:26,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:26,574 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:26,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:32:26,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:26,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1642918390, now seen corresponding path program 1 times [2024-10-24 10:32:26,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463137966] [2024-10-24 10:32:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:26,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:27,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:27,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463137966] [2024-10-24 10:32:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463137966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:27,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:32:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874502016] [2024-10-24 10:32:27,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:27,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:32:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:32:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:32:27,307 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:27,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:27,667 INFO L93 Difference]: Finished difference Result 199 states and 277 transitions. [2024-10-24 10:32:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:32:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-24 10:32:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:27,671 INFO L225 Difference]: With dead ends: 199 [2024-10-24 10:32:27,672 INFO L226 Difference]: Without dead ends: 163 [2024-10-24 10:32:27,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2024-10-24 10:32:27,676 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 104 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:27,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 181 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:32:27,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-24 10:32:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 126. [2024-10-24 10:32:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.303370786516854) internal successors, (116), 89 states have internal predecessors, (116), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-24 10:32:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 180 transitions. [2024-10-24 10:32:27,711 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 180 transitions. Word has length 55 [2024-10-24 10:32:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:27,711 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 180 transitions. [2024-10-24 10:32:27,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:27,712 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 180 transitions. [2024-10-24 10:32:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:27,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:27,713 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:32:27,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1700176692, now seen corresponding path program 1 times [2024-10-24 10:32:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396823260] [2024-10-24 10:32:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:27,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:27,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396823260] [2024-10-24 10:32:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396823260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:32:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17088490] [2024-10-24 10:32:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:27,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:32:27,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:27,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:32:27,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:32:27,784 INFO L87 Difference]: Start difference. First operand 126 states and 180 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:27,829 INFO L93 Difference]: Finished difference Result 275 states and 388 transitions. [2024-10-24 10:32:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:32:27,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-24 10:32:27,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:27,831 INFO L225 Difference]: With dead ends: 275 [2024-10-24 10:32:27,834 INFO L226 Difference]: Without dead ends: 150 [2024-10-24 10:32:27,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:32:27,836 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:27,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:32:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-24 10:32:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2024-10-24 10:32:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 99 states have internal predecessors, (123), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 10:32:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 199 transitions. [2024-10-24 10:32:27,862 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 199 transitions. Word has length 55 [2024-10-24 10:32:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 199 transitions. [2024-10-24 10:32:27,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 199 transitions. [2024-10-24 10:32:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:27,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:27,864 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:27,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:32:27,866 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:27,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash 962860020, now seen corresponding path program 1 times [2024-10-24 10:32:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181588349] [2024-10-24 10:32:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:27,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:33,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:33,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181588349] [2024-10-24 10:32:33,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181588349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:33,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:32:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56375797] [2024-10-24 10:32:33,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:33,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:32:33,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:33,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:32:33,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:32:33,499 INFO L87 Difference]: Start difference. First operand 143 states and 199 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:34,012 INFO L93 Difference]: Finished difference Result 226 states and 310 transitions. [2024-10-24 10:32:34,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:34,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-24 10:32:34,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:34,020 INFO L225 Difference]: With dead ends: 226 [2024-10-24 10:32:34,024 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 10:32:34,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:34,027 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:34,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 115 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:32:34,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 10:32:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 145. [2024-10-24 10:32:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.25) internal successors, (125), 101 states have internal predecessors, (125), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 10:32:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2024-10-24 10:32:34,052 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 55 [2024-10-24 10:32:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:34,053 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2024-10-24 10:32:34,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:34,053 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2024-10-24 10:32:34,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-24 10:32:34,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:34,054 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:34,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:32:34,055 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:34,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:34,055 INFO L85 PathProgramCache]: Analyzing trace with hash -324168414, now seen corresponding path program 1 times [2024-10-24 10:32:34,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:34,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477815274] [2024-10-24 10:32:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:34,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:34,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477815274] [2024-10-24 10:32:34,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477815274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:34,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:34,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:32:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998692600] [2024-10-24 10:32:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:34,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:32:34,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:34,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:32:34,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:32:34,241 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:34,432 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2024-10-24 10:32:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:32:34,433 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2024-10-24 10:32:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:34,435 INFO L225 Difference]: With dead ends: 254 [2024-10-24 10:32:34,435 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 10:32:34,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:32:34,436 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 52 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:34,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 175 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 10:32:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2024-10-24 10:32:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.2358490566037736) internal successors, (131), 107 states have internal predecessors, (131), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 10:32:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-10-24 10:32:34,468 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 55 [2024-10-24 10:32:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:34,469 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-10-24 10:32:34,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-10-24 10:32:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:32:34,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:34,473 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:34,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:32:34,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:34,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1459036371, now seen corresponding path program 1 times [2024-10-24 10:32:34,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98834309] [2024-10-24 10:32:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:34,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:34,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:34,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98834309] [2024-10-24 10:32:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98834309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:34,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:34,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:32:34,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863559667] [2024-10-24 10:32:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:34,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:32:34,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:34,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:32:34,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:32:34,621 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:34,715 INFO L93 Difference]: Finished difference Result 254 states and 345 transitions. [2024-10-24 10:32:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:32:34,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-24 10:32:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:34,719 INFO L225 Difference]: With dead ends: 254 [2024-10-24 10:32:34,719 INFO L226 Difference]: Without dead ends: 165 [2024-10-24 10:32:34,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:32:34,720 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:34,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 135 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:32:34,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-24 10:32:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2024-10-24 10:32:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 109 states have internal predecessors, (133), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 10:32:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2024-10-24 10:32:34,744 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 56 [2024-10-24 10:32:34,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:34,747 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2024-10-24 10:32:34,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:34,747 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2024-10-24 10:32:34,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-24 10:32:34,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:34,751 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:34,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 10:32:34,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:34,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:34,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1458976789, now seen corresponding path program 1 times [2024-10-24 10:32:34,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:34,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717596859] [2024-10-24 10:32:34,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:34,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:36,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:36,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717596859] [2024-10-24 10:32:36,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717596859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:36,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:36,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 10:32:36,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968070322] [2024-10-24 10:32:36,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:36,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 10:32:36,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:36,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 10:32:36,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:32:36,679 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:37,335 INFO L93 Difference]: Finished difference Result 182 states and 239 transitions. [2024-10-24 10:32:37,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 10:32:37,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 56 [2024-10-24 10:32:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:37,338 INFO L225 Difference]: With dead ends: 182 [2024-10-24 10:32:37,338 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 10:32:37,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-24 10:32:37,339 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:37,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 202 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:32:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 10:32:37,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 160. [2024-10-24 10:32:37,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 116 states have internal predecessors, (141), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-24 10:32:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2024-10-24 10:32:37,361 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 56 [2024-10-24 10:32:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:37,362 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2024-10-24 10:32:37,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2024-10-24 10:32:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 10:32:37,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:37,364 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:37,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 10:32:37,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1356229116, now seen corresponding path program 1 times [2024-10-24 10:32:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764717160] [2024-10-24 10:32:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-24 10:32:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764717160] [2024-10-24 10:32:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764717160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:32:38,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:32:38,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 10:32:38,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960768564] [2024-10-24 10:32:38,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:32:38,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 10:32:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:32:38,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 10:32:38,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:32:38,724 INFO L87 Difference]: Start difference. First operand 160 states and 217 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:32:39,329 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2024-10-24 10:32:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:32:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2024-10-24 10:32:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:32:39,331 INFO L225 Difference]: With dead ends: 206 [2024-10-24 10:32:39,331 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 10:32:39,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2024-10-24 10:32:39,332 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 98 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:32:39,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 198 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:32:39,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 10:32:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2024-10-24 10:32:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 139 states have internal predecessors, (169), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-24 10:32:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2024-10-24 10:32:39,353 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 57 [2024-10-24 10:32:39,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:32:39,354 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2024-10-24 10:32:39,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-24 10:32:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2024-10-24 10:32:39,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 10:32:39,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:32:39,356 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:32:39,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 10:32:39,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:32:39,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:32:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash 244190447, now seen corresponding path program 1 times [2024-10-24 10:32:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:32:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441735281] [2024-10-24 10:32:39,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:39,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:32:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:32:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:32:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:32:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:32:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:32:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:32:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:32:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:32:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 10:32:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 10:32:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 10:32:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 10:32:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 10:32:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 10:32:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 10:32:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 10:32:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2024-10-24 10:32:40,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:32:40,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441735281] [2024-10-24 10:32:40,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441735281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:32:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221231995] [2024-10-24 10:32:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:32:40,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:32:40,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:32:40,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:32:40,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:32:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:32:41,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 10:32:41,096 INFO L278 TraceCheckSpWp]: Computing forward predicates...