/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 03:48:29,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 03:48:29,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 03:48:29,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 03:48:29,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 03:48:29,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 03:48:29,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 03:48:29,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 03:48:29,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 03:48:29,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 03:48:29,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 03:48:29,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 03:48:29,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 03:48:29,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 03:48:29,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 03:48:29,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 03:48:29,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 03:48:29,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 03:48:29,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 03:48:29,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 03:48:29,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 03:48:29,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 03:48:29,291 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 03:48:29,292 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 03:48:29,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 03:48:29,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 03:48:29,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 03:48:29,294 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 03:48:29,294 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 03:48:29,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 03:48:29,295 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 03:48:29,296 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 03:48:29,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 03:48:29,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 03:48:29,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 03:48:29,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 03:48:29,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 03:48:29,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 03:48:29,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 03:48:29,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 03:48:29,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 03:48:29,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 03:48:29,316 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 03:48:29,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 03:48:29,316 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 03:48:29,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 03:48:29,317 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 03:48:29,317 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 03:48:29,318 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 03:48:29,318 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 03:48:29,318 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 03:48:29,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 03:48:29,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 03:48:29,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 03:48:29,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 03:48:29,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 03:48:29,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 03:48:29,319 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:48:29,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 03:48:29,320 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 03:48:29,321 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 03:48:29,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 03:48:29,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 03:48:29,321 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 03:48:29,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 03:48:29,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 03:48:29,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 03:48:29,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 03:48:29,493 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 03:48:29,493 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/revcpyswp2.c [2022-01-10 03:48:29,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62a658b/0967e33ce6564db4a9730e44cf52bd05/FLAG184fb9a8d [2022-01-10 03:48:29,843 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 03:48:29,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c [2022-01-10 03:48:29,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62a658b/0967e33ce6564db4a9730e44cf52bd05/FLAG184fb9a8d [2022-01-10 03:48:30,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d62a658b/0967e33ce6564db4a9730e44cf52bd05 [2022-01-10 03:48:30,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 03:48:30,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 03:48:30,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 03:48:30,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 03:48:30,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 03:48:30,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@451ce294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30, skipping insertion in model container [2022-01-10 03:48:30,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 03:48:30,312 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 03:48:30,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c[432,445] [2022-01-10 03:48:30,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:48:30,457 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 03:48:30,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/revcpyswp2.c[432,445] [2022-01-10 03:48:30,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 03:48:30,496 INFO L208 MainTranslator]: Completed translation [2022-01-10 03:48:30,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30 WrapperNode [2022-01-10 03:48:30,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 03:48:30,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 03:48:30,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 03:48:30,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 03:48:30,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,539 INFO L137 Inliner]: procedures = 18, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 105 [2022-01-10 03:48:30,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 03:48:30,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 03:48:30,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 03:48:30,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 03:48:30,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 03:48:30,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 03:48:30,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 03:48:30,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 03:48:30,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (1/1) ... [2022-01-10 03:48:30,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 03:48:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 03:48:30,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 03:48:30,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 03:48:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 03:48:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 03:48:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 03:48:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 03:48:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 03:48:30,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 03:48:30,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 03:48:30,667 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 03:48:30,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 03:48:30,841 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 03:48:30,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 03:48:30,845 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 03:48:30,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:48:30 BoogieIcfgContainer [2022-01-10 03:48:30,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 03:48:30,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 03:48:30,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 03:48:30,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 03:48:30,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:48:30" (1/3) ... [2022-01-10 03:48:30,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117bfc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:48:30, skipping insertion in model container [2022-01-10 03:48:30,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:48:30" (2/3) ... [2022-01-10 03:48:30,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117bfc35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:48:30, skipping insertion in model container [2022-01-10 03:48:30,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:48:30" (3/3) ... [2022-01-10 03:48:30,867 INFO L111 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2022-01-10 03:48:30,874 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 03:48:30,874 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 03:48:30,917 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 03:48:30,922 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 03:48:30,922 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 03:48:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) [2022-01-10 03:48:30,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 03:48:30,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:48:30,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:48:30,934 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:48:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:48:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1560213877, now seen corresponding path program 1 times [2022-01-10 03:48:30,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:48:30,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117755942] [2022-01-10 03:48:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:48:30,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:48:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:48:30,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:48:30,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 03:48:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:48:31,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 03:48:31,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:48:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:48:31,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:48:31,078 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:48:31,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117755942] [2022-01-10 03:48:31,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117755942] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:48:31,079 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:48:31,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 03:48:31,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523369471] [2022-01-10 03:48:31,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:48:31,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 03:48:31,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:48:31,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 03:48:31,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:48:31,111 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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) [2022-01-10 03:48:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:48:31,123 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-01-10 03:48:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 03:48:31,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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 [2022-01-10 03:48:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:48:31,134 INFO L225 Difference]: With dead ends: 45 [2022-01-10 03:48:31,135 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 03:48:31,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 03:48:31,140 INFO L933 BasicCegarLoop]: 30 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, 30 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 [2022-01-10 03:48:31,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 03:48:31,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 03:48:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 03:48:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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) [2022-01-10 03:48:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 03:48:31,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-01-10 03:48:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:48:31,161 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 03:48:31,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 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) [2022-01-10 03:48:31,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 03:48:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 03:48:31,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:48:31,162 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:48:31,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 03:48:31,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:48:31,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:48:31,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:48:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash 631559685, now seen corresponding path program 1 times [2022-01-10 03:48:31,381 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:48:31,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224217017] [2022-01-10 03:48:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:48:31,382 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:48:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:48:31,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:48:31,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 03:48:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:48:31,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:48:31,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:48:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:48:31,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:48:31,528 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:48:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224217017] [2022-01-10 03:48:31,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224217017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:48:31,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:48:31,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 03:48:31,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909129927] [2022-01-10 03:48:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:48:31,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 03:48:31,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:48:31,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 03:48:31,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 03:48:31,530 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2022-01-10 03:48:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:48:31,612 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-01-10 03:48:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 03:48:31,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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 [2022-01-10 03:48:31,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:48:31,613 INFO L225 Difference]: With dead ends: 39 [2022-01-10 03:48:31,613 INFO L226 Difference]: Without dead ends: 23 [2022-01-10 03:48:31,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:48:31,615 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:48:31,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:48:31,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-10 03:48:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-01-10 03:48:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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) [2022-01-10 03:48:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-01-10 03:48:31,619 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2022-01-10 03:48:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:48:31,619 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-01-10 03:48:31,619 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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) [2022-01-10 03:48:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-01-10 03:48:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 03:48:31,620 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:48:31,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:48:31,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 03:48:31,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:48:31,827 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:48:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:48:31,827 INFO L85 PathProgramCache]: Analyzing trace with hash -971977821, now seen corresponding path program 1 times [2022-01-10 03:48:31,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:48:31,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088363726] [2022-01-10 03:48:31,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:48:31,828 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:48:31,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:48:31,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:48:31,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 03:48:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:48:31,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 03:48:31,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:48:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:48:31,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:48:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 03:48:32,034 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:48:32,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088363726] [2022-01-10 03:48:32,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088363726] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:48:32,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:48:32,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-01-10 03:48:32,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142523142] [2022-01-10 03:48:32,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:48:32,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 03:48:32,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:48:32,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 03:48:32,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:48:32,036 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2022-01-10 03:48:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:48:32,177 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-01-10 03:48:32,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 03:48:32,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 16 [2022-01-10 03:48:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:48:32,178 INFO L225 Difference]: With dead ends: 41 [2022-01-10 03:48:32,179 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 03:48:32,179 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-01-10 03:48:32,180 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:48:32,180 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 26 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:48:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 03:48:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 03:48:32,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 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) [2022-01-10 03:48:32,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 03:48:32,183 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2022-01-10 03:48:32,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:48:32,183 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 03:48:32,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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) [2022-01-10 03:48:32,184 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 03:48:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 03:48:32,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:48:32,184 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:48:32,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 03:48:32,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:48:32,385 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:48:32,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:48:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash -78261823, now seen corresponding path program 2 times [2022-01-10 03:48:32,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:48:32,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009037575] [2022-01-10 03:48:32,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:48:32,386 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:48:32,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:48:32,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:48:32,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 03:48:32,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 03:48:32,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:48:32,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 03:48:32,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:48:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:48:32,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 03:48:32,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:48:32,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009037575] [2022-01-10 03:48:32,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009037575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 03:48:32,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 03:48:32,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 03:48:32,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019119725] [2022-01-10 03:48:32,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 03:48:32,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 03:48:32,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:48:32,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 03:48:32,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 03:48:32,514 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-01-10 03:48:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:48:32,623 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-01-10 03:48:32,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 03:48:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 [2022-01-10 03:48:32,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:48:32,633 INFO L225 Difference]: With dead ends: 49 [2022-01-10 03:48:32,633 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 03:48:32,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 03:48:32,634 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 68 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 03:48:32,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 14 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 03:48:32,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 03:48:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2022-01-10 03:48:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 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) [2022-01-10 03:48:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-10 03:48:32,656 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 18 [2022-01-10 03:48:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:48:32,656 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-10 03:48:32,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-01-10 03:48:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-10 03:48:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 03:48:32,657 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:48:32,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:48:32,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 03:48:32,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:48:32,862 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:48:32,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:48:32,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1086929509, now seen corresponding path program 1 times [2022-01-10 03:48:32,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:48:32,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115186228] [2022-01-10 03:48:32,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 03:48:32,863 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:48:32,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:48:32,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:48:32,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 03:48:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 03:48:32,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 03:48:32,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:48:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:48:33,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:48:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 03:48:33,335 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 03:48:33,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115186228] [2022-01-10 03:48:33,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115186228] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 03:48:33,336 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 03:48:33,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-01-10 03:48:33,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471426402] [2022-01-10 03:48:33,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 03:48:33,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 03:48:33,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 03:48:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 03:48:33,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-01-10 03:48:33,337 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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) [2022-01-10 03:48:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 03:48:33,790 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-01-10 03:48:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 03:48:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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 24 [2022-01-10 03:48:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 03:48:33,791 INFO L225 Difference]: With dead ends: 92 [2022-01-10 03:48:33,791 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 03:48:33,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2022-01-10 03:48:33,792 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 176 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 03:48:33,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 46 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 03:48:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 03:48:33,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2022-01-10 03:48:33,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.11864406779661) internal successors, (66), 59 states have internal predecessors, (66), 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) [2022-01-10 03:48:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-01-10 03:48:33,799 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 24 [2022-01-10 03:48:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 03:48:33,799 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-01-10 03:48:33,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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) [2022-01-10 03:48:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-01-10 03:48:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 03:48:33,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 03:48:33,800 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 03:48:33,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 03:48:34,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 03:48:34,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 03:48:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 03:48:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1519365621, now seen corresponding path program 2 times [2022-01-10 03:48:34,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 03:48:34,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409550117] [2022-01-10 03:48:34,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 03:48:34,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 03:48:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 03:48:34,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 03:48:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 03:48:34,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 03:48:34,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 03:48:34,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-10 03:48:34,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 03:48:34,276 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 03:48:34,277 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-01-10 03:48:34,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2022-01-10 03:48:34,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2022-01-10 03:48:34,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:48:34,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-01-10 03:48:34,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2022-01-10 03:48:34,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:48:34,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2022-01-10 03:48:34,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 30 [2022-01-10 03:48:34,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2022-01-10 03:48:35,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:48:35,096 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 54 [2022-01-10 03:48:35,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-01-10 03:48:35,352 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2022-01-10 03:48:35,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-01-10 03:48:35,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 03:48:35,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-01-10 03:48:35,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 50 [2022-01-10 03:48:35,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2022-01-10 03:48:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 03:48:35,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 03:48:35,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv4 64)))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0)))))))) is different from false [2022-01-10 03:48:35,848 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (bvmul ((_ sign_extend 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv4 64)))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse1))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0))))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-01-10 03:48:35,940 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv4 64)))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (bvmul ((_ sign_extend 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv4 64)))) (store (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_213 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse2)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0))))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-01-10 03:48:36,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse4 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (let ((.cse1 (bvadd .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (bvadd .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_213 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse3)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0))))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-01-10 03:48:36,117 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_204 (_ BitVec 32)) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse6 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (let ((.cse1 (bvadd .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse9 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv4 64)))) (let ((.cse8 (bvadd .cse9 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) (let ((.cse5 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) .cse8 v_ArrVal_204))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse5 (bvadd .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_213 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse3)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0)))))))))) is different from false [2022-01-10 03:48:36,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_204 (_ BitVec 32)) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse6 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (let ((.cse1 (bvadd .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse9 (bvmul ((_ sign_extend 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv4 64)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse9))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse8))))) (let ((.cse5 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) .cse8 v_ArrVal_204))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse5 (bvadd .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_213 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse3)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0))))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-01-10 03:48:36,320 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_202 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_204 (_ BitVec 32)) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse6 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (let ((.cse1 (bvadd .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse2 (store (let ((.cse10 (bvmul ((_ sign_extend 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv4 64)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse10))) (let ((.cse7 (let ((.cse11 (let ((.cse12 (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv4 64)))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~b~0#1.base|) (bvadd .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~b~0#1.base| .cse11))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse10 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse11 .cse8))))))) (let ((.cse5 (store (select .cse7 |c_ULTIMATE.start_main_~b~0#1.base|) .cse8 v_ArrVal_204))) (let ((.cse4 (store .cse7 |c_ULTIMATE.start_main_~b~0#1.base| .cse5))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse5 (bvadd .cse6 |c_ULTIMATE.start_main_~b~0#1.offset|))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select v_ArrVal_213 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse3)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0)))))))))) is different from false [2022-01-10 03:48:37,723 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_202 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_198 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_204 (_ BitVec 32)) (v_ArrVal_199 (_ BitVec 32)) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse12 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (let ((.cse1 (bvadd .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse13 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (let ((.cse3 (bvadd .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse13))) (let ((.cse2 (store (let ((.cse7 (bvadd .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse8 (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~0#1|) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_199)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_198))) (let ((.cse10 (store (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (let ((.cse9 (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~b~0#1.base| .cse10))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 (select .cse10 .cse4)))))))) (let ((.cse6 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) .cse4 v_ArrVal_204))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse6))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse6 .cse7))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 (select v_ArrVal_213 .cse4)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0)))))))))) is different from false [2022-01-10 03:48:37,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_201 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_202 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_213 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_198 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_204 (_ BitVec 32)) (v_ArrVal_199 (_ BitVec 32)) (v_ArrVal_216 (Array (_ BitVec 64) (_ BitVec 32)))) (let ((.cse12 (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))) (let ((.cse1 (bvadd .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse0 (store (let ((.cse13 (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (let ((.cse3 (bvadd .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse4 (bvadd |c_ULTIMATE.start_main_~b~0#1.offset| .cse13))) (let ((.cse2 (store (let ((.cse7 (bvadd .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse8 (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_199)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_198))) (let ((.cse10 (store (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_202) |c_ULTIMATE.start_main_~b~0#1.base|) .cse7 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (let ((.cse9 (store (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_201) |c_ULTIMATE.start_main_~b~0#1.base| .cse10))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 (select .cse10 .cse4)))))))) (let ((.cse6 (store (select .cse8 |c_ULTIMATE.start_main_~b~0#1.base|) .cse4 v_ArrVal_204))) (let ((.cse5 (store .cse8 |c_ULTIMATE.start_main_~b~0#1.base| .cse6))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse6 .cse7))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse3 (select v_ArrVal_213 .cse4)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a_copy~0#1.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv4294967295 32) c_~SIZE~0))))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-01-10 03:48:38,395 INFO L353 Elim1Store]: treesize reduction 62, result has 33.3 percent of original size [2022-01-10 03:48:38,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 14425 treesize of output 6136