./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.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 caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:55:45,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:55:45,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 20:55:45,821 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:55:45,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:55:45,845 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:55:45,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:55:45,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:55:45,847 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:55:45,848 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:55:45,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:55:45,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:55:45,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:55:45,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:55:45,851 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:55:45,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:55:45,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:55:45,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:55:45,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 20:55:45,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:55:45,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:55:45,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:55:45,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:55:45,855 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:55:45,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:55:45,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:55:45,856 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:55:45,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:55:45,856 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:55:45,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:55:45,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:55:45,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:55:45,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:55:45,857 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:55:45,857 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:55:45,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:55:45,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 20:55:45,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 20:55:45,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:55:45,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:55:45,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:55:45,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:55:45,860 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 -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2024-11-21 20:55:46,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:55:46,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:55:46,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:55:46,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:55:46,087 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:55:46,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-11-21 20:55:47,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:55:47,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:55:47,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-11-21 20:55:47,574 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4257430a/4598de0ae5a84b5fb73efce0fe639f6f/FLAG68a9457fe [2024-11-21 20:55:47,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4257430a/4598de0ae5a84b5fb73efce0fe639f6f [2024-11-21 20:55:47,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:55:47,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:55:47,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:55:47,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:55:47,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:55:47,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b14b961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47, skipping insertion in model container [2024-11-21 20:55:47,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:55:47,797 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/array-multidimensional/copy-3-n-u.c[322,335] [2024-11-21 20:55:47,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:55:47,825 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:55:47,834 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/array-multidimensional/copy-3-n-u.c[322,335] [2024-11-21 20:55:47,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:55:47,854 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:55:47,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47 WrapperNode [2024-11-21 20:55:47,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:55:47,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:55:47,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:55:47,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:55:47,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,881 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-21 20:55:47,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:55:47,882 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:55:47,882 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:55:47,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:55:47,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,901 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-21 20:55:47,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:55:47,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:55:47,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:55:47,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:55:47,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (1/1) ... [2024-11-21 20:55:47,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:55:47,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:55:47,949 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-21 20:55:47,951 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-21 20:55:47,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:55:47,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 20:55:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 20:55:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-21 20:55:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:55:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-21 20:55:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-21 20:55:47,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-21 20:55:47,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:55:47,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:55:47,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 20:55:47,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 20:55:47,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-21 20:55:47,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:55:48,046 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:55:48,047 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:55:48,167 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-21 20:55:48,167 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:55:48,177 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:55:48,177 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-21 20:55:48,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:55:48 BoogieIcfgContainer [2024-11-21 20:55:48,178 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:55:48,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:55:48,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:55:48,182 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:55:48,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:55:47" (1/3) ... [2024-11-21 20:55:48,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f457abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:55:48, skipping insertion in model container [2024-11-21 20:55:48,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:55:47" (2/3) ... [2024-11-21 20:55:48,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f457abb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:55:48, skipping insertion in model container [2024-11-21 20:55:48,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:55:48" (3/3) ... [2024-11-21 20:55:48,184 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2024-11-21 20:55:48,197 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:55:48,198 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:55:48,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:55:48,242 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;@1ab8998f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:55:48,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:55:48,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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-21 20:55:48,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-21 20:55:48,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:48,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:48,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:48,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:48,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1568356865, now seen corresponding path program 1 times [2024-11-21 20:55:48,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:48,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236255904] [2024-11-21 20:55:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:55:48,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:48,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236255904] [2024-11-21 20:55:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236255904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:55:48,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:55:48,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 20:55:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201661367] [2024-11-21 20:55:48,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:55:48,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 20:55:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 20:55:48,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 20:55:48,398 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 20:55:48,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:48,411 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2024-11-21 20:55:48,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 20:55:48,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2024-11-21 20:55:48,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:48,418 INFO L225 Difference]: With dead ends: 52 [2024-11-21 20:55:48,418 INFO L226 Difference]: Without dead ends: 23 [2024-11-21 20:55:48,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-21 20:55:48,424 INFO L432 NwaCegarLoop]: 35 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, 35 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-21 20:55:48,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:55:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-21 20:55:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-21 20:55:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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-21 20:55:48,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-21 20:55:48,452 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-11-21 20:55:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:48,453 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-21 20:55:48,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 20:55:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-21 20:55:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-21 20:55:48,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:48,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:48,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 20:55:48,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:48,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:48,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1115669473, now seen corresponding path program 1 times [2024-11-21 20:55:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:48,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138654002] [2024-11-21 20:55:48,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:48,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:55:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:48,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138654002] [2024-11-21 20:55:48,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138654002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:55:48,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:55:48,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:55:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448864461] [2024-11-21 20:55:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:55:48,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:55:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:55:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:55:48,595 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 20:55:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:48,632 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-11-21 20:55:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:55:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2024-11-21 20:55:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:48,633 INFO L225 Difference]: With dead ends: 44 [2024-11-21 20:55:48,633 INFO L226 Difference]: Without dead ends: 28 [2024-11-21 20:55:48,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:55:48,634 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:48,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:55:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-21 20:55:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-21 20:55:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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-21 20:55:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-21 20:55:48,639 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2024-11-21 20:55:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:48,639 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-21 20:55:48,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 20:55:48,639 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-21 20:55:48,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 20:55:48,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:48,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:48,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 20:55:48,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:48,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:48,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1536116311, now seen corresponding path program 1 times [2024-11-21 20:55:48,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:48,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469026889] [2024-11-21 20:55:48,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:48,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:55:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469026889] [2024-11-21 20:55:48,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469026889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:55:48,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:55:48,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:55:48,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163623262] [2024-11-21 20:55:48,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:55:48,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:55:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:55:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:55:48,764 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-21 20:55:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:48,823 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-11-21 20:55:48,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:55:48,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2024-11-21 20:55:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:48,824 INFO L225 Difference]: With dead ends: 58 [2024-11-21 20:55:48,825 INFO L226 Difference]: Without dead ends: 37 [2024-11-21 20:55:48,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:55:48,826 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:48,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:55:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-21 20:55:48,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2024-11-21 20:55:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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-21 20:55:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-21 20:55:48,831 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-21 20:55:48,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:48,831 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-21 20:55:48,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-21 20:55:48,831 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-21 20:55:48,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 20:55:48,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:48,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:48,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 20:55:48,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:48,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:48,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1209800511, now seen corresponding path program 1 times [2024-11-21 20:55:48,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:48,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411584196] [2024-11-21 20:55:48,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:48,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:48,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:55:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411584196] [2024-11-21 20:55:48,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411584196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:55:48,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:55:48,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:55:48,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445581679] [2024-11-21 20:55:48,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:55:48,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:55:48,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:48,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:55:48,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:55:48,898 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-21 20:55:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:48,921 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-11-21 20:55:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:55:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 17 [2024-11-21 20:55:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:48,922 INFO L225 Difference]: With dead ends: 58 [2024-11-21 20:55:48,922 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 20:55:48,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:55:48,923 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:48,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:55:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 20:55:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 20:55:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-21 20:55:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 20:55:48,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-21 20:55:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:48,928 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 20:55:48,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-21 20:55:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 20:55:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 20:55:48,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:48,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:48,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 20:55:48,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:48,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash -97783142, now seen corresponding path program 1 times [2024-11-21 20:55:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162353983] [2024-11-21 20:55:48,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 20:55:48,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:48,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162353983] [2024-11-21 20:55:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162353983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:55:48,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:55:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:55:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413015287] [2024-11-21 20:55:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:55:48,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:55:48,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:55:48,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:55:48,985 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-21 20:55:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:49,018 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2024-11-21 20:55:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:55:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 18 [2024-11-21 20:55:49,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:49,019 INFO L225 Difference]: With dead ends: 66 [2024-11-21 20:55:49,019 INFO L226 Difference]: Without dead ends: 54 [2024-11-21 20:55:49,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:55:49,020 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:49,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 38 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:55:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-21 20:55:49,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31. [2024-11-21 20:55:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-21 20:55:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-21 20:55:49,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 18 [2024-11-21 20:55:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:49,027 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-21 20:55:49,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-21 20:55:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-21 20:55:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 20:55:49,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:49,028 INFO L215 NwaCegarLoop]: trace histogram [1, 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-21 20:55:49,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 20:55:49,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:49,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:49,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1661686170, now seen corresponding path program 1 times [2024-11-21 20:55:49,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:49,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272832475] [2024-11-21 20:55:49,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:49,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 20:55:49,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:49,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272832475] [2024-11-21 20:55:49,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272832475] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:55:49,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582368060] [2024-11-21 20:55:49,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:55:49,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:55:49,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:55:49,099 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-21 20:55:49,105 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-21 20:55:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:55:49,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:55:49,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:55:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 20:55:49,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:55:49,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-21 20:55:49,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582368060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:55:49,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:55:49,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-21 20:55:49,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800925151] [2024-11-21 20:55:49,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:55:49,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 20:55:49,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 20:55:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:55:49,292 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-21 20:55:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:49,378 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2024-11-21 20:55:49,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 20:55:49,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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) Word has length 25 [2024-11-21 20:55:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:49,379 INFO L225 Difference]: With dead ends: 80 [2024-11-21 20:55:49,380 INFO L226 Difference]: Without dead ends: 52 [2024-11-21 20:55:49,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:55:49,383 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 66 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:49,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 75 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:55:49,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-21 20:55:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-21 20:55:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 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-21 20:55:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-21 20:55:49,397 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 25 [2024-11-21 20:55:49,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:49,398 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-21 20:55:49,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 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-21 20:55:49,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-21 20:55:49,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 20:55:49,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:49,398 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-21 20:55:49,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-21 20:55:49,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-21 20:55:49,600 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:49,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 53106109, now seen corresponding path program 2 times [2024-11-21 20:55:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820747680] [2024-11-21 20:55:49,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:55:49,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:49,631 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:55:49,631 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:55:49,761 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-21 20:55:49,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:49,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820747680] [2024-11-21 20:55:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820747680] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:55:49,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738291952] [2024-11-21 20:55:49,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:55:49,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:55:49,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:55:49,766 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-21 20:55:49,768 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-21 20:55:49,839 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:55:49,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:55:49,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 20:55:49,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:55:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:55:49,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:55:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:55:49,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738291952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:55:49,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:55:49,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 16 [2024-11-21 20:55:49,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097881550] [2024-11-21 20:55:49,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:55:49,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-21 20:55:49,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:49,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-21 20:55:49,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-21 20:55:49,988 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-21 20:55:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:50,463 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2024-11-21 20:55:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-21 20:55:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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) Word has length 31 [2024-11-21 20:55:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:50,464 INFO L225 Difference]: With dead ends: 168 [2024-11-21 20:55:50,464 INFO L226 Difference]: Without dead ends: 125 [2024-11-21 20:55:50,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1163, Unknown=0, NotChecked=0, Total=1806 [2024-11-21 20:55:50,466 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 256 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:50,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 156 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:55:50,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-21 20:55:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 92. [2024-11-21 20:55:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.2197802197802199) internal successors, (111), 91 states have internal predecessors, (111), 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-21 20:55:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2024-11-21 20:55:50,480 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 31 [2024-11-21 20:55:50,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:50,480 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-11-21 20:55:50,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 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-21 20:55:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2024-11-21 20:55:50,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-21 20:55:50,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:50,481 INFO L215 NwaCegarLoop]: trace histogram [20, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:50,488 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-21 20:55:50,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-21 20:55:50,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:50,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -825223909, now seen corresponding path program 3 times [2024-11-21 20:55:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681170675] [2024-11-21 20:55:50,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:55:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:50,725 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-21 20:55:50,726 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:55:50,762 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-21 20:55:50,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681170675] [2024-11-21 20:55:50,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681170675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:55:50,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078056105] [2024-11-21 20:55:50,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:55:50,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:55:50,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:55:50,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:55:50,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-21 20:55:50,854 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-21 20:55:50,854 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:55:50,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:55:50,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:55:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-21 20:55:50,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:55:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-21 20:55:51,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078056105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:55:51,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-21 20:55:51,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-21 20:55:51,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182130979] [2024-11-21 20:55:51,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-21 20:55:51,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-21 20:55:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 20:55:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-21 20:55:51,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:55:51,073 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-21 20:55:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:55:51,186 INFO L93 Difference]: Finished difference Result 344 states and 425 transitions. [2024-11-21 20:55:51,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 20:55:51,186 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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) Word has length 59 [2024-11-21 20:55:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:55:51,191 INFO L225 Difference]: With dead ends: 344 [2024-11-21 20:55:51,191 INFO L226 Difference]: Without dead ends: 287 [2024-11-21 20:55:51,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2024-11-21 20:55:51,192 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:55:51,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 88 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:55:51,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-21 20:55:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 172. [2024-11-21 20:55:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.1754385964912282) internal successors, (201), 171 states have internal predecessors, (201), 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-21 20:55:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions. [2024-11-21 20:55:51,230 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 59 [2024-11-21 20:55:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:55:51,231 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 201 transitions. [2024-11-21 20:55:51,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-21 20:55:51,231 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions. [2024-11-21 20:55:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-21 20:55:51,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:55:51,236 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:55:51,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-21 20:55:51,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:55:51,437 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:55:51,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:55:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1438165039, now seen corresponding path program 4 times [2024-11-21 20:55:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 20:55:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42179271] [2024-11-21 20:55:51,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:55:51,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 20:55:51,548 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:55:51,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:55:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 382 proven. 1 refuted. 0 times theorem prover too weak. 1609 trivial. 0 not checked. [2024-11-21 20:55:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 20:55:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42179271] [2024-11-21 20:55:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42179271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-21 20:55:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513089062] [2024-11-21 20:55:51,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:55:51,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:55:51,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:55:51,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-21 20:55:51,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-21 20:55:52,731 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:55:52,732 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:55:52,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 145 conjuncts are in the unsatisfiable core [2024-11-21 20:55:52,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:55:52,893 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 15 treesize of output 11 [2024-11-21 20:55:52,959 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-21 20:55:52,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2024-11-21 20:55:53,049 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-21 20:55:53,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56 [2024-11-21 20:55:53,146 INFO L349 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2024-11-21 20:55:53,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 78 [2024-11-21 20:55:53,297 INFO L349 Elim1Store]: treesize reduction 156, result has 20.8 percent of original size [2024-11-21 20:55:53,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 100 [2024-11-21 20:55:53,457 INFO L349 Elim1Store]: treesize reduction 216, result has 19.4 percent of original size [2024-11-21 20:55:53,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 122 [2024-11-21 20:55:53,667 INFO L349 Elim1Store]: treesize reduction 284, result has 18.2 percent of original size [2024-11-21 20:55:53,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 130 treesize of output 144 [2024-11-21 20:55:54,255 INFO L349 Elim1Store]: treesize reduction 360, result has 17.1 percent of original size [2024-11-21 20:55:54,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 149 treesize of output 166 [2024-11-21 20:56:00,462 INFO L349 Elim1Store]: treesize reduction 444, result has 16.1 percent of original size [2024-11-21 20:56:00,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 168 treesize of output 188 [2024-11-21 20:56:21,312 INFO L349 Elim1Store]: treesize reduction 536, result has 15.2 percent of original size [2024-11-21 20:56:21,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 187 treesize of output 210 [2024-11-21 20:56:33,167 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-21 20:56:33,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-21 20:56:33,168 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-21 20:56:33,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-21 20:56:33,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-21 20:56:33,369 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-21 20:56:33,373 INFO L158 Benchmark]: Toolchain (without parser) took 45783.48ms. Allocated memory was 165.7MB in the beginning and 299.9MB in the end (delta: 134.2MB). Free memory was 96.6MB in the beginning and 137.0MB in the end (delta: -40.4MB). Peak memory consumption was 95.0MB. Max. memory is 16.1GB. [2024-11-21 20:56:33,373 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 20:56:33,373 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.04ms. Allocated memory is still 165.7MB. Free memory was 96.4MB in the beginning and 133.1MB in the end (delta: -36.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 20:56:33,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.97ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 131.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:56:33,373 INFO L158 Benchmark]: Boogie Preprocessor took 32.53ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 129.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 20:56:33,374 INFO L158 Benchmark]: RCFGBuilder took 262.48ms. Allocated memory is still 165.7MB. Free memory was 129.2MB in the beginning and 115.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 20:56:33,374 INFO L158 Benchmark]: TraceAbstraction took 45193.19ms. Allocated memory was 165.7MB in the beginning and 299.9MB in the end (delta: 134.2MB). Free memory was 114.6MB in the beginning and 137.0MB in the end (delta: -22.4MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. [2024-11-21 20:56:33,375 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.15ms. Allocated memory is still 165.7MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.04ms. Allocated memory is still 165.7MB. Free memory was 96.4MB in the beginning and 133.1MB in the end (delta: -36.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.97ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 131.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.53ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 129.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.48ms. Allocated memory is still 165.7MB. Free memory was 129.2MB in the beginning and 115.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 45193.19ms. Allocated memory was 165.7MB in the beginning and 299.9MB in the end (delta: 134.2MB). Free memory was 114.6MB in the beginning and 137.0MB in the end (delta: -22.4MB). Peak memory consumption was 113.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/copy-3-n-u.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 caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 20:56:35,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 20:56:35,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 20:56:35,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 20:56:35,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 20:56:35,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 20:56:35,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 20:56:35,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 20:56:35,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 20:56:35,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 20:56:35,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 20:56:35,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 20:56:35,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 20:56:35,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 20:56:35,209 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 20:56:35,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 20:56:35,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 20:56:35,211 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 20:56:35,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 20:56:35,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 20:56:35,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 20:56:35,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 20:56:35,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 20:56:35,217 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 20:56:35,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 20:56:35,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 20:56:35,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 20:56:35,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 20:56:35,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 20:56:35,218 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 20:56:35,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 20:56:35,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 20:56:35,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 20:56:35,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 20:56:35,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:56:35,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 20:56:35,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 20:56:35,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 20:56:35,221 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 20:56:35,221 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 20:56:35,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 20:56:35,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 20:56:35,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 20:56:35,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 20:56:35,223 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 -> caaec4b6d97bde36a1fbc7dfb6c9c9f88e0ac7fb0d2e87f4054fca32d8e102e9 [2024-11-21 20:56:35,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 20:56:35,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 20:56:35,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 20:56:35,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 20:56:35,448 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 20:56:35,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-11-21 20:56:36,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 20:56:36,929 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 20:56:36,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-3-n-u.c [2024-11-21 20:56:36,939 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9936ca6fb/c92c6a3592ba489d83c5bfa682f151f2/FLAG02b10fb38 [2024-11-21 20:56:36,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9936ca6fb/c92c6a3592ba489d83c5bfa682f151f2 [2024-11-21 20:56:36,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 20:56:36,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 20:56:36,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 20:56:36,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 20:56:36,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 20:56:36,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:56:36" (1/1) ... [2024-11-21 20:56:36,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67212e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:36, skipping insertion in model container [2024-11-21 20:56:36,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:56:36" (1/1) ... [2024-11-21 20:56:36,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 20:56:37,128 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/array-multidimensional/copy-3-n-u.c[322,335] [2024-11-21 20:56:37,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:56:37,160 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 20:56:37,170 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/array-multidimensional/copy-3-n-u.c[322,335] [2024-11-21 20:56:37,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 20:56:37,199 INFO L204 MainTranslator]: Completed translation [2024-11-21 20:56:37,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37 WrapperNode [2024-11-21 20:56:37,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 20:56:37,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 20:56:37,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 20:56:37,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 20:56:37,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,232 INFO L138 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 107 [2024-11-21 20:56:37,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 20:56:37,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 20:56:37,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 20:56:37,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 20:56:37,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,258 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 2, 3]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-21 20:56:37,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,263 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 20:56:37,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 20:56:37,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 20:56:37,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 20:56:37,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (1/1) ... [2024-11-21 20:56:37,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 20:56:37,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 20:56:37,305 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-21 20:56:37,310 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-21 20:56:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 20:56:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 20:56:37,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-21 20:56:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-21 20:56:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 20:56:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-21 20:56:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-21 20:56:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-21 20:56:37,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 20:56:37,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 20:56:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 20:56:37,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-21 20:56:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-21 20:56:37,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-21 20:56:37,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 20:56:37,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 20:56:37,713 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-21 20:56:37,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 20:56:37,724 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 20:56:37,725 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-21 20:56:37,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:56:37 BoogieIcfgContainer [2024-11-21 20:56:37,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 20:56:37,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 20:56:37,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 20:56:37,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 20:56:37,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:56:36" (1/3) ... [2024-11-21 20:56:37,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b118a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:56:37, skipping insertion in model container [2024-11-21 20:56:37,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:56:37" (2/3) ... [2024-11-21 20:56:37,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b118a30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:56:37, skipping insertion in model container [2024-11-21 20:56:37,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:56:37" (3/3) ... [2024-11-21 20:56:37,732 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-3-n-u.c [2024-11-21 20:56:37,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 20:56:37,745 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 20:56:37,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 20:56:37,804 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;@6793be61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 20:56:37,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 20:56:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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-21 20:56:37,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-21 20:56:37,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:37,812 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:37,812 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:37,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1568356865, now seen corresponding path program 1 times [2024-11-21 20:56:37,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:37,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479169289] [2024-11-21 20:56:37,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:56:37,826 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-21 20:56:37,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:37,834 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-21 20:56:37,838 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-21 20:56:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:56:37,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-21 20:56:37,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:56:37,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:56:37,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:37,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479169289] [2024-11-21 20:56:37,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479169289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:56:37,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:56:37,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 20:56:37,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534909075] [2024-11-21 20:56:37,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:56:37,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 20:56:37,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 20:56:37,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 20:56:37,972 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 26 states have internal predecessors, (45), 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 20:56:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:37,986 INFO L93 Difference]: Finished difference Result 52 states and 88 transitions. [2024-11-21 20:56:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 20:56:37,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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) Word has length 11 [2024-11-21 20:56:37,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:37,995 INFO L225 Difference]: With dead ends: 52 [2024-11-21 20:56:37,995 INFO L226 Difference]: Without dead ends: 23 [2024-11-21 20:56:37,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-21 20:56:38,001 INFO L432 NwaCegarLoop]: 35 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, 35 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-21 20:56:38,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 20:56:38,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-21 20:56:38,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-21 20:56:38,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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-21 20:56:38,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-11-21 20:56:38,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 11 [2024-11-21 20:56:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:38,029 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-11-21 20:56:38,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-21 20:56:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-11-21 20:56:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-21 20:56:38,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:38,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:38,036 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-21 20:56:38,236 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-21 20:56:38,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:38,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1115669473, now seen corresponding path program 1 times [2024-11-21 20:56:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:38,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905241175] [2024-11-21 20:56:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:56:38,239 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-21 20:56:38,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:38,244 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-21 20:56:38,255 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-21 20:56:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:56:38,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:56:38,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:56:38,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:56:38,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:38,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905241175] [2024-11-21 20:56:38,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905241175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:56:38,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:56:38,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 20:56:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084484488] [2024-11-21 20:56:38,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:56:38,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 20:56:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 20:56:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:56:38,353 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 20:56:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:38,510 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2024-11-21 20:56:38,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 20:56:38,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) Word has length 11 [2024-11-21 20:56:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:38,515 INFO L225 Difference]: With dead ends: 44 [2024-11-21 20:56:38,515 INFO L226 Difference]: Without dead ends: 28 [2024-11-21 20:56:38,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 20:56:38,516 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:38,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 20:56:38,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-21 20:56:38,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-21 20:56:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 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-21 20:56:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2024-11-21 20:56:38,521 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 11 [2024-11-21 20:56:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:38,521 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2024-11-21 20:56:38,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-21 20:56:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2024-11-21 20:56:38,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 20:56:38,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:38,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:38,526 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-21 20:56:38,722 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-21 20:56:38,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:38,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:38,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1536116311, now seen corresponding path program 1 times [2024-11-21 20:56:38,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:38,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049823970] [2024-11-21 20:56:38,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:56:38,729 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-21 20:56:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:38,731 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-21 20:56:38,732 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-21 20:56:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:56:38,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:56:38,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:56:38,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:56:38,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:38,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049823970] [2024-11-21 20:56:38,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049823970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:56:38,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:56:38,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:56:38,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243461731] [2024-11-21 20:56:38,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:56:38,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:56:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:56:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:56:38,814 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-21 20:56:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:39,045 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-11-21 20:56:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:56:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) Word has length 14 [2024-11-21 20:56:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:39,053 INFO L225 Difference]: With dead ends: 58 [2024-11-21 20:56:39,054 INFO L226 Difference]: Without dead ends: 37 [2024-11-21 20:56:39,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:56:39,055 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 57 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:39,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 34 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 20:56:39,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-21 20:56:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2024-11-21 20:56:39,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 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-21 20:56:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-21 20:56:39,064 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-21 20:56:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:39,064 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-21 20:56:39,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-21 20:56:39,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-21 20:56:39,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 20:56:39,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:39,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:39,069 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-21 20:56:39,268 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-21 20:56:39,269 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:39,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:39,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1209800511, now seen corresponding path program 1 times [2024-11-21 20:56:39,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:39,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791699211] [2024-11-21 20:56:39,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:56:39,270 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-21 20:56:39,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:39,273 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-21 20:56:39,274 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-21 20:56:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:56:39,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:56:39,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:39,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:56:39,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:56:39,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791699211] [2024-11-21 20:56:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791699211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:56:39,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:56:39,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:56:39,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449719403] [2024-11-21 20:56:39,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:56:39,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:56:39,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:39,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:56:39,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:56:39,347 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-21 20:56:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:39,507 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2024-11-21 20:56:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:56:39,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) Word has length 17 [2024-11-21 20:56:39,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:39,515 INFO L225 Difference]: With dead ends: 58 [2024-11-21 20:56:39,515 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 20:56:39,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:56:39,516 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:39,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 44 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 20:56:39,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 20:56:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 20:56:39,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-21 20:56:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 20:56:39,532 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-21 20:56:39,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:39,532 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 20:56:39,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-21 20:56:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 20:56:39,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 20:56:39,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:39,532 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:39,540 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-21 20:56:39,733 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-21 20:56:39,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:39,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:39,734 INFO L85 PathProgramCache]: Analyzing trace with hash -97783142, now seen corresponding path program 1 times [2024-11-21 20:56:39,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:39,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021934846] [2024-11-21 20:56:39,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:56:39,734 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-21 20:56:39,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:39,737 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-21 20:56:39,738 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-21 20:56:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:56:39,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:56:39,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:56:39,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:56:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 20:56:39,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:39,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021934846] [2024-11-21 20:56:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021934846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:56:39,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 20:56:39,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-21 20:56:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095967045] [2024-11-21 20:56:39,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 20:56:39,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 20:56:39,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:39,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 20:56:39,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 20:56:39,963 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 20:56:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:40,351 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2024-11-21 20:56:40,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 20:56:40,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 18 [2024-11-21 20:56:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:40,360 INFO L225 Difference]: With dead ends: 78 [2024-11-21 20:56:40,360 INFO L226 Difference]: Without dead ends: 51 [2024-11-21 20:56:40,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:56:40,361 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 136 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:40,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 71 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 20:56:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-21 20:56:40,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-11-21 20:56:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 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-21 20:56:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-11-21 20:56:40,369 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 18 [2024-11-21 20:56:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:40,370 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-21 20:56:40,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-21 20:56:40,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-11-21 20:56:40,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-21 20:56:40,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:40,370 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:40,380 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-21 20:56:40,570 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-21 20:56:40,571 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:40,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:40,572 INFO L85 PathProgramCache]: Analyzing trace with hash 988124671, now seen corresponding path program 2 times [2024-11-21 20:56:40,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:40,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449475589] [2024-11-21 20:56:40,572 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:56:40,572 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-21 20:56:40,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:40,574 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-21 20:56:40,575 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-21 20:56:40,641 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-21 20:56:40,642 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:56:40,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 20:56:40,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:40,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:56:40,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 20:56:40,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449475589] [2024-11-21 20:56:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449475589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 20:56:40,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 20:56:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 20:56:40,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839493357] [2024-11-21 20:56:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 20:56:40,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 20:56:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:40,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 20:56:40,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:56:40,686 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-21 20:56:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:40,902 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2024-11-21 20:56:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 20:56:40,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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) Word has length 21 [2024-11-21 20:56:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:40,907 INFO L225 Difference]: With dead ends: 105 [2024-11-21 20:56:40,907 INFO L226 Difference]: Without dead ends: 84 [2024-11-21 20:56:40,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-21 20:56:40,909 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 60 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:40,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 20:56:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-21 20:56:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 46. [2024-11-21 20:56:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 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-21 20:56:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-11-21 20:56:40,921 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2024-11-21 20:56:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:40,921 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-11-21 20:56:40,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-21 20:56:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-11-21 20:56:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-21 20:56:40,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:40,922 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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-21 20:56:40,926 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-21 20:56:41,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-21 20:56:41,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:41,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash 53106109, now seen corresponding path program 1 times [2024-11-21 20:56:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084871783] [2024-11-21 20:56:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 20:56:41,123 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-21 20:56:41,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:41,127 INFO L229 MonitoredProcess]: Starting monitored process 8 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-21 20:56:41,128 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 (8)] Waiting until timeout for monitored process [2024-11-21 20:56:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 20:56:41,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-21 20:56:41,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:56:41,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:56:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-21 20:56:41,425 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084871783] [2024-11-21 20:56:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084871783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:56:41,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 20:56:41,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-21 20:56:41,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562902760] [2024-11-21 20:56:41,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 20:56:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-21 20:56:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:41,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-21 20:56:41,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-21 20:56:41,427 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-21 20:56:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:42,602 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2024-11-21 20:56:42,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-21 20:56:42,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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) Word has length 31 [2024-11-21 20:56:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:42,608 INFO L225 Difference]: With dead ends: 137 [2024-11-21 20:56:42,608 INFO L226 Difference]: Without dead ends: 94 [2024-11-21 20:56:42,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-21 20:56:42,609 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 284 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:42,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 211 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-21 20:56:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-21 20:56:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-11-21 20:56:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.24) internal successors, (93), 75 states have internal predecessors, (93), 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-21 20:56:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-11-21 20:56:42,622 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 31 [2024-11-21 20:56:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:42,622 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-11-21 20:56:42,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 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-21 20:56:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-11-21 20:56:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-21 20:56:42,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:42,623 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:42,630 INFO L540 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 (8)] Forceful destruction successful, exit code 0 [2024-11-21 20:56:42,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-21 20:56:42,825 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:42,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:42,825 INFO L85 PathProgramCache]: Analyzing trace with hash 2141491421, now seen corresponding path program 2 times [2024-11-21 20:56:42,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:42,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321369182] [2024-11-21 20:56:42,826 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-21 20:56:42,826 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-21 20:56:42,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:42,828 INFO L229 MonitoredProcess]: Starting monitored process 9 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-21 20:56:42,829 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 (9)] Waiting until timeout for monitored process [2024-11-21 20:56:43,088 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-21 20:56:43,088 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:56:43,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-21 20:56:43,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-21 20:56:43,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:56:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 2 proven. 55 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-21 20:56:43,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321369182] [2024-11-21 20:56:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321369182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:56:43,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 20:56:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-21 20:56:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161345284] [2024-11-21 20:56:43,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 20:56:43,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-21 20:56:43,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:43,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-21 20:56:43,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-21 20:56:43,717 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 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-21 20:56:46,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:46,480 INFO L93 Difference]: Finished difference Result 251 states and 312 transitions. [2024-11-21 20:56:46,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-21 20:56:46,483 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 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) Word has length 43 [2024-11-21 20:56:46,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:46,484 INFO L225 Difference]: With dead ends: 251 [2024-11-21 20:56:46,484 INFO L226 Difference]: Without dead ends: 178 [2024-11-21 20:56:46,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2024-11-21 20:56:46,485 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 511 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:46,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 705 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-21 20:56:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-21 20:56:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2024-11-21 20:56:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 135 states have internal predecessors, (165), 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-21 20:56:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2024-11-21 20:56:46,506 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 43 [2024-11-21 20:56:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:46,506 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2024-11-21 20:56:46,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 26 states have internal predecessors, (48), 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-21 20:56:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2024-11-21 20:56:46,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-21 20:56:46,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:46,507 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 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-21 20:56:46,517 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 (9)] Ended with exit code 0 [2024-11-21 20:56:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-21 20:56:46,708 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash 587853597, now seen corresponding path program 3 times [2024-11-21 20:56:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:46,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344855880] [2024-11-21 20:56:46,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-21 20:56:46,710 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-21 20:56:46,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:46,712 INFO L229 MonitoredProcess]: Starting monitored process 10 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-21 20:56:46,713 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 (10)] Waiting until timeout for monitored process [2024-11-21 20:56:46,821 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-21 20:56:46,822 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:56:46,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-21 20:56:46,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:56:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-21 20:56:46,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-21 20:56:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 509 trivial. 0 not checked. [2024-11-21 20:56:47,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 20:56:47,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344855880] [2024-11-21 20:56:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344855880] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-21 20:56:47,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-21 20:56:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-21 20:56:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136796797] [2024-11-21 20:56:47,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-21 20:56:47,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-21 20:56:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 20:56:47,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-21 20:56:47,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-21 20:56:47,084 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-21 20:56:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 20:56:47,406 INFO L93 Difference]: Finished difference Result 632 states and 774 transitions. [2024-11-21 20:56:47,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 20:56:47,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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) Word has length 67 [2024-11-21 20:56:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 20:56:47,409 INFO L225 Difference]: With dead ends: 632 [2024-11-21 20:56:47,409 INFO L226 Difference]: Without dead ends: 527 [2024-11-21 20:56:47,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-21 20:56:47,410 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 210 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 20:56:47,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 88 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 20:56:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-21 20:56:47,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 304. [2024-11-21 20:56:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 303 states have (on average 1.1386138613861385) internal successors, (345), 303 states have internal predecessors, (345), 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-21 20:56:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 345 transitions. [2024-11-21 20:56:47,473 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 345 transitions. Word has length 67 [2024-11-21 20:56:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 20:56:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 345 transitions. [2024-11-21 20:56:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-21 20:56:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 345 transitions. [2024-11-21 20:56:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-21 20:56:47,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 20:56:47,481 INFO L215 NwaCegarLoop]: trace histogram [88, 88, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 20:56:47,486 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 (10)] Ended with exit code 0 [2024-11-21 20:56:47,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-21 20:56:47,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 20:56:47,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 20:56:47,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1854973743, now seen corresponding path program 4 times [2024-11-21 20:56:47,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 20:56:47,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940452284] [2024-11-21 20:56:47,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-21 20:56:47,684 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-21 20:56:47,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 20:56:47,686 INFO L229 MonitoredProcess]: Starting monitored process 11 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-21 20:56:47,687 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 (11)] Waiting until timeout for monitored process [2024-11-21 20:56:59,742 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-21 20:56:59,742 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-21 20:56:59,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 326 conjuncts are in the unsatisfiable core [2024-11-21 20:56:59,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 20:57:04,463 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 15 treesize of output 11 [2024-11-21 20:57:04,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2024-11-21 20:57:04,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:04,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 48 [2024-11-21 20:57:05,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:05,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 66 [2024-11-21 20:57:05,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:05,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 76 treesize of output 84 [2024-11-21 20:57:05,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:05,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 102 [2024-11-21 20:57:06,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:06,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 106 treesize of output 120 [2024-11-21 20:57:06,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:06,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 121 treesize of output 138 [2024-11-21 20:57:06,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:06,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 136 treesize of output 156 [2024-11-21 20:57:07,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:07,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 151 treesize of output 174 [2024-11-21 20:57:07,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:07,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 166 treesize of output 192 [2024-11-21 20:57:08,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:08,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 181 treesize of output 210 [2024-11-21 20:57:09,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:09,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 196 treesize of output 228 [2024-11-21 20:57:09,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:09,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 211 treesize of output 246 [2024-11-21 20:57:10,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:10,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 226 treesize of output 264 [2024-11-21 20:57:11,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:11,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 241 treesize of output 282 [2024-11-21 20:57:12,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:12,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 256 treesize of output 300 [2024-11-21 20:57:12,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:12,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 271 treesize of output 318 [2024-11-21 20:57:13,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:14,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 286 treesize of output 336 [2024-11-21 20:57:15,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:15,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 301 treesize of output 354 [2024-11-21 20:57:16,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:16,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 316 treesize of output 372 [2024-11-21 20:57:17,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-21 20:57:17,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 331 treesize of output 390 [2024-11-21 20:57:24,869 INFO L349 Elim1Store]: treesize reduction 790, result has 20.0 percent of original size [2024-11-21 20:57:24,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 22 select indices, 22 select index equivalence classes, 0 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 253 case distinctions, treesize of input 354 treesize of output 416