/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-fpi/condg.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 04:02:25,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 04:02:25,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 04:02:25,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 04:02:25,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 04:02:25,151 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 04:02:25,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 04:02:25,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 04:02:25,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 04:02:25,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 04:02:25,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 04:02:25,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 04:02:25,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 04:02:25,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 04:02:25,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 04:02:25,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 04:02:25,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 04:02:25,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 04:02:25,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 04:02:25,161 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 04:02:25,162 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 04:02:25,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 04:02:25,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 04:02:25,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 04:02:25,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 04:02:25,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 04:02:25,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 04:02:25,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 04:02:25,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 04:02:25,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 04:02:25,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 04:02:25,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 04:02:25,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 04:02:25,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 04:02:25,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 04:02:25,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 04:02:25,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 04:02:25,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 04:02:25,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 04:02:25,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 04:02:25,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 04:02:25,208 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 04:02:25,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 04:02:25,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 04:02:25,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 04:02:25,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 04:02:25,222 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 04:02:25,222 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 04:02:25,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 04:02:25,223 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 04:02:25,223 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 04:02:25,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 04:02:25,223 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 04:02:25,223 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 04:02:25,223 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 04:02:25,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 04:02:25,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 04:02:25,224 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:02:25,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 04:02:25,225 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 04:02:25,226 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 04:02:25,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 04:02:25,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 04:02:25,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 04:02:25,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 04:02:25,479 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 04:02:25,480 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/condg.c [2022-01-10 04:02:25,529 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701dadb23/78d1573fa3d7447c833306795817a5d1/FLAGc662a4b3e [2022-01-10 04:02:25,848 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 04:02:25,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/condg.c [2022-01-10 04:02:25,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701dadb23/78d1573fa3d7447c833306795817a5d1/FLAGc662a4b3e [2022-01-10 04:02:26,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701dadb23/78d1573fa3d7447c833306795817a5d1 [2022-01-10 04:02:26,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 04:02:26,282 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 04:02:26,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 04:02:26,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 04:02:26,287 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 04:02:26,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49bd804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26, skipping insertion in model container [2022-01-10 04:02:26,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 04:02:26,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 04:02:26,440 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-fpi/condg.c[588,601] [2022-01-10 04:02:26,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:02:26,473 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 04:02:26,482 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-fpi/condg.c[588,601] [2022-01-10 04:02:26,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 04:02:26,514 INFO L208 MainTranslator]: Completed translation [2022-01-10 04:02:26,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26 WrapperNode [2022-01-10 04:02:26,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 04:02:26,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 04:02:26,515 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 04:02:26,515 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 04:02:26,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,551 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-01-10 04:02:26,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 04:02:26,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 04:02:26,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 04:02:26,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 04:02:26,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,563 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 04:02:26,590 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 04:02:26,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 04:02:26,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 04:02:26,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (1/1) ... [2022-01-10 04:02:26,596 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 04:02:26,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 04:02:26,613 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 04:02:26,645 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 04:02:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 04:02:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 04:02:26,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 04:02:26,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 04:02:26,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 04:02:26,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 04:02:26,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 04:02:26,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 04:02:26,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 04:02:26,751 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 04:02:26,752 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 04:02:26,937 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 04:02:26,941 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 04:02:26,941 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 04:02:26,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:02:26 BoogieIcfgContainer [2022-01-10 04:02:26,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 04:02:26,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 04:02:26,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 04:02:26,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 04:02:26,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 04:02:26" (1/3) ... [2022-01-10 04:02:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730c95d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:02:26, skipping insertion in model container [2022-01-10 04:02:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 04:02:26" (2/3) ... [2022-01-10 04:02:26,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@730c95d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 04:02:26, skipping insertion in model container [2022-01-10 04:02:26,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 04:02:26" (3/3) ... [2022-01-10 04:02:26,949 INFO L111 eAbstractionObserver]: Analyzing ICFG condg.c [2022-01-10 04:02:26,954 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 04:02:26,954 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 04:02:26,998 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 04:02:27,005 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 04:02:27,006 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 04:02:27,017 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 04:02:27,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 04:02:27,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:27,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:27,021 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:27,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash -592817118, now seen corresponding path program 1 times [2022-01-10 04:02:27,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:27,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859694970] [2022-01-10 04:02:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:02:27,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:27,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:27,075 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 04:02:27,077 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 04:02:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:02:27,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 04:02:27,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:27,182 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 04:02:27,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:02:27,184 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859694970] [2022-01-10 04:02:27,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859694970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:02:27,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:02:27,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 04:02:27,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065482589] [2022-01-10 04:02:27,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:02:27,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 04:02:27,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:27,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 04:02:27,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 04:02:27,213 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 04:02:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:27,224 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-01-10 04:02:27,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 04:02:27,225 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 04:02:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:27,237 INFO L225 Difference]: With dead ends: 46 [2022-01-10 04:02:27,237 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 04:02:27,242 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 04:02:27,245 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 04:02:27,246 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 04:02:27,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 04:02:27,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 04:02:27,265 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 04:02:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 04:02:27,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-01-10 04:02:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:27,267 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 04:02:27,267 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 04:02:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 04:02:27,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 04:02:27,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:27,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:27,274 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 04:02:27,475 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 04:02:27,476 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:27,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 108247460, now seen corresponding path program 1 times [2022-01-10 04:02:27,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:27,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164716976] [2022-01-10 04:02:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:02:27,477 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:27,478 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 04:02:27,480 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 04:02:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:02:27,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 04:02:27,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:27,660 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 04:02:27,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 04:02:27,660 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:27,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164716976] [2022-01-10 04:02:27,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164716976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 04:02:27,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 04:02:27,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 04:02:27,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36530683] [2022-01-10 04:02:27,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 04:02:27,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 04:02:27,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:27,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 04:02:27,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 04:02:27,662 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 04:02:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:27,773 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2022-01-10 04:02:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 04:02:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 04:02:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:27,774 INFO L225 Difference]: With dead ends: 48 [2022-01-10 04:02:27,774 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 04:02:27,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 04:02:27,775 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:27,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 14 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 04:02:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 04:02:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-01-10 04:02:27,779 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 04:02:27,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 04:02:27,780 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2022-01-10 04:02:27,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:27,780 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 04:02:27,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 04:02:27,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 04:02:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 04:02:27,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:27,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:27,789 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 04:02:27,987 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 04:02:27,988 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:27,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:27,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1242970242, now seen corresponding path program 1 times [2022-01-10 04:02:27,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:27,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21151890] [2022-01-10 04:02:27,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:02:27,989 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:27,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:27,990 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 04:02:27,992 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 04:02:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:02:28,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 04:02:28,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:28,084 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 11 treesize of output 9 [2022-01-10 04:02:28,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-10 04:02:28,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:02:28,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2022-01-10 04:02:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:02:28,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:28,368 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_32 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_32) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:02:28,394 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 04:02:28,394 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-10 04:02:28,404 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 04:02:28,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-01-10 04:02:28,412 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 14 treesize of output 7 [2022-01-10 04:02:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 04:02:28,467 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:28,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21151890] [2022-01-10 04:02:28,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21151890] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:28,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:28,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2022-01-10 04:02:28,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239561512] [2022-01-10 04:02:28,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:28,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 04:02:28,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:28,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 04:02:28,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2022-01-10 04:02:28,469 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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) [2022-01-10 04:02:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:28,981 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-01-10 04:02:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 04:02:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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) Word has length 21 [2022-01-10 04:02:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:28,984 INFO L225 Difference]: With dead ends: 58 [2022-01-10 04:02:28,984 INFO L226 Difference]: Without dead ends: 56 [2022-01-10 04:02:28,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=241, Unknown=1, NotChecked=32, Total=342 [2022-01-10 04:02:28,985 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:28,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 177 Invalid, 0 Unknown, 34 Unchecked, 0.3s Time] [2022-01-10 04:02:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-10 04:02:28,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2022-01-10 04:02:28,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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 04:02:28,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-01-10 04:02:28,992 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 21 [2022-01-10 04:02:28,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:28,992 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-01-10 04:02:28,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 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) [2022-01-10 04:02:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-01-10 04:02:28,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 04:02:28,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:28,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:29,002 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 04:02:29,193 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 04:02:29,194 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 532037120, now seen corresponding path program 1 times [2022-01-10 04:02:29,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:29,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801118199] [2022-01-10 04:02:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:02:29,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:29,210 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 04:02:29,214 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 04:02:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:02:29,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 04:02:29,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:29,356 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 11 treesize of output 9 [2022-01-10 04:02:29,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 04:02:29,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-10 04:02:29,583 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2022-01-10 04:02:29,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 10 [2022-01-10 04:02:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:02:29,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:35,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:02:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:02:35,195 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:35,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1801118199] [2022-01-10 04:02:35,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1801118199] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:35,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:35,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-01-10 04:02:35,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983720408] [2022-01-10 04:02:35,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:35,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 04:02:35,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:35,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 04:02:35,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=293, Unknown=2, NotChecked=0, Total=380 [2022-01-10 04:02:35,197 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 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 04:02:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:36,245 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-01-10 04:02:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 04:02:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 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 [2022-01-10 04:02:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:36,247 INFO L225 Difference]: With dead ends: 68 [2022-01-10 04:02:36,247 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 04:02:36,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=196, Invalid=614, Unknown=2, NotChecked=0, Total=812 [2022-01-10 04:02:36,249 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:36,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 78 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 136 Invalid, 0 Unknown, 37 Unchecked, 0.6s Time] [2022-01-10 04:02:36,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 04:02:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 46. [2022-01-10 04:02:36,259 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) [2022-01-10 04:02:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-01-10 04:02:36,262 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2022-01-10 04:02:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:36,262 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-01-10 04:02:36,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 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 04:02:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-01-10 04:02:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 04:02:36,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:36,263 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] [2022-01-10 04:02:36,272 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 04:02:36,463 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 04:02:36,463 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash 607460608, now seen corresponding path program 2 times [2022-01-10 04:02:36,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:36,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408301673] [2022-01-10 04:02:36,464 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 04:02:36,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:36,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:36,466 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 04:02:36,467 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 04:02:36,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 04:02:36,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:02:36,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 04:02:36,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 04:02:36,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 04:02:36,793 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:36,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408301673] [2022-01-10 04:02:36,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408301673] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:36,793 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:36,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2022-01-10 04:02:36,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827942423] [2022-01-10 04:02:36,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:36,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 04:02:36,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:36,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 04:02:36,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-10 04:02:36,794 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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) [2022-01-10 04:02:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:37,290 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2022-01-10 04:02:37,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 04:02:37,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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 23 [2022-01-10 04:02:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:37,291 INFO L225 Difference]: With dead ends: 92 [2022-01-10 04:02:37,291 INFO L226 Difference]: Without dead ends: 57 [2022-01-10 04:02:37,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2022-01-10 04:02:37,292 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 202 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:37,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 49 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 04:02:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-10 04:02:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-01-10 04:02:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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 04:02:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-01-10 04:02:37,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 23 [2022-01-10 04:02:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:37,297 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-01-10 04:02:37,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 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) [2022-01-10 04:02:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-01-10 04:02:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 04:02:37,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:37,298 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] [2022-01-10 04:02:37,307 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 04:02:37,498 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 04:02:37,499 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2059193154, now seen corresponding path program 2 times [2022-01-10 04:02:37,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:37,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361760312] [2022-01-10 04:02:37,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 04:02:37,500 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:37,501 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 04:02:37,502 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 04:02:37,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 04:02:37,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:02:37,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 04:02:37,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:37,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 04:02:37,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 04:02:37,977 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:37,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361760312] [2022-01-10 04:02:37,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361760312] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:37,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:37,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2022-01-10 04:02:37,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089994980] [2022-01-10 04:02:37,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:37,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 04:02:37,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:37,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 04:02:37,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-01-10 04:02:37,982 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 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) [2022-01-10 04:02:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:38,570 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2022-01-10 04:02:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 04:02:38,570 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 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) Word has length 23 [2022-01-10 04:02:38,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:38,571 INFO L225 Difference]: With dead ends: 113 [2022-01-10 04:02:38,571 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 04:02:38,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=628, Unknown=0, NotChecked=0, Total=870 [2022-01-10 04:02:38,572 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 350 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:38,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 65 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 04:02:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 04:02:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2022-01-10 04:02:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 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 04:02:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2022-01-10 04:02:38,580 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 23 [2022-01-10 04:02:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:38,580 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2022-01-10 04:02:38,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 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) [2022-01-10 04:02:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2022-01-10 04:02:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 04:02:38,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:38,581 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:38,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 04:02:38,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:02:38,793 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 943879772, now seen corresponding path program 3 times [2022-01-10 04:02:38,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:38,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702498687] [2022-01-10 04:02:38,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 04:02:38,794 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:38,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:38,796 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:02:38,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 04:02:38,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 04:02:38,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:02:38,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 04:02:38,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:38,901 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 11 treesize of output 9 [2022-01-10 04:02:38,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-10 04:02:38,968 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:02:38,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 04:02:38,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:02:39,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:02:39,064 INFO L353 Elim1Store]: treesize reduction 71, result has 4.1 percent of original size [2022-01-10 04:02:39,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 40 treesize of output 21 [2022-01-10 04:02:39,109 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:02:39,109 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-01-10 04:02:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 04:02:39,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:39,500 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_112) |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 04:02:39,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_109 (_ BitVec 32))) (= (select (select (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_109)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_112) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:02:39,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_112 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_109 (_ BitVec 32))) (= (select (select (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_109)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_112) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:02:39,582 INFO L353 Elim1Store]: treesize reduction 46, result has 38.7 percent of original size [2022-01-10 04:02:39,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2022-01-10 04:02:39,591 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 04:02:39,591 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-01-10 04:02:39,596 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 14 treesize of output 7 [2022-01-10 04:02:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-01-10 04:02:39,628 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:39,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702498687] [2022-01-10 04:02:39,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702498687] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:39,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:39,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-01-10 04:02:39,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911984532] [2022-01-10 04:02:39,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:39,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 04:02:39,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:39,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 04:02:39,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=224, Unknown=3, NotChecked=96, Total=380 [2022-01-10 04:02:39,630 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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 04:02:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:39,985 INFO L93 Difference]: Finished difference Result 87 states and 105 transitions. [2022-01-10 04:02:39,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 04:02:39,986 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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 28 [2022-01-10 04:02:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:39,986 INFO L225 Difference]: With dead ends: 87 [2022-01-10 04:02:39,986 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 04:02:39,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=279, Unknown=3, NotChecked=108, Total=462 [2022-01-10 04:02:39,987 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:39,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 98 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 146 Invalid, 0 Unknown, 182 Unchecked, 0.3s Time] [2022-01-10 04:02:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 04:02:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-01-10 04:02:39,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2337662337662338) internal successors, (95), 77 states have internal predecessors, (95), 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 04:02:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2022-01-10 04:02:39,996 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 28 [2022-01-10 04:02:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:39,996 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2022-01-10 04:02:39,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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 04:02:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2022-01-10 04:02:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 04:02:39,997 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:39,997 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:40,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 04:02:40,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:02:40,198 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:40,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:40,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1576080162, now seen corresponding path program 1 times [2022-01-10 04:02:40,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:40,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810251020] [2022-01-10 04:02:40,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:02:40,199 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:40,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:40,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:02:40,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 04:02:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:02:40,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 04:02:40,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:40,275 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 11 treesize of output 9 [2022-01-10 04:02:40,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 04:02:40,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 04:02:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 04:02:40,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:40,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_138 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-01-10 04:02:40,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-10 04:02:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2022-01-10 04:02:40,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:40,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810251020] [2022-01-10 04:02:40,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810251020] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:40,407 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:40,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-01-10 04:02:40,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712895159] [2022-01-10 04:02:40,407 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:40,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 04:02:40,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 04:02:40,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-01-10 04:02:40,408 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 04:02:40,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:40,498 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2022-01-10 04:02:40,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:02:40,499 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Word has length 28 [2022-01-10 04:02:40,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:40,500 INFO L225 Difference]: With dead ends: 120 [2022-01-10 04:02:40,500 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 04:02:40,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2022-01-10 04:02:40,500 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 28 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:40,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 60 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-01-10 04:02:40,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 04:02:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2022-01-10 04:02:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 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 04:02:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2022-01-10 04:02:40,509 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 28 [2022-01-10 04:02:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:40,509 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2022-01-10 04:02:40,509 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 04:02:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2022-01-10 04:02:40,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 04:02:40,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:40,510 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:40,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 04:02:40,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:02:40,717 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:40,717 INFO L85 PathProgramCache]: Analyzing trace with hash 550852762, now seen corresponding path program 2 times [2022-01-10 04:02:40,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:40,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758436021] [2022-01-10 04:02:40,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 04:02:40,718 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:40,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:40,729 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:02:40,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 04:02:40,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 04:02:40,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:02:40,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 04:02:40,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:40,814 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 11 treesize of output 9 [2022-01-10 04:02:40,860 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-01-10 04:02:40,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-10 04:02:40,887 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 04:02:40,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:40,908 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_159 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_159) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) |c_ULTIMATE.start_main_#t~mem11#1|)) is different from false [2022-01-10 04:02:40,912 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-10 04:02:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 1 not checked. [2022-01-10 04:02:40,958 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:40,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758436021] [2022-01-10 04:02:40,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758436021] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:40,958 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:40,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-01-10 04:02:40,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505936692] [2022-01-10 04:02:40,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:40,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 04:02:40,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:40,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 04:02:40,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2022-01-10 04:02:40,960 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 04:02:41,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:02:41,052 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2022-01-10 04:02:41,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 04:02:41,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Word has length 28 [2022-01-10 04:02:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:02:41,053 INFO L225 Difference]: With dead ends: 113 [2022-01-10 04:02:41,053 INFO L226 Difference]: Without dead ends: 92 [2022-01-10 04:02:41,054 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=36, Unknown=1, NotChecked=12, Total=72 [2022-01-10 04:02:41,054 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 04:02:41,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 32 Unchecked, 0.1s Time] [2022-01-10 04:02:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-01-10 04:02:41,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-01-10 04:02:41,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.1625) internal successors, (93), 80 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) [2022-01-10 04:02:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-01-10 04:02:41,067 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 28 [2022-01-10 04:02:41,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:02:41,068 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-01-10 04:02:41,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 04:02:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-01-10 04:02:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 04:02:41,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:02:41,070 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:02:41,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 04:02:41,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:02:41,279 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:02:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:02:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1969107172, now seen corresponding path program 3 times [2022-01-10 04:02:41,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:02:41,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028263753] [2022-01-10 04:02:41,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 04:02:41,280 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:02:41,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:02:41,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:02:41,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 04:02:41,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 04:02:41,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:02:41,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 04:02:41,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:02:41,432 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 11 treesize of output 9 [2022-01-10 04:02:41,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 04:02:41,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-10 04:02:41,579 INFO L353 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-01-10 04:02:41,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2022-01-10 04:02:41,864 INFO L353 Elim1Store]: treesize reduction 54, result has 1.8 percent of original size [2022-01-10 04:02:41,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 55 [2022-01-10 04:02:42,047 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 04:02:42,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 43 [2022-01-10 04:02:42,291 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 04:02:42,291 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 15 [2022-01-10 04:02:42,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:02:42,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:02:52,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:02:52,546 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 04:02:52,547 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 1 [2022-01-10 04:02:52,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:02:52,552 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:02:52,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028263753] [2022-01-10 04:02:52,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028263753] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:02:52,552 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:02:52,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2022-01-10 04:02:52,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969976093] [2022-01-10 04:02:52,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:02:52,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 04:02:52,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:02:52,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 04:02:52,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=830, Unknown=3, NotChecked=0, Total=992 [2022-01-10 04:02:52,554 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 32 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 04:03:03,555 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 04:03:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:03:08,292 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-01-10 04:03:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-10 04:03:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 28 [2022-01-10 04:03:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:03:08,294 INFO L225 Difference]: With dead ends: 107 [2022-01-10 04:03:08,294 INFO L226 Difference]: Without dead ends: 93 [2022-01-10 04:03:08,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=346, Invalid=1907, Unknown=3, NotChecked=0, Total=2256 [2022-01-10 04:03:08,295 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 73 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-01-10 04:03:08,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 94 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 292 Invalid, 1 Unknown, 63 Unchecked, 5.3s Time] [2022-01-10 04:03:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-01-10 04:03:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2022-01-10 04:03:08,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 83 states have internal predecessors, (96), 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 04:03:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2022-01-10 04:03:08,303 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 28 [2022-01-10 04:03:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:03:08,303 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2022-01-10 04:03:08,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 04:03:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2022-01-10 04:03:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 04:03:08,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:03:08,304 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:03:08,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 04:03:08,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:03:08,505 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:03:08,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:03:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1432341606, now seen corresponding path program 4 times [2022-01-10 04:03:08,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:03:08,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251937139] [2022-01-10 04:03:08,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 04:03:08,505 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:03:08,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:03:08,506 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:03:08,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 04:03:08,562 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 04:03:08,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:03:08,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-10 04:03:08,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:03:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 04:03:08,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:03:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 04:03:09,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:03:09,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251937139] [2022-01-10 04:03:09,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251937139] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:03:09,556 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:03:09,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2022-01-10 04:03:09,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934059094] [2022-01-10 04:03:09,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:03:09,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 04:03:09,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:03:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 04:03:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2022-01-10 04:03:09,558 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 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) [2022-01-10 04:03:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:03:11,096 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2022-01-10 04:03:11,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 04:03:11,096 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 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 30 [2022-01-10 04:03:11,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:03:11,097 INFO L225 Difference]: With dead ends: 216 [2022-01-10 04:03:11,097 INFO L226 Difference]: Without dead ends: 156 [2022-01-10 04:03:11,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=399, Invalid=1241, Unknown=0, NotChecked=0, Total=1640 [2022-01-10 04:03:11,098 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 539 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 04:03:11,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [539 Valid, 174 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 04:03:11,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-01-10 04:03:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 114. [2022-01-10 04:03:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.1238938053097345) internal successors, (127), 113 states have internal predecessors, (127), 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 04:03:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-01-10 04:03:11,107 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 30 [2022-01-10 04:03:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:03:11,107 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-01-10 04:03:11,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 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) [2022-01-10 04:03:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-01-10 04:03:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 04:03:11,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:03:11,108 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, 1, 1] [2022-01-10 04:03:11,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 04:03:11,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:03:11,315 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:03:11,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:03:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -736332014, now seen corresponding path program 1 times [2022-01-10 04:03:11,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:03:11,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140134916] [2022-01-10 04:03:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 04:03:11,316 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:03:11,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:03:11,317 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:03:11,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 04:03:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:03:11,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 04:03:11,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:03:11,421 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 11 treesize of output 9 [2022-01-10 04:03:11,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-10 04:03:11,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:03:11,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:03:11,646 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:03:11,647 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 04:03:11,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2022-01-10 04:03:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 04:03:11,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:03:12,532 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv1 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_236) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-01-10 04:03:12,573 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 04:03:12,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-01-10 04:03:12,588 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 04:03:12,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-01-10 04:03:12,594 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 14 treesize of output 7 [2022-01-10 04:03:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-01-10 04:03:12,652 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:03:12,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140134916] [2022-01-10 04:03:12,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140134916] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:03:12,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:03:12,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2022-01-10 04:03:12,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421160890] [2022-01-10 04:03:12,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:03:12,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 04:03:12,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:03:12,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 04:03:12,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2022-01-10 04:03:12,654 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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) [2022-01-10 04:03:14,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:03:14,666 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2022-01-10 04:03:14,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 04:03:14,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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 32 [2022-01-10 04:03:14,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:03:14,668 INFO L225 Difference]: With dead ends: 150 [2022-01-10 04:03:14,668 INFO L226 Difference]: Without dead ends: 127 [2022-01-10 04:03:14,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=146, Invalid=727, Unknown=1, NotChecked=56, Total=930 [2022-01-10 04:03:14,669 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 04:03:14,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 145 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 249 Invalid, 0 Unknown, 63 Unchecked, 0.9s Time] [2022-01-10 04:03:14,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-01-10 04:03:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 111. [2022-01-10 04:03:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 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 04:03:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-01-10 04:03:14,694 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 32 [2022-01-10 04:03:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:03:14,694 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-01-10 04:03:14,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 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) [2022-01-10 04:03:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-01-10 04:03:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 04:03:14,694 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:03:14,694 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:03:14,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-01-10 04:03:14,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:03:14,895 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:03:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:03:14,895 INFO L85 PathProgramCache]: Analyzing trace with hash 651947656, now seen corresponding path program 5 times [2022-01-10 04:03:14,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:03:14,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205664684] [2022-01-10 04:03:14,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 04:03:14,896 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:03:14,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:03:14,897 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:03:14,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 04:03:15,152 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-10 04:03:15,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:03:15,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-10 04:03:15,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:03:15,238 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 11 treesize of output 9 [2022-01-10 04:03:15,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 04:03:15,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-10 04:03:15,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:15,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-01-10 04:03:15,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:15,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:15,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:15,714 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 52 treesize of output 57 [2022-01-10 04:03:16,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:16,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2022-01-10 04:03:16,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,476 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:16,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 62 [2022-01-10 04:03:16,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:16,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 59 [2022-01-10 04:03:17,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 76 [2022-01-10 04:03:17,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:17,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:17,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 04:03:17,214 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 70 treesize of output 35 [2022-01-10 04:03:17,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 04:03:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 04:03:17,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:03:17,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_281 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) is different from false [2022-01-10 04:03:17,807 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_281 (Array (_ BitVec 64) (_ BitVec 32)))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd (select (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|)) (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-10 04:03:17,838 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_281 (Array (_ BitVec 64) (_ BitVec 32)))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (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|)))) (bvadd .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse1 .cse2))) |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|)) .cse2))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-10 04:03:17,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_281 (Array (_ BitVec 64) (_ BitVec 32)))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select (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|))) (.cse2 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (bvadd .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) |c_ULTIMATE.start_main_~a~0#1.offset|))))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-10 04:03:17,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_281 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse3 (select (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|)))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse1 .cse3))) |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|)))) (bvadd .cse1 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) c_~N~0)) is different from false [2022-01-10 04:03:17,961 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_281 (Array (_ BitVec 64) (_ BitVec 32)))) (= c_~N~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|))) (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse2 (select (select |c_#memory_int| |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|)))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse1 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (bvadd .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| (bvadd .cse1 .cse2 .cse3))) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (_ bv2 32))) |c_ULTIMATE.start_main_~a~0#1.offset|)) .cse2 .cse3)))))) |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_281) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) is different from false [2022-01-10 04:03:23,498 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,503 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 04:03:23,508 INFO L353 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2022-01-10 04:03:23,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 131 treesize of output 1 [2022-01-10 04:03:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2022-01-10 04:03:23,514 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:03:23,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205664684] [2022-01-10 04:03:23,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205664684] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:03:23,514 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:03:23,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2022-01-10 04:03:23,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986303314] [2022-01-10 04:03:23,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:03:23,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-10 04:03:23,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:03:23,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-10 04:03:23,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=838, Unknown=11, NotChecked=390, Total=1406 [2022-01-10 04:03:23,515 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 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 04:03:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:03:26,488 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-01-10 04:03:26,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 04:03:26,490 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 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 35 [2022-01-10 04:03:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:03:26,491 INFO L225 Difference]: With dead ends: 136 [2022-01-10 04:03:26,491 INFO L226 Difference]: Without dead ends: 115 [2022-01-10 04:03:26,491 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=281, Invalid=1538, Unknown=11, NotChecked=522, Total=2352 [2022-01-10 04:03:26,492 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 04:03:26,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 125 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 190 Invalid, 0 Unknown, 386 Unchecked, 0.4s Time] [2022-01-10 04:03:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-01-10 04:03:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-01-10 04:03:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 113 states have internal predecessors, (128), 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 04:03:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2022-01-10 04:03:26,502 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 35 [2022-01-10 04:03:26,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:03:26,502 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2022-01-10 04:03:26,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 38 states have internal predecessors, (58), 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 04:03:26,502 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2022-01-10 04:03:26,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 04:03:26,502 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:03:26,502 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:03:26,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 04:03:26,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:03:26,711 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:03:26,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:03:26,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1015472054, now seen corresponding path program 6 times [2022-01-10 04:03:26,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:03:26,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477241597] [2022-01-10 04:03:26,711 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 04:03:26,712 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:03:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:03:26,713 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:03:26,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 04:03:26,821 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-01-10 04:03:26,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:03:26,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 04:03:26,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:03:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:03:27,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:03:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 04:03:28,013 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:03:28,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477241597] [2022-01-10 04:03:28,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477241597] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:03:28,013 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:03:28,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2022-01-10 04:03:28,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124179339] [2022-01-10 04:03:28,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:03:28,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 04:03:28,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:03:28,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 04:03:28,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2022-01-10 04:03:28,014 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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 04:03:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:03:29,765 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2022-01-10 04:03:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 04:03:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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 37 [2022-01-10 04:03:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:03:29,766 INFO L225 Difference]: With dead ends: 165 [2022-01-10 04:03:29,766 INFO L226 Difference]: Without dead ends: 126 [2022-01-10 04:03:29,766 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=388, Invalid=1334, Unknown=0, NotChecked=0, Total=1722 [2022-01-10 04:03:29,767 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 321 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 04:03:29,767 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [321 Valid, 189 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 04:03:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-01-10 04:03:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 96. [2022-01-10 04:03:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.0947368421052632) internal successors, (104), 95 states have internal predecessors, (104), 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 04:03:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-01-10 04:03:29,776 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 37 [2022-01-10 04:03:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:03:29,776 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-01-10 04:03:29,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.5185185185185186) internal successors, (68), 27 states have internal predecessors, (68), 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 04:03:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-01-10 04:03:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 04:03:29,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:03:29,778 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:03:29,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 04:03:29,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:03:29,984 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:03:29,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:03:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1261480172, now seen corresponding path program 4 times [2022-01-10 04:03:29,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:03:29,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841241724] [2022-01-10 04:03:29,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 04:03:29,984 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:03:29,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:03:29,987 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:03:30,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 04:03:30,148 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 04:03:30,148 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 04:03:30,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-10 04:03:30,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:03:30,172 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 11 treesize of output 9 [2022-01-10 04:03:30,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-10 04:03:30,268 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:03:30,268 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 04:03:30,332 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:03:30,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 04:03:30,392 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:03:30,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2022-01-10 04:03:30,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:03:30,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:03:30,472 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:03:30,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-10 04:03:30,544 INFO L353 Elim1Store]: treesize reduction 71, result has 4.1 percent of original size [2022-01-10 04:03:30,544 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 40 treesize of output 21 [2022-01-10 04:03:30,628 INFO L353 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-01-10 04:03:30,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-01-10 04:03:30,696 INFO L353 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-01-10 04:03:30,696 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2022-01-10 04:03:30,758 INFO L353 Elim1Store]: treesize reduction 42, result has 22.2 percent of original size [2022-01-10 04:03:30,758 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-01-10 04:03:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 04:03:30,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 04:03:32,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:03:32,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv1 32) (select (select (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_348)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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 04:03:32,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (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_348)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:03:32,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_346 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (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_346) (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_348)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:03:32,370 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_346 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (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_346) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_348)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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 04:03:32,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_346 (_ BitVec 32)) (v_ArrVal_343 (_ BitVec 32))) (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (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_343) (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_346) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_348)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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 04:03:32,412 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (_ BitVec 32)) (v_ArrVal_352 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_346 (_ BitVec 32)) (v_ArrVal_343 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (store (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_343) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|))) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_346) (bvadd (bvmul (_ bv4 64) ((_ sign_extend 32) (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|))) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_348)) |c_ULTIMATE.start_main_~#sum~0#1.base| v_ArrVal_352) |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|)) (_ bv1 32))) is different from false [2022-01-10 04:03:32,603 INFO L353 Elim1Store]: treesize reduction 357, result has 14.2 percent of original size [2022-01-10 04:03:32,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 74 [2022-01-10 04:03:32,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 04:03:32,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2022-01-10 04:03:32,622 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 14 treesize of output 7 [2022-01-10 04:03:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 23 not checked. [2022-01-10 04:03:32,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 04:03:32,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841241724] [2022-01-10 04:03:32,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841241724] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 04:03:32,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 04:03:32,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21] total 32 [2022-01-10 04:03:32,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771951578] [2022-01-10 04:03:32,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 04:03:32,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 04:03:32,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 04:03:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 04:03:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=501, Unknown=7, NotChecked=364, Total=992 [2022-01-10 04:03:32,667 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 32 states, 32 states have (on average 2.0625) internal successors, (66), 32 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 04:03:33,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 04:03:33,416 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2022-01-10 04:03:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 04:03:33,416 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 32 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) Word has length 42 [2022-01-10 04:03:33,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 04:03:33,417 INFO L225 Difference]: With dead ends: 116 [2022-01-10 04:03:33,417 INFO L226 Difference]: Without dead ends: 114 [2022-01-10 04:03:33,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 17 SemanticMatches, 32 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=134, Invalid=589, Unknown=7, NotChecked=392, Total=1122 [2022-01-10 04:03:33,417 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 04:03:33,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 109 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 237 Invalid, 0 Unknown, 420 Unchecked, 0.5s Time] [2022-01-10 04:03:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-01-10 04:03:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-01-10 04:03:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.1047619047619048) internal successors, (116), 105 states have internal predecessors, (116), 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 04:03:33,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-01-10 04:03:33,427 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 42 [2022-01-10 04:03:33,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 04:03:33,427 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-01-10 04:03:33,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0625) internal successors, (66), 32 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 04:03:33,427 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-01-10 04:03:33,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 04:03:33,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 04:03:33,427 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 04:03:33,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 04:03:33,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 04:03:33,636 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 04:03:33,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 04:03:33,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1487374188, now seen corresponding path program 7 times [2022-01-10 04:03:33,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 04:03:33,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881817980] [2022-01-10 04:03:33,638 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 04:03:33,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 04:03:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 04:03:33,639 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 04:03:33,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 04:03:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 04:03:33,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-10 04:03:33,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 04:03:33,888 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 11 treesize of output 9 [2022-01-10 04:03:33,894 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 04:03:33,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-10 04:03:34,071 INFO L353 Elim1Store]: treesize reduction 48, result has 22.6 percent of original size [2022-01-10 04:03:34,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 40 [2022-01-10 04:03:34,310 INFO L353 Elim1Store]: treesize reduction 116, result has 20.0 percent of original size [2022-01-10 04:03:34,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-01-10 04:03:34,668 INFO L353 Elim1Store]: treesize reduction 207, result has 17.2 percent of original size [2022-01-10 04:03:34,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 74 [2022-01-10 04:03:35,467 INFO L353 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2022-01-10 04:03:35,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 82 treesize of output 85 [2022-01-10 04:03:35,914 INFO L353 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2022-01-10 04:03:35,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 91 treesize of output 85 [2022-01-10 04:03:36,418 INFO L353 Elim1Store]: treesize reduction 180, result has 0.6 percent of original size [2022-01-10 04:03:36,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 104 treesize of output 89 [2022-01-10 04:03:37,287 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-01-10 04:03:37,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 103 treesize of output 76 [2022-01-10 04:03:37,945 INFO L353 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-01-10 04:03:37,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 29 [2022-01-10 04:03:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 04:03:38,095 INFO L328 TraceCheckSpWp]: Computing backward predicates...