./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-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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-56.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 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:18:15,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:18:15,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:18:15,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:18:15,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:18:15,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:18:15,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:18:15,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:18:15,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:18:15,774 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:18:15,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:18:15,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:18:15,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:18:15,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:18:15,775 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:18:15,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:18:15,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:18:15,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:18:15,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:18:15,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:18:15,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:18:15,777 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:18:15,777 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:18:15,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:18:15,778 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:18:15,778 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:18:15,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:18:15,778 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:18:15,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:18:15,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:18:15,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:18:15,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:18:15,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:18:15,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:18:15,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:18:15,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:18:15,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:18:15,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:18:15,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:18:15,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:18:15,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:18:15,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:18:15,782 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 -> 9db1cd65bc75e5074bada94c2cde698267c3661942827a0dbfb399cf3fcd8571 [2024-10-13 05:18:15,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:18:16,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:18:16,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:18:16,016 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:18:16,017 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:18:16,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2024-10-13 05:18:17,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:18:17,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:18:17,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-56.i [2024-10-13 05:18:17,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86350ca5a/eebd5e47efcb47c0996ad00a81c237bc/FLAG5485f75a1 [2024-10-13 05:18:17,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86350ca5a/eebd5e47efcb47c0996ad00a81c237bc [2024-10-13 05:18:17,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:18:17,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:18:17,549 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:18:17,549 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:18:17,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:18:17,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fccd19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17, skipping insertion in model container [2024-10-13 05:18:17,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:18:17,691 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-56.i[915,928] [2024-10-13 05:18:17,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:18:17,748 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:18:17,761 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-56.i[915,928] [2024-10-13 05:18:17,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:18:17,798 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:18:17,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17 WrapperNode [2024-10-13 05:18:17,799 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:18:17,800 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:18:17,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:18:17,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:18:17,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,851 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-13 05:18:17,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:18:17,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:18:17,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:18:17,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:18:17,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,919 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-13 05:18:17,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,933 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:18:17,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:18:17,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:18:17,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:18:17,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (1/1) ... [2024-10-13 05:18:17,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:18:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:18:17,988 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-13 05:18:17,995 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-13 05:18:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:18:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:18:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:18:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:18:18,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:18:18,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:18:18,091 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:18:18,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:18:18,289 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 05:18:18,290 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:18:18,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:18:18,327 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:18:18,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:18:18 BoogieIcfgContainer [2024-10-13 05:18:18,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:18:18,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:18:18,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:18:18,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:18:18,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:18:17" (1/3) ... [2024-10-13 05:18:18,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d578097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:18:18, skipping insertion in model container [2024-10-13 05:18:18,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:18:17" (2/3) ... [2024-10-13 05:18:18,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d578097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:18:18, skipping insertion in model container [2024-10-13 05:18:18,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:18:18" (3/3) ... [2024-10-13 05:18:18,334 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-56.i [2024-10-13 05:18:18,346 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:18:18,346 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:18:18,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:18:18,402 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;@4f70f1cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:18:18,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:18:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 05:18:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 05:18:18,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:18,416 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:18:18,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1733609520, now seen corresponding path program 1 times [2024-10-13 05:18:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466834279] [2024-10-13 05:18:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 05:18:18,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:18,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466834279] [2024-10-13 05:18:18,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466834279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:18,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:18:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689100913] [2024-10-13 05:18:18,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:18,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:18:18,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:18,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:18:18,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:18:18,691 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 05:18:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:18,732 INFO L93 Difference]: Finished difference Result 77 states and 126 transitions. [2024-10-13 05:18:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:18:18,734 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 68 [2024-10-13 05:18:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:18,766 INFO L225 Difference]: With dead ends: 77 [2024-10-13 05:18:18,767 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 05:18:18,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-13 05:18:18,773 INFO L432 NwaCegarLoop]: 51 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, 51 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-13 05:18:18,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:18:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 05:18:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 05:18:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 05:18:18,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-13 05:18:18,813 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 68 [2024-10-13 05:18:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:18,814 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-13 05:18:18,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 05:18:18,815 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-13 05:18:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 05:18:18,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:18,818 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:18:18,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:18:18,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:18,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:18,820 INFO L85 PathProgramCache]: Analyzing trace with hash -98182800, now seen corresponding path program 1 times [2024-10-13 05:18:18,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:18,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306365657] [2024-10-13 05:18:18,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:18,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 05:18:19,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:19,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306365657] [2024-10-13 05:18:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306365657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:18:19,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630587185] [2024-10-13 05:18:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:19,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:18:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:19,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:18:19,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:18:19,374 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:19,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:19,539 INFO L93 Difference]: Finished difference Result 111 states and 159 transitions. [2024-10-13 05:18:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:18:19,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-10-13 05:18:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:19,543 INFO L225 Difference]: With dead ends: 111 [2024-10-13 05:18:19,543 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 05:18:19,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:18:19,546 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 31 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:19,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 152 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:18:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 05:18:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2024-10-13 05:18:19,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-13 05:18:19,566 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 68 [2024-10-13 05:18:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-13 05:18:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-13 05:18:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 05:18:19,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:19,571 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:18:19,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:18:19,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:19,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash -491209810, now seen corresponding path program 1 times [2024-10-13 05:18:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423180419] [2024-10-13 05:18:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 05:18:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423180419] [2024-10-13 05:18:21,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423180419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:21,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:18:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000991046] [2024-10-13 05:18:21,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:18:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:21,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:18:21,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:18:21,595 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:22,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:22,402 INFO L93 Difference]: Finished difference Result 101 states and 141 transitions. [2024-10-13 05:18:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:18:22,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 68 [2024-10-13 05:18:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:22,404 INFO L225 Difference]: With dead ends: 101 [2024-10-13 05:18:22,406 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 05:18:22,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:18:22,407 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 36 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:22,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 205 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 05:18:22,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 05:18:22,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-10-13 05:18:22,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 61 states have internal predecessors, (80), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 120 transitions. [2024-10-13 05:18:22,416 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 120 transitions. Word has length 68 [2024-10-13 05:18:22,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:22,416 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 120 transitions. [2024-10-13 05:18:22,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 120 transitions. [2024-10-13 05:18:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 05:18:22,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:22,418 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:18:22,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:18:22,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:22,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:22,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1316926523, now seen corresponding path program 1 times [2024-10-13 05:18:22,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494286453] [2024-10-13 05:18:22,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 05:18:23,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:23,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494286453] [2024-10-13 05:18:23,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494286453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:23,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:23,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:18:23,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012201229] [2024-10-13 05:18:23,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:23,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:18:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:23,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:18:23,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:18:23,518 INFO L87 Difference]: Start difference. First operand 84 states and 120 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:24,299 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2024-10-13 05:18:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:18:24,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-10-13 05:18:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:24,301 INFO L225 Difference]: With dead ends: 114 [2024-10-13 05:18:24,301 INFO L226 Difference]: Without dead ends: 112 [2024-10-13 05:18:24,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:18:24,302 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 25 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:24,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 210 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:18:24,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-13 05:18:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 85. [2024-10-13 05:18:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-10-13 05:18:24,310 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 69 [2024-10-13 05:18:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:24,315 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-10-13 05:18:24,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:24,315 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-10-13 05:18:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 05:18:24,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:24,316 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 05:18:24,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:18:24,316 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:24,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:24,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2126273149, now seen corresponding path program 1 times [2024-10-13 05:18:24,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:24,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160259380] [2024-10-13 05:18:24,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-13 05:18:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:26,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160259380] [2024-10-13 05:18:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160259380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:26,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:26,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:18:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12435692] [2024-10-13 05:18:26,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:26,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:18:26,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:18:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:18:26,698 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:27,343 INFO L93 Difference]: Finished difference Result 112 states and 157 transitions. [2024-10-13 05:18:27,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:18:27,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-10-13 05:18:27,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:27,345 INFO L225 Difference]: With dead ends: 112 [2024-10-13 05:18:27,345 INFO L226 Difference]: Without dead ends: 110 [2024-10-13 05:18:27,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:18:27,346 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:27,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 180 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:18:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-13 05:18:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-10-13 05:18:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 115 transitions. [2024-10-13 05:18:27,353 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 115 transitions. Word has length 69 [2024-10-13 05:18:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:27,353 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 115 transitions. [2024-10-13 05:18:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 115 transitions. [2024-10-13 05:18:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-13 05:18:27,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:27,355 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:27,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:18:27,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:27,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 289329637, now seen corresponding path program 1 times [2024-10-13 05:18:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:27,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521386894] [2024-10-13 05:18:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:18:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:18:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:18:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:18:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:18:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:18:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:18:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:18:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:18:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:18:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-13 05:18:30,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:30,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521386894] [2024-10-13 05:18:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521386894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:30,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:30,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:18:30,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159020806] [2024-10-13 05:18:30,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:30,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:18:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:18:30,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:18:30,428 INFO L87 Difference]: Start difference. First operand 80 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:31,613 INFO L93 Difference]: Finished difference Result 111 states and 154 transitions. [2024-10-13 05:18:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:18:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 135 [2024-10-13 05:18:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:31,615 INFO L225 Difference]: With dead ends: 111 [2024-10-13 05:18:31,615 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 05:18:31,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:18:31,616 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 43 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:31,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 212 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 05:18:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 05:18:31,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2024-10-13 05:18:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:31,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2024-10-13 05:18:31,623 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 135 [2024-10-13 05:18:31,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:31,623 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2024-10-13 05:18:31,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:31,624 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2024-10-13 05:18:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:18:31,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:31,625 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:31,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:18:31,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:31,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1404959854, now seen corresponding path program 1 times [2024-10-13 05:18:31,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:31,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30674942] [2024-10-13 05:18:31,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:31,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:32,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:18:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:18:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:18:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:18:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:18:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:18:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:18:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:18:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:18:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:18:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-13 05:18:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:32,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30674942] [2024-10-13 05:18:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30674942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 05:18:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088487088] [2024-10-13 05:18:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:32,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 05:18:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:32,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 05:18:32,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:18:32,782 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:33,421 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2024-10-13 05:18:33,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 05:18:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-13 05:18:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:33,423 INFO L225 Difference]: With dead ends: 118 [2024-10-13 05:18:33,424 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 05:18:33,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 05:18:33,425 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 41 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:33,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 242 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 05:18:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 05:18:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2024-10-13 05:18:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 05:18:33,447 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 136 [2024-10-13 05:18:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 05:18:33,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 05:18:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:18:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:33,449 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:18:33,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 595613228, now seen corresponding path program 1 times [2024-10-13 05:18:33,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52216304] [2024-10-13 05:18:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:33,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:18:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:18:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:18:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:18:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:18:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:18:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:18:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:18:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:18:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:18:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:36,806 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-13 05:18:36,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52216304] [2024-10-13 05:18:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52216304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:36,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 05:18:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225539602] [2024-10-13 05:18:36,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:36,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:18:36,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:18:36,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 05:18:36,808 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:37,982 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-10-13 05:18:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 05:18:37,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-13 05:18:37,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:37,984 INFO L225 Difference]: With dead ends: 120 [2024-10-13 05:18:37,984 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 05:18:37,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 05:18:37,986 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:37,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 244 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 05:18:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 05:18:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2024-10-13 05:18:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2024-10-13 05:18:37,995 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 136 [2024-10-13 05:18:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:37,996 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2024-10-13 05:18:37,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2024-10-13 05:18:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:18:37,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:37,997 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:37,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:18:37,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:37,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash 379567674, now seen corresponding path program 1 times [2024-10-13 05:18:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:38,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829770515] [2024-10-13 05:18:38,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:38,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:18:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:18:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:18:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:18:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:18:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:18:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:18:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:18:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:18:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:18:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-13 05:18:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829770515] [2024-10-13 05:18:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829770515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:38,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:18:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924129741] [2024-10-13 05:18:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:38,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:18:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:38,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:18:38,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:18:38,091 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:38,113 INFO L93 Difference]: Finished difference Result 158 states and 230 transitions. [2024-10-13 05:18:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:18:38,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-13 05:18:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:38,115 INFO L225 Difference]: With dead ends: 158 [2024-10-13 05:18:38,115 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 05:18:38,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-13 05:18:38,116 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:38,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 89 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:18:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 05:18:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 79. [2024-10-13 05:18:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2024-10-13 05:18:38,128 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 114 transitions. Word has length 136 [2024-10-13 05:18:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:38,130 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 114 transitions. [2024-10-13 05:18:38,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 114 transitions. [2024-10-13 05:18:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 05:18:38,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:38,131 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:38,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:18:38,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:38,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1905536322, now seen corresponding path program 1 times [2024-10-13 05:18:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:38,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864004885] [2024-10-13 05:18:38,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:18:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:18:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:18:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:18:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:18:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:18:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:18:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:18:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:18:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:18:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,199 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2024-10-13 05:18:38,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:38,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864004885] [2024-10-13 05:18:38,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864004885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:18:38,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:18:38,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:18:38,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82967477] [2024-10-13 05:18:38,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:18:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:18:38,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:38,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:18:38,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:18:38,201 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:38,222 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2024-10-13 05:18:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:18:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 136 [2024-10-13 05:18:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:38,223 INFO L225 Difference]: With dead ends: 137 [2024-10-13 05:18:38,224 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 05:18:38,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-13 05:18:38,225 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:38,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 100 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:18:38,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 05:18:38,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 71. [2024-10-13 05:18:38,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.25) internal successors, (60), 48 states have internal predecessors, (60), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 05:18:38,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-10-13 05:18:38,230 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 136 [2024-10-13 05:18:38,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:38,230 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-10-13 05:18:38,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-13 05:18:38,231 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-10-13 05:18:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-13 05:18:38,237 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:38,237 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:38,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 05:18:38,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:38,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1758697221, now seen corresponding path program 1 times [2024-10-13 05:18:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909497033] [2024-10-13 05:18:38,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:38,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 05:18:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 05:18:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 05:18:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 05:18:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 05:18:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 05:18:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 05:18:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 05:18:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 05:18:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 05:18:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-13 05:18:38,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:38,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909497033] [2024-10-13 05:18:38,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909497033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:18:38,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462816591] [2024-10-13 05:18:38,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:38,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:18:38,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:18:38,395 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-13 05:18:38,400 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-13 05:18:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:38,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 05:18:38,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:18:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 417 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-13 05:18:38,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:18:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 761 trivial. 0 not checked. [2024-10-13 05:18:38,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462816591] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 05:18:38,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 05:18:38,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2024-10-13 05:18:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430161142] [2024-10-13 05:18:38,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 05:18:38,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 05:18:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:38,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 05:18:38,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 05:18:38,879 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 05:18:38,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:38,926 INFO L93 Difference]: Finished difference Result 161 states and 227 transitions. [2024-10-13 05:18:38,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:18:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 137 [2024-10-13 05:18:38,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:38,929 INFO L225 Difference]: With dead ends: 161 [2024-10-13 05:18:38,929 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 05:18:38,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:18:38,930 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:38,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 175 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:18:38,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 05:18:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2024-10-13 05:18:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 05:18:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-10-13 05:18:38,943 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 137 [2024-10-13 05:18:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:38,943 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-10-13 05:18:38,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 4 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 05:18:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-10-13 05:18:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 05:18:38,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:18:38,946 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:38,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 05:18:39,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-13 05:18:39,147 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:18:39,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:18:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1474725700, now seen corresponding path program 1 times [2024-10-13 05:18:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:18:39,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801218411] [2024-10-13 05:18:39,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:18:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:18:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:18:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:18:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:18:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:18:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 05:18:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 05:18:39,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 05:18:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 05:18:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 05:18:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 05:18:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 05:18:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 05:18:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 05:18:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 05:18:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 05:18:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 05:18:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 05:18:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-13 05:18:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 05:18:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 47 proven. 81 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2024-10-13 05:18:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:18:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801218411] [2024-10-13 05:18:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801218411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:18:39,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35694411] [2024-10-13 05:18:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:18:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 05:18:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:18:39,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 05:18:39,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 05:18:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:18:39,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 05:18:39,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:18:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 542 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 05:18:40,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:18:40,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35694411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:18:40,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 05:18:40,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 18 [2024-10-13 05:18:40,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545825539] [2024-10-13 05:18:40,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 05:18:40,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-13 05:18:40,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:18:40,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-13 05:18:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2024-10-13 05:18:40,503 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-10-13 05:18:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:18:40,760 INFO L93 Difference]: Finished difference Result 172 states and 220 transitions. [2024-10-13 05:18:40,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 05:18:40,761 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) Word has length 138 [2024-10-13 05:18:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:18:40,762 INFO L225 Difference]: With dead ends: 172 [2024-10-13 05:18:40,762 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 05:18:40,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2024-10-13 05:18:40,763 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:18:40,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 133 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 05:18:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 05:18:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 05:18:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 05:18:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 05:18:40,764 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2024-10-13 05:18:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:18:40,764 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 05:18:40,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5) internal successors, (63), 17 states have internal predecessors, (63), 6 states have call successors, (37), 5 states have call predecessors, (37), 7 states have return successors, (37), 7 states have call predecessors, (37), 6 states have call successors, (37) [2024-10-13 05:18:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 05:18:40,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 05:18:40,766 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:18:40,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 05:18:40,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 05:18:40,971 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:18:40,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 05:18:41,379 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:18:41,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:18:41 BoogieIcfgContainer [2024-10-13 05:18:41,391 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:18:41,391 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:18:41,391 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:18:41,391 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:18:41,392 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:18:18" (3/4) ... [2024-10-13 05:18:41,393 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 05:18:41,395 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 05:18:41,398 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-13 05:18:41,398 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-13 05:18:41,398 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 05:18:41,399 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 05:18:41,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 05:18:41,458 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 05:18:41,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:18:41,459 INFO L158 Benchmark]: Toolchain (without parser) took 23910.94ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 114.2MB in the beginning and 296.4MB in the end (delta: -182.1MB). Peak memory consumption was 99.3MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,459 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:18:41,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.30ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 100.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.31ms. Allocated memory is still 184.5MB. Free memory was 100.2MB in the beginning and 97.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,460 INFO L158 Benchmark]: Boogie Preprocessor took 84.57ms. Allocated memory is still 184.5MB. Free memory was 97.0MB in the beginning and 151.8MB in the end (delta: -54.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,460 INFO L158 Benchmark]: RCFGBuilder took 390.99ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 131.0MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,460 INFO L158 Benchmark]: TraceAbstraction took 23061.18ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 130.8MB in the beginning and 301.6MB in the end (delta: -170.8MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,460 INFO L158 Benchmark]: Witness Printer took 67.56ms. Allocated memory is still 465.6MB. Free memory was 301.6MB in the beginning and 296.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:18:41,461 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.30ms. Allocated memory is still 184.5MB. Free memory was 114.0MB in the beginning and 100.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.31ms. Allocated memory is still 184.5MB. Free memory was 100.2MB in the beginning and 97.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.57ms. Allocated memory is still 184.5MB. Free memory was 97.0MB in the beginning and 151.8MB in the end (delta: -54.8MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 390.99ms. Allocated memory is still 184.5MB. Free memory was 151.8MB in the beginning and 131.0MB in the end (delta: 20.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23061.18ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 130.8MB in the beginning and 301.6MB in the end (delta: -170.8MB). Peak memory consumption was 111.3MB. Max. memory is 16.1GB. * Witness Printer took 67.56ms. Allocated memory is still 465.6MB. Free memory was 301.6MB in the beginning and 296.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 12, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 377 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 375 mSDsluCounter, 1993 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1426 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1674 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 567 mSDtfsCounter, 1674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 995 GetRequests, 906 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 199 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 1571 NumberOfCodeBlocks, 1571 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1693 ConstructedInterpolants, 0 QuantifiedInterpolants, 7872 SizeOfPredicates, 6 NumberOfNonLiveVariables, 613 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 15 InterpolantComputations, 10 PerfectInterpolantSequences, 8205/8760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: ((((((1073741823 <= var_1_10) && (var_1_11 == 0)) && (127 <= var_1_5)) && (last_1_var_1_11 == 0)) && (var_1_5 <= 254)) && (var_1_10 <= 2147483647)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((var_1_11 == 0) && (last_1_var_1_11 == 0)) Ensures: (((cond != 0) && (var_1_11 == 0)) && (last_1_var_1_11 == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-13 05:18:41,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE