./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/prefixsum_iter.c -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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:45:49,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:45:49,691 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:45:49,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:45:49,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:45:49,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:45:49,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:45:49,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:45:49,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:45:49,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:45:49,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:45:49,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:45:49,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:45:49,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:45:49,734 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:45:49,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:45:49,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:45:49,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:45:49,735 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:45:49,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:45:49,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:45:49,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:45:49,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:45:49,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:45:49,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:45:49,740 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:45:49,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:45:49,740 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:45:49,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:45:49,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:45:49,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:45:49,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:45:49,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:45:49,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:45:49,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:45:49,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:45:49,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:45:49,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:45:49,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:45:49,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:45:49,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:45:49,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:45:49,745 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2024-11-08 14:45:49,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:45:50,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:45:50,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:45:50,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:45:50,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:45:50,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-11-08 14:45:51,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:45:51,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:45:51,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-11-08 14:45:51,613 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7295b81f3/36a5e3c5b54b4359a5e9786fb58bd186/FLAGc02f900db [2024-11-08 14:45:51,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7295b81f3/36a5e3c5b54b4359a5e9786fb58bd186 [2024-11-08 14:45:51,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:45:51,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:45:51,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:45:51,636 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:45:51,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:45:51,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bff4d60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51, skipping insertion in model container [2024-11-08 14:45:51,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:45:51,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2024-11-08 14:45:51,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:45:51,876 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:45:51,885 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2024-11-08 14:45:51,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:45:51,917 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:45:51,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51 WrapperNode [2024-11-08 14:45:51,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:45:51,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:45:51,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:45:51,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:45:51,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,933 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,953 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 130 [2024-11-08 14:45:51,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:45:51,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:45:51,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:45:51,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:45:51,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,984 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-11-08 14:45:51,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:51,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:52,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:52,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:52,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:52,012 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:45:52,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:45:52,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:45:52,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:45:52,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (1/1) ... [2024-11-08 14:45:52,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:45:52,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:52,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 14:45:52,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 14:45:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:45:52,086 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 14:45:52,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 14:45:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:45:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:45:52,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 14:45:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 14:45:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 14:45:52,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:45:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:45:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 14:45:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 14:45:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-11-08 14:45:52,089 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-11-08 14:45:52,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 14:45:52,173 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:45:52,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:45:52,367 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-11-08 14:45:52,367 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:45:52,382 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:45:52,384 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-08 14:45:52,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:45:52 BoogieIcfgContainer [2024-11-08 14:45:52,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:45:52,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:45:52,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:45:52,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:45:52,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:45:51" (1/3) ... [2024-11-08 14:45:52,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfdf872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:45:52, skipping insertion in model container [2024-11-08 14:45:52,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:45:51" (2/3) ... [2024-11-08 14:45:52,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cfdf872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:45:52, skipping insertion in model container [2024-11-08 14:45:52,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:45:52" (3/3) ... [2024-11-08 14:45:52,395 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2024-11-08 14:45:52,411 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:45:52,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:45:52,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:45:52,477 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;@63e0ea51, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:45:52,477 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:45:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:45:52,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:52,490 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:52,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:52,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash 785346732, now seen corresponding path program 1 times [2024-11-08 14:45:52,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:52,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743708281] [2024-11-08 14:45:52,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:52,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:52,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743708281] [2024-11-08 14:45:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743708281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:45:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:45:52,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440671122] [2024-11-08 14:45:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:52,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:45:52,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:45:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:45:52,773 INFO L87 Difference]: Start difference. First operand has 44 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 14:45:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:52,837 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2024-11-08 14:45:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:45:52,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-08 14:45:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:52,849 INFO L225 Difference]: With dead ends: 85 [2024-11-08 14:45:52,849 INFO L226 Difference]: Without dead ends: 40 [2024-11-08 14:45:52,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-11-08 14:45:52,856 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:52,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 84 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:45:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-08 14:45:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-08 14:45:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-08 14:45:52,891 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 37 [2024-11-08 14:45:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:52,891 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-08 14:45:52,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 14:45:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-08 14:45:52,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 14:45:52,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:52,894 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:52,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:45:52,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:52,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:52,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1290597595, now seen corresponding path program 1 times [2024-11-08 14:45:52,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:52,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802505562] [2024-11-08 14:45:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:52,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:53,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:53,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:53,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:53,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:53,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:53,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802505562] [2024-11-08 14:45:53,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802505562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:53,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:45:53,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:45:53,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855886635] [2024-11-08 14:45:53,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:53,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:45:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:45:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:45:53,320 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:53,445 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-11-08 14:45:53,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:45:53,446 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-08 14:45:53,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:53,447 INFO L225 Difference]: With dead ends: 63 [2024-11-08 14:45:53,448 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 14:45:53,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:45:53,450 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:53,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 178 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:45:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 14:45:53,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-11-08 14:45:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-08 14:45:53,459 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 37 [2024-11-08 14:45:53,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:53,460 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-08 14:45:53,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-08 14:45:53,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 14:45:53,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:53,462 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:53,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:45:53,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:53,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:53,463 INFO L85 PathProgramCache]: Analyzing trace with hash -889976185, now seen corresponding path program 1 times [2024-11-08 14:45:53,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:53,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196437651] [2024-11-08 14:45:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:53,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:54,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:54,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 14:45:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:54,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196437651] [2024-11-08 14:45:54,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196437651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:54,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417258812] [2024-11-08 14:45:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:54,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:54,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:54,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:45:54,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:45:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:54,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 14:45:54,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:54,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:45:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:54,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:45:54,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-08 14:45:54,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-08 14:45:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417258812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:45:54,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:45:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2024-11-08 14:45:54,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204712289] [2024-11-08 14:45:54,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:45:54,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-08 14:45:54,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:54,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-08 14:45:54,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-08 14:45:54,681 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 14:45:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:55,025 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-11-08 14:45:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 14:45:55,026 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 39 [2024-11-08 14:45:55,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:55,028 INFO L225 Difference]: With dead ends: 61 [2024-11-08 14:45:55,028 INFO L226 Difference]: Without dead ends: 59 [2024-11-08 14:45:55,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2024-11-08 14:45:55,030 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 60 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:55,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 316 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 14:45:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-08 14:45:55,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2024-11-08 14:45:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2024-11-08 14:45:55,041 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 39 [2024-11-08 14:45:55,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:55,042 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2024-11-08 14:45:55,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 18 states have internal predecessors, (49), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-08 14:45:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2024-11-08 14:45:55,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 14:45:55,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:55,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:55,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 14:45:55,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:55,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:55,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash -862148290, now seen corresponding path program 1 times [2024-11-08 14:45:55,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:55,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558044488] [2024-11-08 14:45:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:55,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:55,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:55,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:55,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558044488] [2024-11-08 14:45:55,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558044488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:55,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456812575] [2024-11-08 14:45:55,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:55,488 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:45:55,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 14:45:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:55,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 14:45:55,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:55,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:45:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 14:45:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456812575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:45:55,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:45:55,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2024-11-08 14:45:55,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763839377] [2024-11-08 14:45:55,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:45:55,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 14:45:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:55,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 14:45:55,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:45:55,726 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:55,844 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2024-11-08 14:45:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:45:55,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2024-11-08 14:45:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:55,846 INFO L225 Difference]: With dead ends: 71 [2024-11-08 14:45:55,846 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 14:45:55,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:45:55,847 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:55,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 224 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:45:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 14:45:55,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2024-11-08 14:45:55,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-11-08 14:45:55,855 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 43 [2024-11-08 14:45:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:55,855 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-11-08 14:45:55,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-11-08 14:45:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 14:45:55,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:55,856 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:55,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:45:56,057 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,SelfDestructingSolverStorable3 [2024-11-08 14:45:56,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:56,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:56,058 INFO L85 PathProgramCache]: Analyzing trace with hash 296032032, now seen corresponding path program 2 times [2024-11-08 14:45:56,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:56,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423617526] [2024-11-08 14:45:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:56,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 14:45:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423617526] [2024-11-08 14:45:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423617526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991391016] [2024-11-08 14:45:56,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:45:56,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:56,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:56,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:45:56,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 14:45:56,347 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:45:56,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:45:56,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 14:45:56,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 14:45:56,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:45:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991391016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:56,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:45:56,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-08 14:45:56,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821195828] [2024-11-08 14:45:56,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:56,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:45:56,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:56,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:45:56,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:45:56,435 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:56,490 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-11-08 14:45:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:45:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-11-08 14:45:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:56,492 INFO L225 Difference]: With dead ends: 67 [2024-11-08 14:45:56,493 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 14:45:56,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:45:56,495 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:56,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:45:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 14:45:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-11-08 14:45:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2024-11-08 14:45:56,506 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 45 [2024-11-08 14:45:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:56,506 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2024-11-08 14:45:56,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2024-11-08 14:45:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 14:45:56,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:56,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:56,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:45:56,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:56,713 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:56,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:56,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2106562871, now seen corresponding path program 1 times [2024-11-08 14:45:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929947143] [2024-11-08 14:45:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:56,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 14:45:56,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929947143] [2024-11-08 14:45:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929947143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:56,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:45:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 14:45:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138206630] [2024-11-08 14:45:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:56,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:45:56,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:56,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:45:56,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:45:56,792 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:56,824 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2024-11-08 14:45:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:45:56,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-11-08 14:45:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:56,826 INFO L225 Difference]: With dead ends: 66 [2024-11-08 14:45:56,827 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 14:45:56,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:45:56,829 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:56,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 110 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:45:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 14:45:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-08 14:45:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-11-08 14:45:56,837 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 49 [2024-11-08 14:45:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-11-08 14:45:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-11-08 14:45:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 14:45:56,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:56,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:56,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:45:56,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:56,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 587981541, now seen corresponding path program 1 times [2024-11-08 14:45:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:56,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225651635] [2024-11-08 14:45:56,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:56,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 14:45:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225651635] [2024-11-08 14:45:57,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225651635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:57,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974704678] [2024-11-08 14:45:57,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:57,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:57,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:57,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:45:57,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:45:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 14:45:57,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 14:45:57,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 14:45:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974704678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:45:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 14:45:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2024-11-08 14:45:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597958705] [2024-11-08 14:45:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:45:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:45:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:57,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:45:57,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:45:57,234 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:57,270 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-08 14:45:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:45:57,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 50 [2024-11-08 14:45:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:57,272 INFO L225 Difference]: With dead ends: 61 [2024-11-08 14:45:57,272 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 14:45:57,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-08 14:45:57,273 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 8 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:57,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 156 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:45:57,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 14:45:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-11-08 14:45:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2024-11-08 14:45:57,280 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 50 [2024-11-08 14:45:57,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:57,280 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2024-11-08 14:45:57,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2024-11-08 14:45:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 14:45:57,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:57,281 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:57,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 14:45:57,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:57,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:57,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:57,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1391233892, now seen corresponding path program 1 times [2024-11-08 14:45:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:57,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753672454] [2024-11-08 14:45:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:57,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 14:45:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:57,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753672454] [2024-11-08 14:45:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753672454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:57,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385084257] [2024-11-08 14:45:57,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:57,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:57,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:57,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:45:57,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:45:57,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:57,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 14:45:57,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 14:45:57,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:45:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 14:45:58,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385084257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:45:58,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:45:58,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 14 [2024-11-08 14:45:58,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556981603] [2024-11-08 14:45:58,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:45:58,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:45:58,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:45:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:45:58,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:45:58,044 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:45:58,221 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-08 14:45:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 14:45:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2024-11-08 14:45:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:45:58,223 INFO L225 Difference]: With dead ends: 61 [2024-11-08 14:45:58,223 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 14:45:58,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 106 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:45:58,224 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:45:58,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 254 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:45:58,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 14:45:58,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-08 14:45:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:45:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-11-08 14:45:58,236 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 54 [2024-11-08 14:45:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:45:58,237 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-08 14:45:58,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 14:45:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-08 14:45:58,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 14:45:58,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:45:58,239 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:45:58,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 14:45:58,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:58,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:45:58,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:45:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash -723821245, now seen corresponding path program 1 times [2024-11-08 14:45:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:45:58,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187773797] [2024-11-08 14:45:58,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:45:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 14:45:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 14:45:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 14:45:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 14:45:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 14:45:58,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:45:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187773797] [2024-11-08 14:45:58,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187773797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:45:58,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822959314] [2024-11-08 14:45:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:45:58,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:45:58,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:45:58,688 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:45:58,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 14:45:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:45:58,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-08 14:45:58,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:45:58,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 14:45:58,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-11-08 14:45:59,076 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 14:45:59,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 14:45:59,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-11-08 14:45:59,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-08 14:45:59,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2024-11-08 14:45:59,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-08 14:45:59,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2024-11-08 14:45:59,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-11-08 14:45:59,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2024-11-08 14:46:00,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2024-11-08 14:46:00,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2024-11-08 14:46:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:46:00,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:46:49,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~left~0#1_20| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_12| Int)) (or (< |v_ULTIMATE.start_upsweep_~a#1.offset_12| |ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse8))) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4 .cse8) v_ArrVal_207)))) (let ((.cse2 (store (let ((.cse7 (* |v_ULTIMATE.start_upsweep_~left~0#1_20| 4))) (let ((.cse6 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_12| .cse7 4)) (.cse5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse5 .cse6 (+ (select .cse5 .cse6) (select .cse5 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_12| .cse7)))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4 .cse8) 0)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (select .cse2 .cse3))) (let ((.cse0 (+ (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|) .cse4))) (= .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse0) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|))))))) (< |v_ULTIMATE.start_upsweep_~left~0#1_20| 0))) is different from false [2024-11-08 14:47:23,524 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1.offset| Int) (|v_ULTIMATE.start_upsweep_~left~0#1_20| Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int) (v_ArrVal_207 Int) (|v_ULTIMATE.start_upsweep_~a#1.offset_12| Int) (v_ArrVal_213 (Array Int Int))) (or (< |v_ULTIMATE.start_upsweep_~a#1.offset_12| |ULTIMATE.start_main_~a~0#1.offset|) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store v_ArrVal_213 |ULTIMATE.start_main_~a0~0#1.offset| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) v_ArrVal_207)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|))) (= .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse4 (* |v_ULTIMATE.start_upsweep_~left~0#1_20| 4))) (let ((.cse3 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_12| .cse4 4))) (store .cse2 .cse3 (+ (select .cse2 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_12| .cse4)) (select .cse2 .cse3))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4) .cse0) |ULTIMATE.start_main_~a~0#1.offset| 0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|))))) (< |v_ULTIMATE.start_upsweep_~left~0#1_20| 0))) is different from false [2024-11-08 14:47:23,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822959314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:47:23,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:47:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 31] total 38 [2024-11-08 14:47:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135233663] [2024-11-08 14:47:23,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:47:23,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-08 14:47:23,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:47:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-08 14:47:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=2806, Unknown=14, NotChecked=218, Total=3306 [2024-11-08 14:47:23,532 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 38 states, 36 states have (on average 2.2777777777777777) internal successors, (82), 35 states have internal predecessors, (82), 5 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7)