java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 21:14:34,972 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 21:14:34,974 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 21:14:34,989 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 21:14:34,990 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 21:14:34,991 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 21:14:34,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 21:14:34,993 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 21:14:34,996 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 21:14:34,996 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 21:14:34,997 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 21:14:34,998 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 21:14:34,999 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 21:14:35,000 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 21:14:35,001 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 21:14:35,003 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 21:14:35,005 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 21:14:35,006 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 21:14:35,007 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 21:14:35,009 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 21:14:35,011 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 21:14:35,011 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 21:14:35,011 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 21:14:35,012 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 21:14:35,013 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 21:14:35,014 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 21:14:35,015 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 21:14:35,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 21:14:35,016 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 21:14:35,016 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 21:14:35,017 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 21:14:35,017 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 21:14:35,041 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 21:14:35,042 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 21:14:35,042 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 21:14:35,042 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 21:14:35,043 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 21:14:35,043 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 21:14:35,043 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 21:14:35,043 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 21:14:35,044 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 21:14:35,044 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 21:14:35,044 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 21:14:35,044 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 21:14:35,044 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 21:14:35,045 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 21:14:35,045 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 21:14:35,045 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 21:14:35,045 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 21:14:35,045 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 21:14:35,046 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 21:14:35,046 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 21:14:35,046 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 21:14:35,046 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 21:14:35,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 21:14:35,046 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 21:14:35,047 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 21:14:35,047 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 21:14:35,047 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:14:35,047 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 21:14:35,047 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 21:14:35,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 21:14:35,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 21:14:35,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 21:14:35,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:35,048 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 21:14:35,049 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 21:14:35,049 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 21:14:35,049 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 21:14:35,050 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 21:14:35,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 21:14:35,096 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 21:14:35,100 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 21:14:35,101 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 21:14:35,102 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 21:14:35,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-06 21:14:35,442 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1e3e0a7b0 [2018-04-06 21:14:35,557 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 21:14:35,557 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 21:14:35,558 INFO L168 CDTParser]: Scanning ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-06 21:14:35,558 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 21:14:35,559 INFO L215 ultiparseSymbolTable]: [2018-04-06 21:14:35,559 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 21:14:35,559 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo ('foo') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-06 21:14:35,559 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-06 21:14:35,559 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 21:14:35,559 INFO L233 ultiparseSymbolTable]: [2018-04-06 21:14:35,575 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG1e3e0a7b0 [2018-04-06 21:14:35,579 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 21:14:35,580 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 21:14:35,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 21:14:35,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 21:14:35,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 21:14:35,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77adecd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35, skipping insertion in model container [2018-04-06 21:14:35,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,603 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:14:35,615 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 21:14:35,746 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:14:35,767 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 21:14:35,773 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 9 non ball SCCs. Number of states in SCCs 9. [2018-04-06 21:14:35,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35 WrapperNode [2018-04-06 21:14:35,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 21:14:35,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 21:14:35,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 21:14:35,785 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 21:14:35,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,815 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... [2018-04-06 21:14:35,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 21:14:35,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 21:14:35,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 21:14:35,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 21:14:35,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 21:14:35,871 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 21:14:35,871 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 21:14:35,872 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-06 21:14:35,872 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 21:14:35,872 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__foo [2018-04-06 21:14:35,872 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 21:14:35,872 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 21:14:35,872 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 21:14:35,872 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 21:14:35,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 21:14:35,873 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 21:14:35,873 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 21:14:35,873 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 21:14:36,125 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 21:14:36,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:14:36 BoogieIcfgContainer [2018-04-06 21:14:36,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 21:14:36,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 21:14:36,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 21:14:36,130 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 21:14:36,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 09:14:35" (1/3) ... [2018-04-06 21:14:36,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec04587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:14:36, skipping insertion in model container [2018-04-06 21:14:36,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 09:14:35" (2/3) ... [2018-04-06 21:14:36,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec04587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 09:14:36, skipping insertion in model container [2018-04-06 21:14:36,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 09:14:36" (3/3) ... [2018-04-06 21:14:36,134 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2018-04-06 21:14:36,144 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 21:14:36,151 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-04-06 21:14:36,187 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 21:14:36,188 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 21:14:36,188 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 21:14:36,188 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 21:14:36,188 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 21:14:36,188 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 21:14:36,188 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 21:14:36,189 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 21:14:36,189 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 21:14:36,190 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 21:14:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-04-06 21:14:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-06 21:14:36,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:36,210 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:36,210 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:36,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1440860085, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:36,226 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:36,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:36,317 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:36,360 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:36,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-04-06 21:14:36,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 21:14:36,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 21:14:36,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:14:36,374 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2018-04-06 21:14:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:36,483 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2018-04-06 21:14:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 21:14:36,485 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-06 21:14:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:36,495 INFO L225 Difference]: With dead ends: 137 [2018-04-06 21:14:36,495 INFO L226 Difference]: Without dead ends: 81 [2018-04-06 21:14:36,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:14:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-06 21:14:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2018-04-06 21:14:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-06 21:14:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-04-06 21:14:36,537 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 14 [2018-04-06 21:14:36,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:36,538 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-04-06 21:14:36,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 21:14:36,538 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-04-06 21:14:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-06 21:14:36,539 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:36,539 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:36,539 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash -658382786, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:36,549 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:36,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:36,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:36,633 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:36,633 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-04-06 21:14:36,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 21:14:36,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 21:14:36,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:14:36,635 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 4 states. [2018-04-06 21:14:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:36,674 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-04-06 21:14:36,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-06 21:14:36,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-06 21:14:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:36,677 INFO L225 Difference]: With dead ends: 79 [2018-04-06 21:14:36,678 INFO L226 Difference]: Without dead ends: 78 [2018-04-06 21:14:36,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-04-06 21:14:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-06 21:14:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2018-04-06 21:14:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-06 21:14:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-06 21:14:36,687 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 23 [2018-04-06 21:14:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:36,687 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-06 21:14:36,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 21:14:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-06 21:14:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 21:14:36,688 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:36,689 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:36,689 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1064970165, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:36,700 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:36,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:36,752 INFO L477 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 [2018-04-06 21:14:36,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:36,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:36,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 21:14:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:36,774 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:36,810 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:36,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-06 21:14:36,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 21:14:36,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 21:14:36,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-06 21:14:36,812 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 5 states. [2018-04-06 21:14:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:36,937 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-04-06 21:14:36,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 21:14:36,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-06 21:14:36,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:36,939 INFO L225 Difference]: With dead ends: 68 [2018-04-06 21:14:36,939 INFO L226 Difference]: Without dead ends: 67 [2018-04-06 21:14:36,939 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-06 21:14:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-06 21:14:36,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-06 21:14:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-06 21:14:36,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-06 21:14:36,948 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 24 [2018-04-06 21:14:36,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:36,949 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-06 21:14:36,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 21:14:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-06 21:14:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-06 21:14:36,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:36,950 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:36,950 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:36,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1064970166, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:36,959 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:36,976 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:36,989 INFO L477 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 [2018-04-06 21:14:36,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:36,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:36,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:14:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:37,031 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:37,139 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:37,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2018-04-06 21:14:37,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 21:14:37,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 21:14:37,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-04-06 21:14:37,141 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 10 states. [2018-04-06 21:14:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:37,268 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-04-06 21:14:37,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 21:14:37,269 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-06 21:14:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:37,270 INFO L225 Difference]: With dead ends: 76 [2018-04-06 21:14:37,270 INFO L226 Difference]: Without dead ends: 75 [2018-04-06 21:14:37,271 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-04-06 21:14:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-04-06 21:14:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-04-06 21:14:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-06 21:14:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-06 21:14:37,285 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 24 [2018-04-06 21:14:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:37,286 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-06 21:14:37,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 21:14:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-06 21:14:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-06 21:14:37,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:37,288 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:37,289 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:37,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1397858905, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:37,297 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:37,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:37,345 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:37,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:37,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-04-06 21:14:37,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 21:14:37,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 21:14:37,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-04-06 21:14:37,448 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 8 states. [2018-04-06 21:14:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:37,645 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-04-06 21:14:37,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 21:14:37,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-06 21:14:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:37,647 INFO L225 Difference]: With dead ends: 102 [2018-04-06 21:14:37,647 INFO L226 Difference]: Without dead ends: 101 [2018-04-06 21:14:37,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:14:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-06 21:14:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 85. [2018-04-06 21:14:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-06 21:14:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2018-04-06 21:14:37,657 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 32 [2018-04-06 21:14:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:37,658 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2018-04-06 21:14:37,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 21:14:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2018-04-06 21:14:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-06 21:14:37,659 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:37,659 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:37,660 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:37,660 INFO L82 PathProgramCache]: Analyzing trace with hash -383953043, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:37,672 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:37,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:37,691 INFO L477 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 [2018-04-06 21:14:37,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:37,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:37,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:14:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:37,750 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:37,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:37,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-04-06 21:14:37,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-06 21:14:37,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-06 21:14:37,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-06 21:14:37,868 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand 14 states. [2018-04-06 21:14:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:38,130 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2018-04-06 21:14:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 21:14:38,130 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 33 [2018-04-06 21:14:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:38,132 INFO L225 Difference]: With dead ends: 96 [2018-04-06 21:14:38,132 INFO L226 Difference]: Without dead ends: 95 [2018-04-06 21:14:38,133 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=332, Unknown=0, NotChecked=0, Total=462 [2018-04-06 21:14:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-06 21:14:38,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2018-04-06 21:14:38,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-06 21:14:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-04-06 21:14:38,142 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 33 [2018-04-06 21:14:38,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:38,143 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-04-06 21:14:38,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-06 21:14:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-04-06 21:14:38,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 21:14:38,144 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:38,144 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:38,144 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash 402779255, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:38,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:38,164 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:38,177 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:38,235 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:14:38,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-06 21:14:38,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 21:14:38,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 21:14:38,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 21:14:38,236 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 8 states. [2018-04-06 21:14:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:38,282 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2018-04-06 21:14:38,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 21:14:38,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-04-06 21:14:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:38,285 INFO L225 Difference]: With dead ends: 161 [2018-04-06 21:14:38,285 INFO L226 Difference]: Without dead ends: 86 [2018-04-06 21:14:38,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-04-06 21:14:38,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-06 21:14:38,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-06 21:14:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-06 21:14:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-04-06 21:14:38,296 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 34 [2018-04-06 21:14:38,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:38,296 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-04-06 21:14:38,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 21:14:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-04-06 21:14:38,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-06 21:14:38,298 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:38,298 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:38,298 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:38,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1104010386, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:38,305 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:38,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:38,354 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:38,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:38,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-06 21:14:38,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 21:14:38,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 21:14:38,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:14:38,434 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-04-06 21:14:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:38,546 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-04-06 21:14:38,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 21:14:38,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-04-06 21:14:38,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:38,547 INFO L225 Difference]: With dead ends: 164 [2018-04-06 21:14:38,547 INFO L226 Difference]: Without dead ends: 86 [2018-04-06 21:14:38,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2018-04-06 21:14:38,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-04-06 21:14:38,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-04-06 21:14:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-06 21:14:38,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2018-04-06 21:14:38,555 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 43 [2018-04-06 21:14:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:38,556 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2018-04-06 21:14:38,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 21:14:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2018-04-06 21:14:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 21:14:38,557 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:38,557 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:38,557 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:38,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1311193991, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:38,563 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:38,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:38,616 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:38,764 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:38,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-04-06 21:14:38,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 21:14:38,765 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 21:14:38,765 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-04-06 21:14:38,766 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 16 states. [2018-04-06 21:14:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:39,086 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-04-06 21:14:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 21:14:39,087 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-06 21:14:39,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:39,088 INFO L225 Difference]: With dead ends: 143 [2018-04-06 21:14:39,088 INFO L226 Difference]: Without dead ends: 142 [2018-04-06 21:14:39,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2018-04-06 21:14:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-06 21:14:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 121. [2018-04-06 21:14:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-06 21:14:39,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-04-06 21:14:39,099 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 50 [2018-04-06 21:14:39,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:39,099 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-04-06 21:14:39,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 21:14:39,100 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-04-06 21:14:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-06 21:14:39,100 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:39,101 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:39,101 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1992308109, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:39,110 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:39,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:39,136 INFO L477 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 [2018-04-06 21:14:39,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:39,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:39,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:14:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:39,259 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:39,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:39,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-04-06 21:14:39,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-06 21:14:39,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-06 21:14:39,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2018-04-06 21:14:39,543 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 22 states. [2018-04-06 21:14:40,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:40,203 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-04-06 21:14:40,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-06 21:14:40,203 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-04-06 21:14:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:40,204 INFO L225 Difference]: With dead ends: 135 [2018-04-06 21:14:40,204 INFO L226 Difference]: Without dead ends: 134 [2018-04-06 21:14:40,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=430, Invalid=1292, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 21:14:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-06 21:14:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 122. [2018-04-06 21:14:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-06 21:14:40,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2018-04-06 21:14:40,211 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 51 [2018-04-06 21:14:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:40,211 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2018-04-06 21:14:40,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-06 21:14:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2018-04-06 21:14:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 21:14:40,212 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:40,213 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:40,213 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:40,213 INFO L82 PathProgramCache]: Analyzing trace with hash 418240910, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:40,221 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:40,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:40,330 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:40,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:40,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-06 21:14:40,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-06 21:14:40,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-06 21:14:40,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-04-06 21:14:40,453 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand 20 states. [2018-04-06 21:14:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:40,749 INFO L93 Difference]: Finished difference Result 236 states and 250 transitions. [2018-04-06 21:14:40,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-06 21:14:40,750 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 61 [2018-04-06 21:14:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:40,750 INFO L225 Difference]: With dead ends: 236 [2018-04-06 21:14:40,750 INFO L226 Difference]: Without dead ends: 122 [2018-04-06 21:14:40,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=432, Invalid=900, Unknown=0, NotChecked=0, Total=1332 [2018-04-06 21:14:40,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-06 21:14:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-04-06 21:14:40,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-06 21:14:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-04-06 21:14:40,758 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 61 [2018-04-06 21:14:40,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:40,759 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-04-06 21:14:40,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-06 21:14:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-04-06 21:14:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-04-06 21:14:40,760 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:40,760 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:40,760 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash -419442873, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:40,766 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:40,788 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:40,911 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:41,185 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:41,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-04-06 21:14:41,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-06 21:14:41,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-06 21:14:41,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2018-04-06 21:14:41,186 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 32 states. [2018-04-06 21:14:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:42,345 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2018-04-06 21:14:42,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-06 21:14:42,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 86 [2018-04-06 21:14:42,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:42,347 INFO L225 Difference]: With dead ends: 231 [2018-04-06 21:14:42,347 INFO L226 Difference]: Without dead ends: 230 [2018-04-06 21:14:42,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1096, Invalid=3194, Unknown=0, NotChecked=0, Total=4290 [2018-04-06 21:14:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-04-06 21:14:42,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 193. [2018-04-06 21:14:42,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-06 21:14:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 211 transitions. [2018-04-06 21:14:42,355 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 211 transitions. Word has length 86 [2018-04-06 21:14:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:42,356 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 211 transitions. [2018-04-06 21:14:42,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-06 21:14:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 211 transitions. [2018-04-06 21:14:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-04-06 21:14:42,357 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:42,357 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:42,357 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:42,357 INFO L82 PathProgramCache]: Analyzing trace with hash -117827123, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:42,363 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:42,382 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:42,386 INFO L477 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 [2018-04-06 21:14:42,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:42,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:42,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:14:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:42,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:42,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:42,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-04-06 21:14:42,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-06 21:14:42,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-06 21:14:42,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2018-04-06 21:14:42,951 INFO L87 Difference]: Start difference. First operand 193 states and 211 transitions. Second operand 38 states. [2018-04-06 21:14:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:45,202 INFO L93 Difference]: Finished difference Result 219 states and 237 transitions. [2018-04-06 21:14:45,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-06 21:14:45,202 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 87 [2018-04-06 21:14:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:45,203 INFO L225 Difference]: With dead ends: 219 [2018-04-06 21:14:45,203 INFO L226 Difference]: Without dead ends: 218 [2018-04-06 21:14:45,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1510, Invalid=5132, Unknown=0, NotChecked=0, Total=6642 [2018-04-06 21:14:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-06 21:14:45,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 194. [2018-04-06 21:14:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-06 21:14:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 205 transitions. [2018-04-06 21:14:45,213 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 205 transitions. Word has length 87 [2018-04-06 21:14:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:45,214 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 205 transitions. [2018-04-06 21:14:45,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-06 21:14:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2018-04-06 21:14:45,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-04-06 21:14:45,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:45,215 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:45,215 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash -800625202, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:45,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:45,248 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:45,402 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 3 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:45,711 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:45,711 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-04-06 21:14:45,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-06 21:14:45,712 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-06 21:14:45,712 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2018-04-06 21:14:45,713 INFO L87 Difference]: Start difference. First operand 194 states and 205 transitions. Second operand 36 states. [2018-04-06 21:14:46,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:46,576 INFO L93 Difference]: Finished difference Result 380 states and 402 transitions. [2018-04-06 21:14:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-06 21:14:46,576 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 97 [2018-04-06 21:14:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:46,577 INFO L225 Difference]: With dead ends: 380 [2018-04-06 21:14:46,577 INFO L226 Difference]: Without dead ends: 194 [2018-04-06 21:14:46,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1660, Invalid=3596, Unknown=0, NotChecked=0, Total=5256 [2018-04-06 21:14:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-06 21:14:46,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-04-06 21:14:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-06 21:14:46,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 197 transitions. [2018-04-06 21:14:46,586 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 197 transitions. Word has length 97 [2018-04-06 21:14:46,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:46,587 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 197 transitions. [2018-04-06 21:14:46,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-06 21:14:46,587 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 197 transitions. [2018-04-06 21:14:46,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-04-06 21:14:46,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:46,588 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:46,588 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:46,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1349232953, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:46,599 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:46,633 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:46,950 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:47,900 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:47,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-04-06 21:14:47,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-06 21:14:47,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-06 21:14:47,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=606, Invalid=3426, Unknown=0, NotChecked=0, Total=4032 [2018-04-06 21:14:47,902 INFO L87 Difference]: Start difference. First operand 194 states and 197 transitions. Second operand 64 states. [2018-04-06 21:14:49,826 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 119 DAG size of output 11 [2018-04-06 21:14:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:14:53,440 INFO L93 Difference]: Finished difference Result 407 states and 441 transitions. [2018-04-06 21:14:53,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-06 21:14:53,441 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 158 [2018-04-06 21:14:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:14:53,443 INFO L225 Difference]: With dead ends: 407 [2018-04-06 21:14:53,443 INFO L226 Difference]: Without dead ends: 406 [2018-04-06 21:14:53,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3452 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4624, Invalid=14282, Unknown=0, NotChecked=0, Total=18906 [2018-04-06 21:14:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-04-06 21:14:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 337. [2018-04-06 21:14:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-04-06 21:14:53,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 371 transitions. [2018-04-06 21:14:53,463 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 371 transitions. Word has length 158 [2018-04-06 21:14:53,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:14:53,464 INFO L459 AbstractCegarLoop]: Abstraction has 337 states and 371 transitions. [2018-04-06 21:14:53,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-06 21:14:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 371 transitions. [2018-04-06 21:14:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-06 21:14:53,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:14:53,466 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:14:53,466 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:14:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1123451469, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:14:53,474 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:14:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:14:53,507 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:14:53,510 INFO L477 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 [2018-04-06 21:14:53,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:14:53,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:14:53,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:14:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:54,135 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:14:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 0 proven. 1005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:14:55,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:14:55,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-04-06 21:14:55,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-06 21:14:55,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-06 21:14:55,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=4147, Unknown=0, NotChecked=0, Total=4830 [2018-04-06 21:14:55,173 INFO L87 Difference]: Start difference. First operand 337 states and 371 transitions. Second operand 70 states. [2018-04-06 21:15:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:03,705 INFO L93 Difference]: Finished difference Result 387 states and 421 transitions. [2018-04-06 21:15:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-06 21:15:03,705 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 159 [2018-04-06 21:15:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:03,707 INFO L225 Difference]: With dead ends: 387 [2018-04-06 21:15:03,707 INFO L226 Difference]: Without dead ends: 386 [2018-04-06 21:15:03,711 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5800 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=5590, Invalid=20492, Unknown=0, NotChecked=0, Total=26082 [2018-04-06 21:15:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-04-06 21:15:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 338. [2018-04-06 21:15:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-06 21:15:03,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 357 transitions. [2018-04-06 21:15:03,722 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 357 transitions. Word has length 159 [2018-04-06 21:15:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:03,722 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 357 transitions. [2018-04-06 21:15:03,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-06 21:15:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 357 transitions. [2018-04-06 21:15:03,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-06 21:15:03,723 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:03,724 INFO L355 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:03,724 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:03,724 INFO L82 PathProgramCache]: Analyzing trace with hash 708523598, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:03,729 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:03,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:04,172 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:04,857 INFO L134 CoverageAnalysis]: Checked inductivity of 978 backedges. 3 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:04,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:04,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 68 [2018-04-06 21:15:04,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-06 21:15:04,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-06 21:15:04,880 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=3364, Unknown=0, NotChecked=0, Total=4556 [2018-04-06 21:15:04,880 INFO L87 Difference]: Start difference. First operand 338 states and 357 transitions. Second operand 68 states. [2018-04-06 21:15:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:07,794 INFO L93 Difference]: Finished difference Result 668 states and 706 transitions. [2018-04-06 21:15:07,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-06 21:15:07,794 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 169 [2018-04-06 21:15:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:07,795 INFO L225 Difference]: With dead ends: 668 [2018-04-06 21:15:07,795 INFO L226 Difference]: Without dead ends: 338 [2018-04-06 21:15:07,797 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 270 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6512 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=6516, Invalid=14364, Unknown=0, NotChecked=0, Total=20880 [2018-04-06 21:15:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-04-06 21:15:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-04-06 21:15:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-04-06 21:15:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 341 transitions. [2018-04-06 21:15:07,807 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 341 transitions. Word has length 169 [2018-04-06 21:15:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:07,808 INFO L459 AbstractCegarLoop]: Abstraction has 338 states and 341 transitions. [2018-04-06 21:15:07,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-06 21:15:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 341 transitions. [2018-04-06 21:15:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-04-06 21:15:07,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:07,812 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:07,812 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 445310407, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:07,823 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:07,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:09,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:09,097 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:12,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:12,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 127 [2018-04-06 21:15:12,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-04-06 21:15:12,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-04-06 21:15:12,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=14979, Unknown=0, NotChecked=0, Total=16256 [2018-04-06 21:15:12,471 INFO L87 Difference]: Start difference. First operand 338 states and 341 transitions. Second operand 128 states. [2018-04-06 21:15:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:17,928 INFO L93 Difference]: Finished difference Result 356 states and 360 transitions. [2018-04-06 21:15:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-06 21:15:17,929 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 302 [2018-04-06 21:15:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:17,931 INFO L225 Difference]: With dead ends: 356 [2018-04-06 21:15:17,931 INFO L226 Difference]: Without dead ends: 355 [2018-04-06 21:15:17,933 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 477 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3540, Invalid=32370, Unknown=0, NotChecked=0, Total=35910 [2018-04-06 21:15:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-04-06 21:15:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 346. [2018-04-06 21:15:17,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-04-06 21:15:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-04-06 21:15:17,946 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 302 [2018-04-06 21:15:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:17,947 INFO L459 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-04-06 21:15:17,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-04-06 21:15:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-04-06 21:15:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-04-06 21:15:17,949 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:17,949 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:17,949 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:17,950 INFO L82 PathProgramCache]: Analyzing trace with hash 919720781, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:17,972 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:18,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:18,044 INFO L477 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 [2018-04-06 21:15:18,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:15:18,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:15:18,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:15:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:20,137 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4309 backedges. 0 proven. 4309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:23,352 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:23,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-04-06 21:15:23,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-06 21:15:23,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-06 21:15:23,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1418, Invalid=16404, Unknown=0, NotChecked=0, Total=17822 [2018-04-06 21:15:23,354 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 134 states. [2018-04-06 21:15:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:32,986 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-04-06 21:15:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-06 21:15:32,986 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 303 [2018-04-06 21:15:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:32,988 INFO L225 Difference]: With dead ends: 355 [2018-04-06 21:15:32,988 INFO L226 Difference]: Without dead ends: 354 [2018-04-06 21:15:32,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10768 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4945, Invalid=47725, Unknown=0, NotChecked=0, Total=52670 [2018-04-06 21:15:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-04-06 21:15:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 347. [2018-04-06 21:15:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-06 21:15:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-04-06 21:15:33,006 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 303 [2018-04-06 21:15:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:33,007 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-04-06 21:15:33,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-06 21:15:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-04-06 21:15:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-04-06 21:15:33,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:33,009 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:33,010 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:33,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2021096898, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:33,019 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:33,092 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:34,509 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:36,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 4560 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:36,760 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:15:36,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [69, 69] imperfect sequences [] total 134 [2018-04-06 21:15:36,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-04-06 21:15:36,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-04-06 21:15:36,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3467, Invalid=14355, Unknown=0, NotChecked=0, Total=17822 [2018-04-06 21:15:36,762 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 134 states. [2018-04-06 21:15:40,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:40,803 INFO L93 Difference]: Finished difference Result 679 states and 688 transitions. [2018-04-06 21:15:40,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-04-06 21:15:40,803 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 311 [2018-04-06 21:15:40,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:40,804 INFO L225 Difference]: With dead ends: 679 [2018-04-06 21:15:40,804 INFO L226 Difference]: Without dead ends: 346 [2018-04-06 21:15:40,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 487 SyntacticMatches, 2 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12977 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13102, Invalid=40954, Unknown=0, NotChecked=0, Total=54056 [2018-04-06 21:15:40,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-06 21:15:40,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 343. [2018-04-06 21:15:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-06 21:15:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 346 transitions. [2018-04-06 21:15:40,815 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 346 transitions. Word has length 311 [2018-04-06 21:15:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:40,815 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 346 transitions. [2018-04-06 21:15:40,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-04-06 21:15:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 346 transitions. [2018-04-06 21:15:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-04-06 21:15:40,816 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:40,816 INFO L355 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:40,817 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:40,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1528477874, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:40,824 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:40,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:42,174 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:42,382 WARN L148 SmtUtils]: Spent 202ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-06 21:15:42,590 WARN L148 SmtUtils]: Spent 205ms on a formula simplification that was a NOOP. DAG size: 165 [2018-04-06 21:15:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4250 backedges. 3 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 21:15:43,742 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:43,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-04-06 21:15:43,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-04-06 21:15:43,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-04-06 21:15:43,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3396, Invalid=13634, Unknown=0, NotChecked=0, Total=17030 [2018-04-06 21:15:43,745 INFO L87 Difference]: Start difference. First operand 343 states and 346 transitions. Second operand 131 states. [2018-04-06 21:15:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:45,681 INFO L93 Difference]: Finished difference Result 675 states and 681 transitions. [2018-04-06 21:15:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-06 21:15:45,682 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 313 [2018-04-06 21:15:45,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:45,684 INFO L225 Difference]: With dead ends: 675 [2018-04-06 21:15:45,685 INFO L226 Difference]: Without dead ends: 343 [2018-04-06 21:15:45,687 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 494 SyntacticMatches, 2 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14761 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=9634, Invalid=27808, Unknown=0, NotChecked=0, Total=37442 [2018-04-06 21:15:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-06 21:15:45,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-04-06 21:15:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-04-06 21:15:45,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 345 transitions. [2018-04-06 21:15:45,701 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 345 transitions. Word has length 313 [2018-04-06 21:15:45,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:45,702 INFO L459 AbstractCegarLoop]: Abstraction has 343 states and 345 transitions. [2018-04-06 21:15:45,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-04-06 21:15:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 345 transitions. [2018-04-06 21:15:45,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-04-06 21:15:45,705 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:45,705 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:45,705 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:45,705 INFO L82 PathProgramCache]: Analyzing trace with hash -64877961, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:45,714 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:45,782 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:45,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-06 21:15:45,949 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4531 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-06 21:15:46,070 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 21:15:46,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-06 21:15:46,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 21:15:46,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 21:15:46,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-06 21:15:46,071 INFO L87 Difference]: Start difference. First operand 343 states and 345 transitions. Second operand 9 states. [2018-04-06 21:15:46,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:46,120 INFO L93 Difference]: Finished difference Result 359 states and 361 transitions. [2018-04-06 21:15:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 21:15:46,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 322 [2018-04-06 21:15:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:46,124 INFO L225 Difference]: With dead ends: 359 [2018-04-06 21:15:46,124 INFO L226 Difference]: Without dead ends: 358 [2018-04-06 21:15:46,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 635 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:15:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-06 21:15:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 341. [2018-04-06 21:15:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-04-06 21:15:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 343 transitions. [2018-04-06 21:15:46,137 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 343 transitions. Word has length 322 [2018-04-06 21:15:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:46,137 INFO L459 AbstractCegarLoop]: Abstraction has 341 states and 343 transitions. [2018-04-06 21:15:46,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 21:15:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 343 transitions. [2018-04-06 21:15:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-04-06 21:15:46,139 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:46,139 INFO L355 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:46,139 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash -2071552900, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:46,153 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:46,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-06 21:15:46,279 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4530 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4528 trivial. 0 not checked. [2018-04-06 21:15:46,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:46,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-04-06 21:15:46,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 21:15:46,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 21:15:46,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-06 21:15:46,349 INFO L87 Difference]: Start difference. First operand 341 states and 343 transitions. Second operand 8 states. [2018-04-06 21:15:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:46,408 INFO L93 Difference]: Finished difference Result 391 states and 397 transitions. [2018-04-06 21:15:46,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-06 21:15:46,408 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 330 [2018-04-06 21:15:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:46,411 INFO L225 Difference]: With dead ends: 391 [2018-04-06 21:15:46,411 INFO L226 Difference]: Without dead ends: 371 [2018-04-06 21:15:46,412 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-04-06 21:15:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-06 21:15:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 361. [2018-04-06 21:15:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-04-06 21:15:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-04-06 21:15:46,428 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 330 [2018-04-06 21:15:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:46,429 INFO L459 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-04-06 21:15:46,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 21:15:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-04-06 21:15:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 947 [2018-04-06 21:15:46,439 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:46,440 INFO L355 BasicCegarLoop]: trace histogram [99, 96, 96, 96, 96, 96, 96, 96, 96, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:46,440 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:46,441 INFO L82 PathProgramCache]: Analyzing trace with hash -991334700, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:46,449 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:46,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-06 21:15:47,040 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:47,419 INFO L134 CoverageAnalysis]: Checked inductivity of 41682 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 41646 trivial. 0 not checked. [2018-04-06 21:15:47,454 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:47,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-04-06 21:15:47,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-06 21:15:47,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-06 21:15:47,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-04-06 21:15:47,455 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 16 states. [2018-04-06 21:15:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:47,609 INFO L93 Difference]: Finished difference Result 431 states and 443 transitions. [2018-04-06 21:15:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-06 21:15:47,610 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 946 [2018-04-06 21:15:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:47,612 INFO L225 Difference]: With dead ends: 431 [2018-04-06 21:15:47,612 INFO L226 Difference]: Without dead ends: 411 [2018-04-06 21:15:47,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 1903 GetRequests, 1877 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=259, Invalid=497, Unknown=0, NotChecked=0, Total=756 [2018-04-06 21:15:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-04-06 21:15:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 401. [2018-04-06 21:15:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-06 21:15:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 409 transitions. [2018-04-06 21:15:47,626 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 409 transitions. Word has length 946 [2018-04-06 21:15:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:47,627 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 409 transitions. [2018-04-06 21:15:47,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-06 21:15:47,627 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 409 transitions. [2018-04-06 21:15:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2179 [2018-04-06 21:15:47,653 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:47,654 INFO L355 BasicCegarLoop]: trace histogram [231, 224, 224, 224, 224, 224, 224, 224, 224, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:47,654 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash -370726012, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:47,671 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:48,087 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:49,554 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-06 21:15:49,554 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:15:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 228354 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 228130 trivial. 0 not checked. [2018-04-06 21:15:51,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:15:51,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-06 21:15:51,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-06 21:15:51,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-06 21:15:51,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-04-06 21:15:51,173 INFO L87 Difference]: Start difference. First operand 401 states and 409 transitions. Second operand 32 states. [2018-04-06 21:15:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:15:51,753 INFO L93 Difference]: Finished difference Result 511 states and 535 transitions. [2018-04-06 21:15:51,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-06 21:15:51,753 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 2178 [2018-04-06 21:15:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:15:51,757 INFO L225 Difference]: With dead ends: 511 [2018-04-06 21:15:51,757 INFO L226 Difference]: Without dead ends: 491 [2018-04-06 21:15:51,757 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4383 GetRequests, 4325 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1155, Invalid=2385, Unknown=0, NotChecked=0, Total=3540 [2018-04-06 21:15:51,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-04-06 21:15:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2018-04-06 21:15:51,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-04-06 21:15:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 497 transitions. [2018-04-06 21:15:51,774 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 497 transitions. Word has length 2178 [2018-04-06 21:15:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:15:51,775 INFO L459 AbstractCegarLoop]: Abstraction has 481 states and 497 transitions. [2018-04-06 21:15:51,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-06 21:15:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 497 transitions. [2018-04-06 21:15:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4643 [2018-04-06 21:15:51,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:15:51,869 INFO L355 BasicCegarLoop]: trace histogram [495, 480, 480, 480, 480, 480, 480, 480, 480, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:15:51,869 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:15:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash 325256420, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:15:51,876 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:15:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:15:52,773 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:15:58,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-06 21:15:58,610 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:16:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1051170 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1050090 trivial. 0 not checked. [2018-04-06 21:16:04,388 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:16:04,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 64 [2018-04-06 21:16:04,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-06 21:16:04,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-06 21:16:04,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1056, Invalid=2976, Unknown=0, NotChecked=0, Total=4032 [2018-04-06 21:16:04,392 INFO L87 Difference]: Start difference. First operand 481 states and 497 transitions. Second operand 64 states. [2018-04-06 21:16:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:16:05,627 INFO L93 Difference]: Finished difference Result 671 states and 719 transitions. [2018-04-06 21:16:05,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-06 21:16:05,627 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 4642 [2018-04-06 21:16:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:16:05,635 INFO L225 Difference]: With dead ends: 671 [2018-04-06 21:16:05,635 INFO L226 Difference]: Without dead ends: 651 [2018-04-06 21:16:05,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9343 GetRequests, 9221 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3257 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=4867, Invalid=10385, Unknown=0, NotChecked=0, Total=15252 [2018-04-06 21:16:05,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-04-06 21:16:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 641. [2018-04-06 21:16:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-04-06 21:16:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 673 transitions. [2018-04-06 21:16:05,678 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 673 transitions. Word has length 4642 [2018-04-06 21:16:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:16:05,681 INFO L459 AbstractCegarLoop]: Abstraction has 641 states and 673 transitions. [2018-04-06 21:16:05,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-06 21:16:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 673 transitions. [2018-04-06 21:16:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9571 [2018-04-06 21:16:06,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:16:06,117 INFO L355 BasicCegarLoop]: trace histogram [1023, 992, 992, 992, 992, 992, 992, 992, 992, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:16:06,117 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:16:06,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1722009692, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:16:06,124 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:16:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:16:07,742 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:16:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-06 21:16:30,697 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:16:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4494690 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 4489978 trivial. 0 not checked. [2018-04-06 21:16:53,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:16:53,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-04-06 21:16:53,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-06 21:16:53,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-06 21:16:53,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-04-06 21:16:53,705 INFO L87 Difference]: Start difference. First operand 641 states and 673 transitions. Second operand 65 states. [2018-04-06 21:16:55,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:16:55,329 INFO L93 Difference]: Finished difference Result 681 states and 715 transitions. [2018-04-06 21:16:55,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-04-06 21:16:55,330 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 9570 [2018-04-06 21:16:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:16:55,338 INFO L225 Difference]: With dead ends: 681 [2018-04-06 21:16:55,338 INFO L226 Difference]: Without dead ends: 661 [2018-04-06 21:16:55,340 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19201 GetRequests, 19013 SyntacticMatches, 63 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5673 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-04-06 21:16:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-04-06 21:16:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 651. [2018-04-06 21:16:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-04-06 21:16:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 684 transitions. [2018-04-06 21:16:55,365 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 684 transitions. Word has length 9570 [2018-04-06 21:16:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:16:55,369 INFO L459 AbstractCegarLoop]: Abstraction has 651 states and 684 transitions. [2018-04-06 21:16:55,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-06 21:16:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 684 transitions. [2018-04-06 21:16:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9879 [2018-04-06 21:16:55,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:16:55,775 INFO L355 BasicCegarLoop]: trace histogram [1056, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:16:55,775 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:16:55,777 INFO L82 PathProgramCache]: Analyzing trace with hash 609377232, now seen corresponding path program 6 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:16:55,783 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:16:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:16:57,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:16:58,890 INFO L477 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 [2018-04-06 21:16:58,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:58,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:58,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 21:16:59,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:16:59,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:16:59,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:16:59,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:16:59,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:00,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:00,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:00,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:00,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:01,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:01,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:01,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:01,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:01,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:01,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:01,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:01,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:01,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:01,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:01,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:01,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:01,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:01,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:01,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:01,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:01,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:01,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:01,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:02,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:02,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:02,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:02,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:03,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:03,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:03,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:03,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:03,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2018-04-06 21:17:03,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 21:17:03,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 15 [2018-04-06 21:17:03,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:03,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 21:17:03,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:5 [2018-04-06 21:17:29,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4789504 backedges. 4590 proven. 294781 refuted. 0 times theorem prover too weak. 4490133 trivial. 0 not checked. [2018-04-06 21:17:29,985 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 21:17:35,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-04-06 21:17:35,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:35,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2018-04-06 21:17:35,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 21:17:35,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 21:17:35,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-04-06 21:17:35,437 WARN L148 SmtUtils]: Spent 274ms on a formula simplification that was a NOOP. DAG size: 167 [2018-04-06 21:18:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4789504 backedges. 0 proven. 294931 refuted. 0 times theorem prover too weak. 4494573 trivial. 0 not checked. [2018-04-06 21:18:02,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 21:18:02,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134, 76] total 137 [2018-04-06 21:18:02,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-04-06 21:18:02,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-04-06 21:18:02,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1332, Invalid=17300, Unknown=0, NotChecked=0, Total=18632 [2018-04-06 21:18:02,811 INFO L87 Difference]: Start difference. First operand 651 states and 684 transitions. Second operand 137 states. [2018-04-06 21:18:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 21:18:13,840 INFO L93 Difference]: Finished difference Result 661 states and 693 transitions. [2018-04-06 21:18:13,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-04-06 21:18:13,840 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 9878 [2018-04-06 21:18:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 21:18:13,862 INFO L225 Difference]: With dead ends: 661 [2018-04-06 21:18:13,862 INFO L226 Difference]: Without dead ends: 656 [2018-04-06 21:18:13,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19884 GetRequests, 19526 SyntacticMatches, 94 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17218 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=5702, Invalid=64788, Unknown=0, NotChecked=0, Total=70490 [2018-04-06 21:18:13,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-04-06 21:18:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2018-04-06 21:18:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-04-06 21:18:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 685 transitions. [2018-04-06 21:18:13,910 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 685 transitions. Word has length 9878 [2018-04-06 21:18:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 21:18:13,917 INFO L459 AbstractCegarLoop]: Abstraction has 652 states and 685 transitions. [2018-04-06 21:18:13,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-04-06 21:18:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 685 transitions. [2018-04-06 21:18:14,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9881 [2018-04-06 21:18:14,402 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 21:18:14,405 INFO L355 BasicCegarLoop]: trace histogram [1056, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 21:18:14,405 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr1RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr2RequiresViolation, __U_MULTI_fArraysOfVariableLength__true_valid_memsafety_true_termination_c__fooErr0AssertViolationARRAY_INDEX, mainErr1AssertViolationARRAY_INDEX, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0AssertViolationARRAY_INDEX]=== [2018-04-06 21:18:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1786407478, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 21:18:14,412 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 21:18:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 21:18:16,136 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 21:18:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4789507 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4789504 trivial. 0 not checked. [2018-04-06 21:18:38,919 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-04-06 21:18:39,037 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-06 21:18:39,040 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 21:18:39,043 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 21:18:39,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 09:18:39 BoogieIcfgContainer [2018-04-06 21:18:39,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 21:18:39,044 INFO L168 Benchmark]: Toolchain (without parser) took 243464.91 ms. Allocated memory was 306.2 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 246.3 MB in the beginning and 864.4 MB in the end (delta: -618.1 MB). Peak memory consumption was 504.4 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:39,045 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 268.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 21:18:39,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.39 ms. Allocated memory is still 306.2 MB. Free memory was 246.3 MB in the beginning and 236.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:39,046 INFO L168 Benchmark]: Boogie Preprocessor took 33.15 ms. Allocated memory is still 306.2 MB. Free memory was 236.3 MB in the beginning and 234.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:39,046 INFO L168 Benchmark]: RCFGBuilder took 307.89 ms. Allocated memory was 306.2 MB in the beginning and 467.7 MB in the end (delta: 161.5 MB). Free memory was 234.3 MB in the beginning and 433.4 MB in the end (delta: -199.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:39,046 INFO L168 Benchmark]: TraceAbstraction took 242916.50 ms. Allocated memory was 467.7 MB in the beginning and 1.4 GB in the end (delta: 961.0 MB). Free memory was 433.4 MB in the beginning and 864.4 MB in the end (delta: -431.0 MB). Peak memory consumption was 530.1 MB. Max. memory is 5.3 GB. [2018-04-06 21:18:39,049 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 306.2 MB. Free memory is still 268.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.39 ms. Allocated memory is still 306.2 MB. Free memory was 246.3 MB in the beginning and 236.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.15 ms. Allocated memory is still 306.2 MB. Free memory was 236.3 MB in the beginning and 234.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 307.89 ms. Allocated memory was 306.2 MB in the beginning and 467.7 MB in the end (delta: 161.5 MB). Free memory was 234.3 MB in the beginning and 433.4 MB in the end (delta: -199.2 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 242916.50 ms. Allocated memory was 467.7 MB in the beginning and 1.4 GB in the end (delta: 961.0 MB). Free memory was 433.4 MB in the beginning and 864.4 MB in the end (delta: -431.0 MB). Peak memory consumption was 530.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 9881 with TraceHistMax 1056, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 297 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 9881 with TraceHistMax 1056, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 297 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 16). Cancelled while BasicCegarLoop was analyzing trace of length 9881 with TraceHistMax 1056, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 297 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 29). Cancelled while BasicCegarLoop was analyzing trace of length 9881 with TraceHistMax 1056, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 297 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 21). Cancelled while BasicCegarLoop was analyzing trace of length 9881 with TraceHistMax 1056, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 297 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 9881 with TraceHistMax 1056, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was doing sequential composition of 297 TransFormulas, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 6 error locations. TIMEOUT Result, 242.8s OverallTime, 29 OverallIterations, 1056 TraceHistogramMax, 59.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2429 SDtfs, 9399 SDslu, 68117 SDs, 0 SdLazy, 64279 SolverSat, 2650 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61504 GetRequests, 59050 SyntacticMatches, 168 SemanticMatches, 2286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89486 ImplicationChecksByTransitivity, 70.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 359 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 150.4s InterpolantComputationTime, 30240 NumberOfCodeBlocks, 30240 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 60424 ConstructedInterpolants, 7 QuantifiedInterpolants, 519501422 SizeOfPredicates, 753 NumberOfNonLiveVariables, 54361 ConjunctsInSsa, 1135 ConjunctsInUnsatCore, 56 InterpolantComputations, 14 PerfectInterpolantSequences, 20636258/21271180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_21-18-39-056.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_21-18-39-056.csv Completed graceful shutdown