./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:06:01,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:06:01,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:06:01,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:06:01,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:06:01,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:06:01,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:06:01,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:06:01,163 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:06:01,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:06:01,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:06:01,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:06:01,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:06:01,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:06:01,168 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:06:01,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:06:01,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:06:01,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:06:01,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:06:01,173 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:06:01,173 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:06:01,174 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:06:01,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:06:01,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:06:01,174 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:06:01,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:06:01,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:06:01,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:06:01,176 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:06:01,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:06:01,176 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:06:01,176 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:06:01,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:06:01,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:06:01,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:06:01,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:06:01,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:06:01,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:06:01,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:06:01,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:06:01,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:06:01,190 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:06:01,190 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-16 08:06:01,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:06:01,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:06:01,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:06:01,469 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:06:01,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:06:01,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-16 08:06:02,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:06:03,102 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:06:03,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-16 08:06:03,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af456312/cfe44ffec58b460ba5d7d6ed6cdccb8b/FLAG7524279af [2024-11-16 08:06:03,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6af456312/cfe44ffec58b460ba5d7d6ed6cdccb8b [2024-11-16 08:06:03,505 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:06:03,506 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:06:03,507 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:06:03,507 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:06:03,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:06:03,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5296c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03, skipping insertion in model container [2024-11-16 08:06:03,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:06:03,698 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/elimination_max_rec_onepoint.c[502,515] [2024-11-16 08:06:03,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:06:03,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:06:03,739 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/elimination_max_rec_onepoint.c[502,515] [2024-11-16 08:06:03,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:06:03,763 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:06:03,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03 WrapperNode [2024-11-16 08:06:03,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:06:03,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:06:03,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:06:03,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:06:03,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,791 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2024-11-16 08:06:03,791 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:06:03,792 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:06:03,792 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:06:03,792 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:06:03,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,823 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-16 08:06:03,824 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,838 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:06:03,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:06:03,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:06:03,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:06:03,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (1/1) ... [2024-11-16 08:06:03,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:06:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:03,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 08:06:03,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 08:06:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:06:03,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 08:06:03,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 08:06:03,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:06:03,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 08:06:03,934 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-16 08:06:03,934 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-16 08:06:03,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 08:06:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:06:03,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:06:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 08:06:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 08:06:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 08:06:03,936 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 08:06:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 08:06:04,026 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:06:04,031 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:06:04,183 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 08:06:04,183 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:06:04,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:06:04,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:06:04,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:04 BoogieIcfgContainer [2024-11-16 08:06:04,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:06:04,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:06:04,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:06:04,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:06:04,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:06:03" (1/3) ... [2024-11-16 08:06:04,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e98f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:04, skipping insertion in model container [2024-11-16 08:06:04,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:03" (2/3) ... [2024-11-16 08:06:04,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e98f69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:04, skipping insertion in model container [2024-11-16 08:06:04,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:04" (3/3) ... [2024-11-16 08:06:04,206 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-16 08:06:04,219 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:06:04,219 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:06:04,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:06:04,274 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;@61630a68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:06:04,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:06:04,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 08:06:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 08:06:04,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:04,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:04,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:04,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:04,289 INFO L85 PathProgramCache]: Analyzing trace with hash -97797256, now seen corresponding path program 1 times [2024-11-16 08:06:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:04,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011613799] [2024-11-16 08:06:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:04,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:04,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:06:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:04,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 08:06:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 08:06:04,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:04,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011613799] [2024-11-16 08:06:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011613799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:04,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:04,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 08:06:04,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698392860] [2024-11-16 08:06:04,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 08:06:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:04,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 08:06:04,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:06:04,525 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 08:06:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:04,550 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2024-11-16 08:06:04,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 08:06:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-16 08:06:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:04,560 INFO L225 Difference]: With dead ends: 70 [2024-11-16 08:06:04,560 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 08:06:04,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:06:04,569 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:04,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 08:06:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 08:06:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 08:06:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-16 08:06:04,614 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 22 [2024-11-16 08:06:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-16 08:06:04,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 08:06:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-16 08:06:04,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 08:06:04,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:04,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:06:04,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:04,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash -965786890, now seen corresponding path program 1 times [2024-11-16 08:06:04,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:04,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593420798] [2024-11-16 08:06:04,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:06:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 08:06:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 08:06:05,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:05,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593420798] [2024-11-16 08:06:05,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593420798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:05,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:05,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:06:05,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593969306] [2024-11-16 08:06:05,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:05,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:06:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:05,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:06:05,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:06:05,099 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 08:06:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:05,261 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-16 08:06:05,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:06:05,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-16 08:06:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:05,266 INFO L225 Difference]: With dead ends: 56 [2024-11-16 08:06:05,266 INFO L226 Difference]: Without dead ends: 54 [2024-11-16 08:06:05,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:06:05,270 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:05,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 156 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-16 08:06:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-16 08:06:05,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 32 states have internal predecessors, (35), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 08:06:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-16 08:06:05,289 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 22 [2024-11-16 08:06:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:05,289 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-16 08:06:05,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 08:06:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-16 08:06:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 08:06:05,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:05,291 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:05,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:06:05,291 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:05,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 551245840, now seen corresponding path program 1 times [2024-11-16 08:06:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:05,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688493861] [2024-11-16 08:06:05,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:05,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:06:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 08:06:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-16 08:06:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 08:06:05,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688493861] [2024-11-16 08:06:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688493861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:05,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:05,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 08:06:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758940303] [2024-11-16 08:06:05,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:05,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 08:06:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 08:06:05,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 08:06:05,573 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 08:06:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:05,654 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-16 08:06:05,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 08:06:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2024-11-16 08:06:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:05,657 INFO L225 Difference]: With dead ends: 55 [2024-11-16 08:06:05,657 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 08:06:05,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:06:05,659 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:05,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:05,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 08:06:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 08:06:05,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 31 states have internal predecessors, (34), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 08:06:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-16 08:06:05,676 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 25 [2024-11-16 08:06:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:05,677 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-16 08:06:05,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 08:06:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-16 08:06:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 08:06:05,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:05,678 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:05,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:06:05,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:05,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1966641961, now seen corresponding path program 1 times [2024-11-16 08:06:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:05,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510904815] [2024-11-16 08:06:05,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:05,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:06:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 08:06:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 08:06:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 08:06:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:05,935 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 08:06:05,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:05,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510904815] [2024-11-16 08:06:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510904815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135352037] [2024-11-16 08:06:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:05,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:05,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:05,938 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-16 08:06:05,940 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-16 08:06:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 08:06:06,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 08:06:06,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135352037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:06,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 08:06:06,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 12 [2024-11-16 08:06:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590361273] [2024-11-16 08:06:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:06,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 08:06:06,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 08:06:06,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-16 08:06:06,226 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 08:06:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:06,408 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-11-16 08:06:06,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:06:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-11-16 08:06:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:06,410 INFO L225 Difference]: With dead ends: 62 [2024-11-16 08:06:06,410 INFO L226 Difference]: Without dead ends: 60 [2024-11-16 08:06:06,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-11-16 08:06:06,411 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:06,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 152 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:06:06,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-16 08:06:06,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 34. [2024-11-16 08:06:06,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 08:06:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-16 08:06:06,425 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 37 [2024-11-16 08:06:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:06,426 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-16 08:06:06,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 08:06:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-16 08:06:06,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 08:06:06,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:06,427 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-16 08:06:06,444 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-16 08:06:06,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:06,628 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:06,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:06,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1148393213, now seen corresponding path program 1 times [2024-11-16 08:06:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:06:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897817084] [2024-11-16 08:06:06,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:06,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:06:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 08:06:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-16 08:06:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 08:06:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 08:06:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 08:06:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 08:06:06,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:06:06,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897817084] [2024-11-16 08:06:06,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897817084] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:06,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925774635] [2024-11-16 08:06:06,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:06,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:06,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:06,833 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-16 08:06:06,835 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-16 08:06:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:06,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 08:06:06,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:06,986 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-16 08:06:07,243 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 29 treesize of output 23 [2024-11-16 08:06:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 08:06:07,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:06:15,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925774635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:15,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 08:06:15,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 20 [2024-11-16 08:06:15,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846352876] [2024-11-16 08:06:15,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 08:06:15,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-16 08:06:15,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:06:15,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-16 08:06:15,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-11-16 08:06:15,452 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-16 08:06:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:15,736 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-16 08:06:15,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 08:06:15,737 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40 [2024-11-16 08:06:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:15,738 INFO L225 Difference]: With dead ends: 40 [2024-11-16 08:06:15,738 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 08:06:15,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2024-11-16 08:06:15,739 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:15,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 241 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 08:06:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 08:06:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:06:15,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 08:06:15,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2024-11-16 08:06:15,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:15,742 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 08:06:15,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 7 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-16 08:06:15,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 08:06:15,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 08:06:15,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 08:06:15,760 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-16 08:06:15,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 08:06:15,954 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 08:06:15,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 08:06:16,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 08:06:16,542 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:433) at de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.IcfgBacktranslator.translateExpression(IcfgBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:166) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateProcedureContract(DefaultTranslator.java:377) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:349) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProcedureContract(ModelTranslationContainer.java:338) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateProcedureContract(BacktranslationService.java:94) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-16 08:06:16,546 INFO L158 Benchmark]: Toolchain (without parser) took 13040.23ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 127.3MB in the beginning and 211.4MB in the end (delta: -84.0MB). Peak memory consumption was 126.7MB. Max. memory is 16.1GB. [2024-11-16 08:06:16,546 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 150.0MB in the beginning and 149.7MB in the end (delta: 285.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 08:06:16,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.35ms. Allocated memory is still 184.5MB. Free memory was 126.9MB in the beginning and 114.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 08:06:16,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.11ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:06:16,547 INFO L158 Benchmark]: Boogie Preprocessor took 46.07ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 08:06:16,547 INFO L158 Benchmark]: IcfgBuilder took 360.03ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 96.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 08:06:16,547 INFO L158 Benchmark]: TraceAbstraction took 12344.95ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 95.5MB in the beginning and 211.4MB in the end (delta: -115.9MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. [2024-11-16 08:06:16,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory was 150.0MB in the beginning and 149.7MB in the end (delta: 285.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.35ms. Allocated memory is still 184.5MB. Free memory was 126.9MB in the beginning and 114.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.11ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.07ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 360.03ms. Allocated memory is still 184.5MB. Free memory was 110.6MB in the beginning and 96.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12344.95ms. Allocated memory was 184.5MB in the beginning and 255.9MB in the end (delta: 71.3MB). Free memory was 95.5MB in the beginning and 211.4MB in the end (delta: -115.9MB). Peak memory consumption was 95.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 790 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 619 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 482 IncrementalHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 171 mSDtfsCounter, 482 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 31 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 223 NumberOfCodeBlocks, 223 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 216 ConstructedInterpolants, 13 QuantifiedInterpolants, 680 SizeOfPredicates, 15 NumberOfNonLiveVariables, 343 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 63/78 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (cond != 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-16 08:06:16,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/elimination_max_rec_onepoint.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:06:18,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:06:18,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 08:06:18,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:06:18,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:06:18,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:06:18,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:06:18,851 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:06:18,852 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:06:18,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:06:18,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:06:18,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:06:18,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:06:18,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:06:18,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:06:18,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:06:18,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:06:18,859 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:06:18,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:06:18,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:06:18,859 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:06:18,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:06:18,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:06:18,861 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 08:06:18,861 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 08:06:18,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:06:18,862 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 08:06:18,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:06:18,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:06:18,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:06:18,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:06:18,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:06:18,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:06:18,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:06:18,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:06:18,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:06:18,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:06:18,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:06:18,866 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 08:06:18,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 08:06:18,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:06:18,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:06:18,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:06:18,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:06:18,868 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 -> 3a80fea07b3dad363ac033c87feb8bfcf28a57d2e75bc95b67f90908b133efe1 [2024-11-16 08:06:19,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:06:19,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:06:19,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:06:19,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:06:19,214 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:06:19,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-16 08:06:20,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:06:20,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:06:20,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/elimination_max_rec_onepoint.c [2024-11-16 08:06:21,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39ee80bd/972b7172a55d4a179003137f4fc671f0/FLAGac47b7661 [2024-11-16 08:06:21,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f39ee80bd/972b7172a55d4a179003137f4fc671f0 [2024-11-16 08:06:21,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:06:21,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:06:21,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:06:21,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:06:21,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:06:21,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279fb84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21, skipping insertion in model container [2024-11-16 08:06:21,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:06:21,245 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/elimination_max_rec_onepoint.c[502,515] [2024-11-16 08:06:21,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:06:21,296 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:06:21,307 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/elimination_max_rec_onepoint.c[502,515] [2024-11-16 08:06:21,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:06:21,341 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:06:21,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21 WrapperNode [2024-11-16 08:06:21,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:06:21,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:06:21,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:06:21,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:06:21,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,381 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-11-16 08:06:21,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:06:21,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:06:21,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:06:21,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:06:21,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,420 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-16 08:06:21,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:06:21,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:06:21,447 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:06:21,447 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:06:21,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (1/1) ... [2024-11-16 08:06:21,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:06:21,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:06:21,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 08:06:21,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 08:06:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:06:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 08:06:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 08:06:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 08:06:21,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 08:06:21,513 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-11-16 08:06:21,515 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-11-16 08:06:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 08:06:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 08:06:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 08:06:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:06:21,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:06:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 08:06:21,515 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 08:06:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 08:06:21,599 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:06:21,601 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:06:21,827 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 08:06:21,827 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:06:21,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:06:21,840 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:06:21,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:21 BoogieIcfgContainer [2024-11-16 08:06:21,840 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:06:21,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:06:21,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:06:21,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:06:21,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:06:21" (1/3) ... [2024-11-16 08:06:21,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc20e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:21, skipping insertion in model container [2024-11-16 08:06:21,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:06:21" (2/3) ... [2024-11-16 08:06:21,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc20e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:06:21, skipping insertion in model container [2024-11-16 08:06:21,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:06:21" (3/3) ... [2024-11-16 08:06:21,852 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2024-11-16 08:06:21,868 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:06:21,868 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:06:21,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:06:21,938 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;@780e5d02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:06:21,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:06:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-16 08:06:21,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 08:06:21,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:21,951 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:21,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:21,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:21,957 INFO L85 PathProgramCache]: Analyzing trace with hash -97797256, now seen corresponding path program 1 times [2024-11-16 08:06:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 08:06:21,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131189640] [2024-11-16 08:06:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:21,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:21,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 08:06:21,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 08:06:21,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 08:06:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 08:06:22,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 08:06:22,108 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:22,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 08:06:22,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131189640] [2024-11-16 08:06:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131189640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 08:06:22,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72836162] [2024-11-16 08:06:22,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:22,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 08:06:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 08:06:22,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 08:06:22,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:06:22,140 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 08:06:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:22,164 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2024-11-16 08:06:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 08:06:22,168 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-16 08:06:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:22,175 INFO L225 Difference]: With dead ends: 70 [2024-11-16 08:06:22,175 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 08:06:22,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 08:06:22,182 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:22,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:06:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 08:06:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-16 08:06:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-16 08:06:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-16 08:06:22,226 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 22 [2024-11-16 08:06:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:22,227 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-16 08:06:22,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 08:06:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-16 08:06:22,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 08:06:22,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:22,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:22,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 08:06:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:22,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:22,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash -965786890, now seen corresponding path program 1 times [2024-11-16 08:06:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 08:06:22,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420650027] [2024-11-16 08:06:22,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:22,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 08:06:22,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 08:06:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 08:06:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:22,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 08:06:22,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 08:06:22,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:22,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 08:06:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420650027] [2024-11-16 08:06:22,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420650027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:22,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:22,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 08:06:22,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463054213] [2024-11-16 08:06:22,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:22,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 08:06:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 08:06:22,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 08:06:22,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:06:22,976 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 08:06:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:23,371 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-16 08:06:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 08:06:23,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-11-16 08:06:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:23,374 INFO L225 Difference]: With dead ends: 50 [2024-11-16 08:06:23,374 INFO L226 Difference]: Without dead ends: 48 [2024-11-16 08:06:23,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-16 08:06:23,375 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:23,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 186 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-16 08:06:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-16 08:06:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 08:06:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-16 08:06:23,388 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 22 [2024-11-16 08:06:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:23,388 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-16 08:06:23,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 08:06:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-16 08:06:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 08:06:23,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:23,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:23,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 08:06:23,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:23,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:23,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:23,593 INFO L85 PathProgramCache]: Analyzing trace with hash 551245840, now seen corresponding path program 1 times [2024-11-16 08:06:23,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 08:06:23,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042270632] [2024-11-16 08:06:23,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:23,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:23,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 08:06:23,597 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 08:06:23,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 08:06:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:23,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 08:06:23,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:23,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 08:06:23,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 08:06:23,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-11-16 08:06:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 08:06:24,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 08:06:24,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 08:06:24,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042270632] [2024-11-16 08:06:24,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042270632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:06:24,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:06:24,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 08:06:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263776394] [2024-11-16 08:06:24,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:06:24,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 08:06:24,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 08:06:24,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 08:06:24,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-16 08:06:24,080 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 08:06:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:24,413 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-11-16 08:06:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 08:06:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-11-16 08:06:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:24,416 INFO L225 Difference]: With dead ends: 60 [2024-11-16 08:06:24,416 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 08:06:24,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-16 08:06:24,418 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:24,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 219 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:06:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 08:06:24,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2024-11-16 08:06:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 08:06:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2024-11-16 08:06:24,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 25 [2024-11-16 08:06:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:24,431 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-11-16 08:06:24,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 08:06:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2024-11-16 08:06:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 08:06:24,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:24,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 08:06:24,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 08:06:24,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:24,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1966641961, now seen corresponding path program 1 times [2024-11-16 08:06:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 08:06:24,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55210679] [2024-11-16 08:06:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:24,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:24,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 08:06:24,641 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 08:06:24,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 08:06:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:24,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 08:06:24,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 08:06:25,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:06:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-16 08:06:25,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 08:06:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55210679] [2024-11-16 08:06:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55210679] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:06:25,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 08:06:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2024-11-16 08:06:25,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291173733] [2024-11-16 08:06:25,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 08:06:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 08:06:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 08:06:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 08:06:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-16 08:06:25,619 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 08:06:26,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:26,978 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2024-11-16 08:06:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-16 08:06:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 37 [2024-11-16 08:06:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:26,980 INFO L225 Difference]: With dead ends: 102 [2024-11-16 08:06:26,980 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 08:06:26,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2024-11-16 08:06:26,982 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 66 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:26,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 403 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 08:06:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 08:06:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2024-11-16 08:06:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 51 states have internal predecessors, (55), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 08:06:27,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2024-11-16 08:06:27,011 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 37 [2024-11-16 08:06:27,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:27,012 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2024-11-16 08:06:27,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 8 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-16 08:06:27,012 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2024-11-16 08:06:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 08:06:27,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:27,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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-16 08:06:27,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 08:06:27,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:27,216 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:27,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:27,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1148393213, now seen corresponding path program 1 times [2024-11-16 08:06:27,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 08:06:27,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122103097] [2024-11-16 08:06:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:27,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 08:06:27,219 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 08:06:27,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 08:06:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:27,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-16 08:06:27,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:28,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 08:06:28,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 08:06:28,360 INFO L349 Elim1Store]: treesize reduction 58, result has 44.2 percent of original size [2024-11-16 08:06:28,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 43 treesize of output 58 [2024-11-16 08:06:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 08:06:28,583 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:06:41,541 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2024-11-16 08:06:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 67 [2024-11-16 08:06:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 08:06:42,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 08:06:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122103097] [2024-11-16 08:06:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122103097] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 08:06:42,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 08:06:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16] total 32 [2024-11-16 08:06:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504034174] [2024-11-16 08:06:42,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 08:06:42,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 08:06:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 08:06:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 08:06:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=891, Unknown=3, NotChecked=0, Total=992 [2024-11-16 08:06:42,491 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 24 states have internal predecessors, (40), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-16 08:06:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:06:46,355 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2024-11-16 08:06:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 08:06:46,360 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 24 states have internal predecessors, (40), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) Word has length 40 [2024-11-16 08:06:46,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:06:46,361 INFO L225 Difference]: With dead ends: 105 [2024-11-16 08:06:46,362 INFO L226 Difference]: Without dead ends: 103 [2024-11-16 08:06:46,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=256, Invalid=2191, Unknown=3, NotChecked=0, Total=2450 [2024-11-16 08:06:46,365 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 50 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 08:06:46,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 406 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 08:06:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-16 08:06:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2024-11-16 08:06:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 62 states have internal predecessors, (64), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (28), 20 states have call predecessors, (28), 23 states have call successors, (28) [2024-11-16 08:06:46,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2024-11-16 08:06:46,402 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 40 [2024-11-16 08:06:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:06:46,403 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2024-11-16 08:06:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 24 states have internal predecessors, (40), 9 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-16 08:06:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2024-11-16 08:06:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 08:06:46,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:06:46,405 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-16 08:06:46,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 08:06:46,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:46,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:06:46,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:06:46,606 INFO L85 PathProgramCache]: Analyzing trace with hash 786843731, now seen corresponding path program 1 times [2024-11-16 08:06:46,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 08:06:46,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097948573] [2024-11-16 08:06:46,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:46,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 08:06:46,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 08:06:46,610 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 08:06:46,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-16 08:06:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:46,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 08:06:46,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:46,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 08:06:46,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-11-16 08:06:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-16 08:06:47,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:06:47,740 INFO L349 Elim1Store]: treesize reduction 5, result has 94.6 percent of original size [2024-11-16 08:06:47,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 95 [2024-11-16 08:06:48,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 08:06:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097948573] [2024-11-16 08:06:48,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097948573] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:06:48,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1054832571] [2024-11-16 08:06:48,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:06:48,519 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 08:06:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 08:06:48,520 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 08:06:48,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-16 08:06:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:06:48,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 08:06:48,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 08:06:48,647 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-16 08:06:52,792 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (= (select |c_#memory_int#1| |v_ULTIMATE.start_main_~a~0#1.base_BEFORE_CALL_2|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-11-16 08:06:52,968 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 29 treesize of output 23 [2024-11-16 08:06:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 4 not checked. [2024-11-16 08:06:53,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 08:07:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1054832571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 08:07:25,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 08:07:25,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2024-11-16 08:07:25,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082163060] [2024-11-16 08:07:25,242 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 08:07:25,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 08:07:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 08:07:25,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 08:07:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=360, Unknown=9, NotChecked=38, Total=462 [2024-11-16 08:07:25,244 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand has 16 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 7 states have call successors, (14), 3 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12)