/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/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:01:56,484 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:01:56,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:01:56,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:01:56,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:01:56,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:01:56,540 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:01:56,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:01:56,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:01:56,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:01:56,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:01:56,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:01:56,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:01:56,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:01:56,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:01:56,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:01:56,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:01:56,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:01:56,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:01:56,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:01:56,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:01:56,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:01:56,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:01:56,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:01:56,566 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:01:56,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:01:56,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:01:56,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:01:56,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:01:56,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:01:56,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:01:56,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:01:56,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:01:56,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:01:56,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:01:56,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:01:56,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:01:56,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:01:56,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:01:56,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:01:56,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:01:56,576 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 06:01:56,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:01:56,607 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:01:56,608 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:01:56,608 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:01:56,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:01:56,610 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:01:56,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:01:56,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:01:56,612 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:01:56,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:01:56,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:01:56,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:01:56,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:01:56,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:01:56,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:01:56,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:01:56,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:01:56,615 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:01:56,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:01:56,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:01:56,616 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:01:56,616 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 06:01:56,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:01:56,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:01:56,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:01:56,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:01:56,841 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:01:56,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 06:01:56,910 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b151d3404/85713e53f0a44513b42a04e65e2f434c/FLAGbc62c6870 [2022-01-10 06:01:57,249 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:01:57,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 06:01:57,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b151d3404/85713e53f0a44513b42a04e65e2f434c/FLAGbc62c6870 [2022-01-10 06:01:57,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b151d3404/85713e53f0a44513b42a04e65e2f434c [2022-01-10 06:01:57,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:01:57,665 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:01:57,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:01:57,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:01:57,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:01:57,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:01:57" (1/1) ... [2022-01-10 06:01:57,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0c13e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:57, skipping insertion in model container [2022-01-10 06:01:57,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:01:57" (1/1) ... [2022-01-10 06:01:57,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:01:57,759 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:01:58,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 06:01:58,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:01:58,347 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:01:58,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 06:01:58,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:01:58,480 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:01:58,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58 WrapperNode [2022-01-10 06:01:58,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:01:58,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:01:58,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:01:58,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:01:58,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,549 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,590 INFO L137 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 104 [2022-01-10 06:01:58,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:01:58,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:01:58,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:01:58,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:01:58,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:01:58,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:01:58,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:01:58,657 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:01:58,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (1/1) ... [2022-01-10 06:01:58,683 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:01:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:01:58,717 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 06:01:58,723 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 06:01:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-01-10 06:01:58,771 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-01-10 06:01:58,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:01:58,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:01:58,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:01:58,879 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:01:58,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:01:58,916 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-01-10 06:01:59,132 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:01:59,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:01:59,137 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 06:01:59,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:59 BoogieIcfgContainer [2022-01-10 06:01:59,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:01:59,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:01:59,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:01:59,143 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:01:59,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:01:57" (1/3) ... [2022-01-10 06:01:59,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d0dc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:59, skipping insertion in model container [2022-01-10 06:01:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:01:58" (2/3) ... [2022-01-10 06:01:59,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d0dc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:01:59, skipping insertion in model container [2022-01-10 06:01:59,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:01:59" (3/3) ... [2022-01-10 06:01:59,149 INFO L111 eAbstractionObserver]: Analyzing ICFG splice-2.i [2022-01-10 06:01:59,153 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:01:59,154 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:01:59,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:01:59,201 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 06:01:59,201 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:01:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 28 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:01:59,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 06:01:59,217 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:59,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:59,219 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1688859855, now seen corresponding path program 1 times [2022-01-10 06:01:59,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:59,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421485597] [2022-01-10 06:01:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:59,235 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:59,237 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 06:01:59,250 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 06:01:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:59,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:01:59,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:59,399 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 06:01:59,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:01:59,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:59,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421485597] [2022-01-10 06:01:59,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421485597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:01:59,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:01:59,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:01:59,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175582923] [2022-01-10 06:01:59,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:01:59,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:01:59,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:59,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:01:59,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:01:59,438 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 28 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 06:01:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:59,456 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-01-10 06:01:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:01:59,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-01-10 06:01:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:59,467 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:01:59,467 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 06:01:59,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 06:01:59,473 INFO L933 BasicCegarLoop]: 39 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, 39 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 06:01:59,475 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:01:59,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 06:01:59,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 06:01:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 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 06:01:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-10 06:01:59,507 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2022-01-10 06:01:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:59,507 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-10 06:01:59,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 06:01:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-10 06:01:59,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 06:01:59,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:59,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:59,530 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 06:01:59,719 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 06:01:59,719 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:01:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:01:59,722 INFO L85 PathProgramCache]: Analyzing trace with hash 431515036, now seen corresponding path program 1 times [2022-01-10 06:01:59,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:01:59,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42211734] [2022-01-10 06:01:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:01:59,725 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:01:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:01:59,737 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 06:01:59,766 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 06:01:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:01:59,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 06:01:59,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:01:59,890 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 06:01:59,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:01:59,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:01:59,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42211734] [2022-01-10 06:01:59,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42211734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:01:59,891 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:01:59,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:01:59,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829245945] [2022-01-10 06:01:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:01:59,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:01:59,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:01:59,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:01:59,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:01:59,893 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 06:01:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:01:59,973 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-01-10 06:01:59,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:01:59,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-01-10 06:01:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:01:59,975 INFO L225 Difference]: With dead ends: 43 [2022-01-10 06:01:59,975 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 06:01:59,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:01:59,976 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:01:59,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 53 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:01:59,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 06:01:59,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-01-10 06:01:59,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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 06:01:59,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-01-10 06:01:59,980 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 13 [2022-01-10 06:01:59,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:01:59,980 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-01-10 06:01:59,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 06:01:59,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-01-10 06:01:59,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 06:01:59,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:01:59,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:01:59,993 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 06:02:00,189 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 06:02:00,189 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:00,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash 172969064, now seen corresponding path program 1 times [2022-01-10 06:02:00,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:00,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101573494] [2022-01-10 06:02:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:00,190 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:00,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:00,192 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 06:02:00,193 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 06:02:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:00,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:02:00,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:00,310 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 06:02:00,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:00,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:00,323 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:00,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101573494] [2022-01-10 06:02:00,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101573494] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:00,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:00,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 06:02:00,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474692285] [2022-01-10 06:02:00,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:00,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 06:02:00,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:00,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 06:02:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:02:00,325 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:00,405 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-01-10 06:02:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:02:00,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 06:02:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:00,407 INFO L225 Difference]: With dead ends: 33 [2022-01-10 06:02:00,407 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 06:02:00,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:02:00,408 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:00,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:02:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 06:02:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 06:02:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:00,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-01-10 06:02:00,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 18 [2022-01-10 06:02:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:00,411 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-01-10 06:02:00,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-01-10 06:02:00,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 06:02:00,412 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:00,412 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:00,421 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 06:02:00,619 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 06:02:00,619 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:00,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:00,620 INFO L85 PathProgramCache]: Analyzing trace with hash -181626980, now seen corresponding path program 1 times [2022-01-10 06:02:00,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:00,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397755540] [2022-01-10 06:02:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:00,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:00,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:00,622 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 06:02:00,624 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 06:02:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:00,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 06:02:00,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:00,802 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:02:00,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:00,915 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 21 treesize of output 20 [2022-01-10 06:02:00,994 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 06:02:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 06:02:01,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:01,260 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:02:01,261 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 28 treesize of output 30 [2022-01-10 06:02:01,358 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:02:01,359 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 22 treesize of output 14 [2022-01-10 06:02:01,380 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 06:02:01,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:03,526 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~p~0#1.base| (_ BitVec 64))) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv3 32))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= .cse0 (_ bv1 32))))) is different from false [2022-01-10 06:02:05,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_71 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_29| (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_71)))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) is different from false [2022-01-10 06:02:07,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_71 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_29| (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_71)))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29|) (_ bv0 64) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) is different from false [2022-01-10 06:02:07,665 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 245 treesize of output 237 [2022-01-10 06:02:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 06:02:08,128 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:08,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397755540] [2022-01-10 06:02:08,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397755540] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:08,128 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:08,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-01-10 06:02:08,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331783309] [2022-01-10 06:02:08,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:08,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 06:02:08,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 06:02:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=222, Unknown=3, NotChecked=96, Total=380 [2022-01-10 06:02:08,130 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:10,253 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (forall ((v_ArrVal_71 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_29| (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_71)))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29|) (_ bv0 64) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32)) (= (_ bv0 64) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) is different from false [2022-01-10 06:02:12,324 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_71 (_ BitVec 32)) (|v_ULTIMATE.start_main_~p~0#1.base_29| (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_71)))) (store .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29| (store (select .cse1 |v_ULTIMATE.start_main_~p~0#1.base_29|) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= .cse0 (_ bv3 32))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32)) (= (_ bv0 64) |c_ULTIMATE.start_main_~t~0#1.offset|) (= (_ bv0 64) |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) is different from false [2022-01-10 06:02:14,349 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~p~0#1.base| (_ BitVec 64))) (let ((.cse0 (select (select (store |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv3 32))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= .cse0 (_ bv1 32))))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv0 64)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv0 64) |c_ULTIMATE.start_main_~a~0#1.offset|)) is different from false [2022-01-10 06:02:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:14,650 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-01-10 06:02:14,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:02:14,651 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 06:02:14,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:14,651 INFO L225 Difference]: With dead ends: 55 [2022-01-10 06:02:14,651 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 06:02:14,652 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=71, Invalid=253, Unknown=6, NotChecked=222, Total=552 [2022-01-10 06:02:14,652 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:14,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 167 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2022-01-10 06:02:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 06:02:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-01-10 06:02:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 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 06:02:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-01-10 06:02:14,657 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 21 [2022-01-10 06:02:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:14,657 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-01-10 06:02:14,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-01-10 06:02:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 06:02:14,658 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:14,658 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:14,686 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 06:02:14,888 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 06:02:14,889 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:14,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1593380382, now seen corresponding path program 1 times [2022-01-10 06:02:14,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:14,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [577293937] [2022-01-10 06:02:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:14,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:14,890 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 06:02:14,892 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 06:02:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:15,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:02:15,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:15,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:15,122 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:15,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [577293937] [2022-01-10 06:02:15,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [577293937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:15,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:15,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:02:15,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434966448] [2022-01-10 06:02:15,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:15,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:02:15,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:02:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:02:15,124 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 06:02:15,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:15,198 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-01-10 06:02:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:02:15,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 06:02:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:15,200 INFO L225 Difference]: With dead ends: 78 [2022-01-10 06:02:15,200 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 06:02:15,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:02:15,201 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:15,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:02:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 06:02:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2022-01-10 06:02:15,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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 06:02:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-01-10 06:02:15,206 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 21 [2022-01-10 06:02:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:15,206 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-01-10 06:02:15,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 06:02:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-01-10 06:02:15,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 06:02:15,206 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:15,206 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:15,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 06:02:15,416 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 06:02:15,416 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:15,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1548455633, now seen corresponding path program 1 times [2022-01-10 06:02:15,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:15,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223290002] [2022-01-10 06:02:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:15,417 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:15,418 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 06:02:15,420 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 06:02:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:15,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 06:02:15,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:15,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:15,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:15,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:15,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223290002] [2022-01-10 06:02:15,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [223290002] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:15,862 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:15,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-01-10 06:02:15,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795275253] [2022-01-10 06:02:15,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:15,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:02:15,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:02:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:02:15,864 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:16,309 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-01-10 06:02:16,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 06:02:16,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 06:02:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:16,313 INFO L225 Difference]: With dead ends: 84 [2022-01-10 06:02:16,313 INFO L226 Difference]: Without dead ends: 79 [2022-01-10 06:02:16,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-01-10 06:02:16,314 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:16,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 69 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:02:16,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-10 06:02:16,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 56. [2022-01-10 06:02:16,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 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 06:02:16,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-01-10 06:02:16,321 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 23 [2022-01-10 06:02:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:16,321 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-01-10 06:02:16,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-01-10 06:02:16,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 06:02:16,322 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:16,322 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 06:02:16,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:02:16,534 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 06:02:16,534 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1550165655, now seen corresponding path program 1 times [2022-01-10 06:02:16,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:16,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877584991] [2022-01-10 06:02:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:16,536 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:16,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:16,537 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 06:02:16,538 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 06:02:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:16,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 06:02:16,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:16,689 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:02:16,701 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:02:16,829 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 19 treesize of output 7 [2022-01-10 06:02:16,835 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 19 treesize of output 7 [2022-01-10 06:02:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:16,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:16,980 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:16,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877584991] [2022-01-10 06:02:16,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877584991] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:16,980 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:16,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-01-10 06:02:16,981 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668797993] [2022-01-10 06:02:16,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:16,981 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:02:16,981 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:02:16,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:02:16,982 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:17,336 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2022-01-10 06:02:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 06:02:17,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 06:02:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:17,339 INFO L225 Difference]: With dead ends: 74 [2022-01-10 06:02:17,339 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 06:02:17,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:02:17,340 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 13 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:17,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 06:02:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 06:02:17,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2022-01-10 06:02:17,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 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 06:02:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-01-10 06:02:17,368 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 23 [2022-01-10 06:02:17,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:17,368 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-01-10 06:02:17,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:02:17,369 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-01-10 06:02:17,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 06:02:17,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:17,370 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:17,389 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 06:02:17,579 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 06:02:17,580 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1667174376, now seen corresponding path program 2 times [2022-01-10 06:02:17,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:17,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253011454] [2022-01-10 06:02:17,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:02:17,581 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:17,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:17,583 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 06:02:17,584 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 06:02:17,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:02:17,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:02:17,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 06:02:17,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:02:17,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:17,715 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:17,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253011454] [2022-01-10 06:02:17,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253011454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:17,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:17,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:02:17,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030552262] [2022-01-10 06:02:17,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:17,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:02:17,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:02:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:02:17,717 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 06:02:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:17,764 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-01-10 06:02:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:02:17,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 06:02:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:17,769 INFO L225 Difference]: With dead ends: 110 [2022-01-10 06:02:17,769 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 06:02:17,770 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:02:17,771 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:17,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:02:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 06:02:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2022-01-10 06:02:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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 06:02:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-01-10 06:02:17,801 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 24 [2022-01-10 06:02:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:17,801 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-01-10 06:02:17,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 06:02:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-01-10 06:02:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 06:02:17,802 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:17,802 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:17,813 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 06:02:18,011 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 06:02:18,012 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:18,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:18,012 INFO L85 PathProgramCache]: Analyzing trace with hash -852785558, now seen corresponding path program 1 times [2022-01-10 06:02:18,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:18,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099211307] [2022-01-10 06:02:18,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:18,013 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:18,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:18,014 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 06:02:18,016 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 06:02:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:18,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 06:02:18,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:18,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:02:18,297 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:02:18,297 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 06:02:18,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:02:18,517 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:02:18,518 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-01-10 06:02:18,527 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 42 treesize of output 44 [2022-01-10 06:02:18,538 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 29 treesize of output 19 [2022-01-10 06:02:18,703 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 39 treesize of output 21 [2022-01-10 06:02:18,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2022-01-10 06:02:18,772 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 06:02:18,819 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 06:02:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:02:18,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:18,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv3 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_242) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))) is different from false [2022-01-10 06:02:18,919 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 32)))) (= (_ bv3 32) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_242) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0))))) is different from false [2022-01-10 06:02:18,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_242 (Array (_ BitVec 64) (_ BitVec 32)))) (= (let ((.cse0 (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_242) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (_ bv3 32))) is different from false [2022-01-10 06:02:18,964 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:18,964 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 36 treesize of output 37 [2022-01-10 06:02:18,994 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:18,995 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 75 treesize of output 78 [2022-01-10 06:02:19,007 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 27 treesize of output 16 [2022-01-10 06:02:19,173 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_238 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_238) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_241 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_241) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|)) |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_241 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_241) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-01-10 06:02:19,255 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:19,255 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 23 treesize of output 24 [2022-01-10 06:02:19,292 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:19,293 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 39 treesize of output 42 [2022-01-10 06:02:19,319 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 22 treesize of output 18 [2022-01-10 06:02:19,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:02:19,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:19,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-01-10 06:02:19,431 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-01-10 06:02:19,431 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-01-10 06:02:19,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 06:02:19,650 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:19,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099211307] [2022-01-10 06:02:19,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099211307] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:19,650 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:19,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2022-01-10 06:02:19,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544804504] [2022-01-10 06:02:19,650 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:19,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 06:02:19,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:19,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 06:02:19,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=111, Unknown=4, NotChecked=92, Total=240 [2022-01-10 06:02:19,651 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 06:02:22,059 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 06:02:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:22,413 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-01-10 06:02:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:02:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 24 [2022-01-10 06:02:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:22,415 INFO L225 Difference]: With dead ends: 83 [2022-01-10 06:02:22,415 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 06:02:22,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=151, Unknown=4, NotChecked=108, Total=306 [2022-01-10 06:02:22,416 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:22,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 1 Unknown, 147 Unchecked, 2.5s Time] [2022-01-10 06:02:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 06:02:22,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-01-10 06:02:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 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 06:02:22,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2022-01-10 06:02:22,420 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 24 [2022-01-10 06:02:22,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:22,420 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2022-01-10 06:02:22,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 16 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 06:02:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2022-01-10 06:02:22,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 06:02:22,420 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:22,421 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:22,435 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 06:02:22,633 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 06:02:22,633 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -646132980, now seen corresponding path program 1 times [2022-01-10 06:02:22,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282915850] [2022-01-10 06:02:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:22,634 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:22,635 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 06:02:22,637 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 06:02:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:22,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:02:22,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 06:02:22,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:02:22,982 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:22,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282915850] [2022-01-10 06:02:22,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282915850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:02:22,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:02:22,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:02:22,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15305779] [2022-01-10 06:02:22,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:02:22,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:02:22,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:02:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:02:22,984 INFO L87 Difference]: Start difference. First operand 60 states and 70 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 06:02:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:23,107 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2022-01-10 06:02:23,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:02:23,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 06:02:23,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:23,108 INFO L225 Difference]: With dead ends: 68 [2022-01-10 06:02:23,108 INFO L226 Difference]: Without dead ends: 51 [2022-01-10 06:02:23,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:02:23,109 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:23,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:02:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-10 06:02:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-01-10 06:02:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1875) internal successors, (57), 48 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 06:02:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-01-10 06:02:23,112 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 25 [2022-01-10 06:02:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:23,112 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-01-10 06:02:23,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 06:02:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-01-10 06:02:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 06:02:23,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:23,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:23,132 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 06:02:23,331 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 06:02:23,332 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:23,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1428794918, now seen corresponding path program 1 times [2022-01-10 06:02:23,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:23,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477916830] [2022-01-10 06:02:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:23,333 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:23,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:23,335 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 06:02:23,336 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 06:02:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:23,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-10 06:02:23,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:23,480 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:02:23,560 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:02:23,598 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:02:23,598 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 06:02:23,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:23,679 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 06:02:23,728 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 06:02:23,822 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 06:02:23,902 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 06:02:23,902 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 19 treesize of output 22 [2022-01-10 06:02:24,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:24,170 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:02:24,171 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 28 treesize of output 30 [2022-01-10 06:02:24,322 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:02:24,322 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 22 treesize of output 14 [2022-01-10 06:02:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:02:24,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:24,735 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_322 (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_321))) (store .cse1 v_ArrVal_322 (store (select .cse1 v_ArrVal_322) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= (_ bv3 32) .cse0)))) is different from false [2022-01-10 06:02:24,784 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_322 (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_321))) (store .cse1 v_ArrVal_322 (store (select .cse1 v_ArrVal_322) (_ bv0 64) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv1 32) .cse0)))) is different from false [2022-01-10 06:02:24,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_319 (_ BitVec 32)) (v_ArrVal_322 (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_319)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_321))) (store .cse1 v_ArrVal_322 (store (select .cse1 v_ArrVal_322) (_ bv0 64) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv1 32) .cse0)))) is different from false [2022-01-10 06:02:25,203 INFO L353 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-01-10 06:02:25,204 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 95 treesize of output 61 [2022-01-10 06:02:25,265 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:25,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 273 [2022-01-10 06:02:25,286 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 257 treesize of output 241 [2022-01-10 06:02:25,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 66 treesize of output 62 [2022-01-10 06:02:25,539 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 82 treesize of output 76 [2022-01-10 06:02:25,886 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 82 treesize of output 76 [2022-01-10 06:02:26,273 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 82 treesize of output 76 [2022-01-10 06:02:26,576 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 82 treesize of output 76 [2022-01-10 06:02:26,703 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 66 treesize of output 62 [2022-01-10 06:02:26,831 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 66 treesize of output 62 [2022-01-10 06:02:27,514 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 6 treesize of output 4 [2022-01-10 06:02:27,577 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:27,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 29 [2022-01-10 06:02:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-10 06:02:30,616 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:02:30,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477916830] [2022-01-10 06:02:30,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477916830] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:02:30,616 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:02:30,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2022-01-10 06:02:30,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291855585] [2022-01-10 06:02:30,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:02:30,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 06:02:30,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:02:30,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 06:02:30,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=387, Unknown=9, NotChecked=126, Total=600 [2022-01-10 06:02:30,617 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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 06:02:30,893 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_322 (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_321))) (store .cse1 v_ArrVal_322 (store (select .cse1 v_ArrVal_322) (_ bv0 64) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv1 32) .cse0)))) (= (_ bv0 64) |c_ULTIMATE.start_main_~a~0#1.offset|)) is different from false [2022-01-10 06:02:30,903 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_322 (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_321))) (store .cse1 v_ArrVal_322 (store (select .cse1 v_ArrVal_322) (_ bv0 64) (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (_ bv3 32) .cse0) (= (_ bv1 32) .cse0)))) (= (_ bv0 64) |c_ULTIMATE.start_main_~a~0#1.offset|)) is different from false [2022-01-10 06:02:30,913 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32)) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_322 (_ BitVec 64))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_321))) (store .cse1 v_ArrVal_322 (store (select .cse1 v_ArrVal_322) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= .cse0 (_ bv1 32)) (= (_ bv3 32) .cse0)))) (= (_ bv0 64) |c_ULTIMATE.start_main_~t~0#1.offset|) (= (_ bv0 64) |c_ULTIMATE.start_main_~a~0#1.offset|)) is different from false [2022-01-10 06:02:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:02:31,279 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2022-01-10 06:02:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 06:02:31,279 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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 26 [2022-01-10 06:02:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:02:31,280 INFO L225 Difference]: With dead ends: 86 [2022-01-10 06:02:31,280 INFO L226 Difference]: Without dead ends: 79 [2022-01-10 06:02:31,280 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=118, Invalid=494, Unknown=12, NotChecked=306, Total=930 [2022-01-10 06:02:31,281 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 194 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:02:31,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 153 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 103 Invalid, 0 Unknown, 194 Unchecked, 0.4s Time] [2022-01-10 06:02:31,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-01-10 06:02:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2022-01-10 06:02:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 65 states have internal predecessors, (76), 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 06:02:31,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-01-10 06:02:31,285 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 26 [2022-01-10 06:02:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:02:31,285 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-01-10 06:02:31,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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 06:02:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-01-10 06:02:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 06:02:31,285 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:02:31,286 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:02:31,298 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 06:02:31,486 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 06:02:31,486 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:02:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:02:31,487 INFO L85 PathProgramCache]: Analyzing trace with hash 441281440, now seen corresponding path program 1 times [2022-01-10 06:02:31,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:02:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349543438] [2022-01-10 06:02:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:02:31,487 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:02:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:02:31,488 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 06:02:31,489 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 06:02:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:02:31,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-10 06:02:31,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:02:31,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:02:31,754 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:02:31,799 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:02:31,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 06:02:31,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:31,944 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 21 treesize of output 20 [2022-01-10 06:02:31,967 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 13 treesize of output 9 [2022-01-10 06:02:32,102 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:02:32,102 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 14 treesize of output 20 [2022-01-10 06:02:32,113 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 5 treesize of output 3 [2022-01-10 06:02:32,138 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:02:32,138 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 26 treesize of output 26 [2022-01-10 06:02:32,263 INFO L353 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-01-10 06:02:32,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2022-01-10 06:02:32,271 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 20 treesize of output 22 [2022-01-10 06:02:32,424 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-10 06:02:32,424 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 65 [2022-01-10 06:02:32,456 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 06:02:32,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2022-01-10 06:02:32,476 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 23 treesize of output 15 [2022-01-10 06:02:32,511 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 30 treesize of output 18 [2022-01-10 06:02:32,558 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 30 treesize of output 18 [2022-01-10 06:02:32,619 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 39 treesize of output 27 [2022-01-10 06:02:33,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:02:33,176 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 06:02:33,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 26 [2022-01-10 06:02:33,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:02:33,336 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:02:33,336 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 1 case distinctions, treesize of input 28 treesize of output 30 [2022-01-10 06:02:33,551 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 06:02:33,551 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 2 case distinctions, treesize of input 21 treesize of output 30 [2022-01-10 06:02:33,773 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 06:02:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:02:33,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:02:33,980 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) (_ bv1 32))) is different from false [2022-01-10 06:02:33,990 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~l1~0#1.base|) |c_ULTIMATE.start_main_~l1~0#1.offset|) (_ bv1 32))) is different from false [2022-01-10 06:02:34,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_395 (_ BitVec 32))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~t~0#1.offset|) v_ArrVal_395)) |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~t~0#1.base|) |c_ULTIMATE.start_main_~t~0#1.offset|) (_ bv1 32))) is different from false [2022-01-10 06:02:34,022 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_395 (_ BitVec 32))) (= (select (select (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_395)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) v_ArrVal_397)) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) (_ bv1 32))) is different from false [2022-01-10 06:02:34,049 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_395 (_ BitVec 32))) (= (select (select (let ((.cse0 (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|))) (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|) .cse0 v_ArrVal_395)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) v_ArrVal_397)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv1 32))) (= (_ bv3 32) |c_ULTIMATE.start_main_#t~mem7#1|)) is different from false [2022-01-10 06:02:34,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 (_ BitVec 64)) (v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 64) (_ BitVec 32))) (|ULTIMATE.start_main_~p~0#1.offset| (_ BitVec 64)) (v_ArrVal_394 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_395 (_ BitVec 32))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_390))) (store .cse3 v_ArrVal_387 (store (select .cse3 v_ArrVal_387) |c_ULTIMATE.start_main_~t~0#1.offset| (_ bv3 32)))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv3 32) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (_ bv1 32) (select (select (let ((.cse2 (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_395)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_387)) v_ArrVal_387 v_ArrVal_394) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_397)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-01-10 06:02:34,441 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 (_ BitVec 64)) (v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 64) (_ BitVec 32))) (|ULTIMATE.start_main_~p~0#1.offset| (_ BitVec 64)) (v_ArrVal_394 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_395 (_ BitVec 32))) (let ((.cse1 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_390))) (store .cse3 v_ArrVal_387 (store (select .cse3 v_ArrVal_387) (_ bv0 64) (_ bv3 32)))))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv3 32)) (= (_ bv1 32) (select (select (let ((.cse2 (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse0 .cse2 v_ArrVal_395)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64)) v_ArrVal_387)) v_ArrVal_387 v_ArrVal_394) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_397)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-01-10 06:02:34,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:34,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2022-01-10 06:02:34,525 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_397 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_390 (Array (_ BitVec 64) (_ BitVec 32))) (|ULTIMATE.start_main_~p~0#1.offset| (_ BitVec 64)) (v_ArrVal_394 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_395 (_ BitVec 32))) (let ((.cse3 (select v_arrayElimArr_5 (bvadd |ULTIMATE.start_main_~p~0#1.offset| (_ bv4 64))))) (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_390))) (store .cse4 .cse3 (store (select .cse4 .cse3) (_ bv0 64) (_ bv3 32)))))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (or (= (_ bv1 32) (select (select (let ((.cse2 (bvadd (_ bv4 64) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store .cse1 .cse2 v_ArrVal_395)) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_arrayElimArr_5) .cse3 v_ArrVal_394) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) v_ArrVal_397)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (_ bv3 32) (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))))))) is different from false [2022-01-10 06:02:34,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:34,616 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 130 treesize of output 131 [2022-01-10 06:02:34,777 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:34,778 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 972 treesize of output 969 [2022-01-10 06:02:34,858 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:02:34,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 999 treesize of output 843 [2022-01-10 06:02:34,877 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 790 treesize of output 774