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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 02:36:28,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:36:28,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:36:28,901 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:36:28,901 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:36:28,902 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:36:28,904 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:36:28,905 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:36:28,908 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:36:28,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:36:28,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:36:28,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:36:28,911 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:36:28,913 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:36:28,914 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:36:28,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:36:28,926 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:36:28,928 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:36:28,930 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:36:28,931 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:36:28,933 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:36:28,933 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:36:28,934 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:36:28,937 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:36:28,938 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:36:28,939 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:36:28,939 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:36:28,947 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:36:28,947 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:36:28,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:36:28,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:36:28,949 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 02:36:28,966 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:36:28,966 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:36:28,969 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:36:28,970 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:36:28,970 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:36:28,970 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:36:28,970 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:36:28,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:36:28,971 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:36:28,972 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 02:36:28,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:36:28,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:36:28,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:36:28,972 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 02:36:28,972 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 02:36:28,973 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 02:36:28,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:36:28,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:36:28,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:36:28,974 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:36:28,974 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:36:28,975 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:36:28,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:36:28,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:36:28,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:36:28,975 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:36:28,976 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:36:28,976 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:36:28,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:36:28,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:36:28,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:36:28,977 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:36:28,979 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:36:28,979 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:36:29,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:36:29,041 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:36:29,046 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:36:29,047 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:36:29,048 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:36:29,049 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-01-30 02:36:29,272 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:36:29,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-30 02:36:29,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:36:29,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:36:29,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:36:29,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fea89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29, skipping insertion in model container [2018-01-30 02:36:29,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,316 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:36:29,336 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:36:29,506 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:36:29,523 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:36:29,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29 WrapperNode [2018-01-30 02:36:29,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:36:29,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:36:29,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:36:29,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:36:29,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:36:29,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:36:29,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:36:29,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:36:29,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (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-01-30 02:36:29,643 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:36:29,643 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:36:29,643 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-30 02:36:29,644 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:36:29,644 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:36:29,645 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:36:29,839 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:36:29,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:36:29 BoogieIcfgContainer [2018-01-30 02:36:29,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:36:29,841 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-30 02:36:29,841 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-30 02:36:29,842 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-30 02:36:29,845 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:36:29" (1/1) ... [2018-01-30 02:36:29,853 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-30 02:36:29,853 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-30 02:36:29,854 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-30 02:36:29,892 INFO L162 apSepIcfgTransformer]: finished StoreIndexFreezer, created 6 freeze vars and freeze var literals (each corresponds to one heap write) [2018-01-30 02:36:29,920 INFO L221 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-30 02:36:29,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-30 02:36:44,862 INFO L311 AbstractInterpreter]: Visited 71 different actions 441 times. Merged at 46 different actions 243 times. Widened at 1 different actions 1 times. Found 22 fixpoints after 6 different actions. Largest state had 39 variables. [2018-01-30 02:36:44,873 INFO L229 apSepIcfgTransformer]: finished equality analysis [2018-01-30 02:36:44,887 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 1 [2018-01-30 02:36:44,888 INFO L241 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-30 02:36:44,888 INFO L242 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-30 02:36:44,889 INFO L244 apSepIcfgTransformer]: select infos: Set: ((select (select |v_#memory_int_1| v_foo_~b.base_2) (+ v_foo_~b.offset_2 v_foo_~i~1_6)), at (SUMMARY for call #t~mem1 := read~int(~b.base, ~b.offset + ~i~1 * 1, 1); srcloc: L16')) [2018-01-30 02:36:44,893 INFO L547 PartitionManager]: partitioning result: [2018-01-30 02:36:44,893 INFO L552 PartitionManager]: location blocks for array group [#memory_int] [2018-01-30 02:36:44,893 INFO L561 PartitionManager]: at dimension 0 [2018-01-30 02:36:44,893 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:36:44,894 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:36:44,894 INFO L561 PartitionManager]: at dimension 1 [2018-01-30 02:36:44,894 INFO L562 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-30 02:36:44,894 INFO L563 PartitionManager]: # location blocks :1 [2018-01-30 02:36:44,895 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-30 02:36:44,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:36:44 BasicIcfg [2018-01-30 02:36:44,918 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-30 02:36:44,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:36:44,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:36:44,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:36:44,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:36:29" (1/4) ... [2018-01-30 02:36:44,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749eac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:36:44, skipping insertion in model container [2018-01-30 02:36:44,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:36:29" (2/4) ... [2018-01-30 02:36:44,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749eac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:36:44, skipping insertion in model container [2018-01-30 02:36:44,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:36:29" (3/4) ... [2018-01-30 02:36:44,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@749eac3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:36:44, skipping insertion in model container [2018-01-30 02:36:44,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 30.01 02:36:44" (4/4) ... [2018-01-30 02:36:44,927 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-30 02:36:44,938 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:36:44,946 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-30 02:36:45,077 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:36:45,077 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:36:45,077 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:36:45,077 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:36:45,077 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:36:45,078 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:36:45,078 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:36:45,078 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:36:45,079 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:36:45,099 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-30 02:36:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-30 02:36:45,104 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:45,105 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:45,105 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:45,109 INFO L82 PathProgramCache]: Analyzing trace with hash -447742605, now seen corresponding path program 1 times [2018-01-30 02:36:45,110 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:45,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:45,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:45,153 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:45,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:45,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:45,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:36:45,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 02:36:45,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:36:45,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:36:45,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:36:45,384 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2018-01-30 02:36:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:45,556 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2018-01-30 02:36:45,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:36:45,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-30 02:36:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:45,574 INFO L225 Difference]: With dead ends: 134 [2018-01-30 02:36:45,574 INFO L226 Difference]: Without dead ends: 79 [2018-01-30 02:36:45,581 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:36:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-30 02:36:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2018-01-30 02:36:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-30 02:36:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-01-30 02:36:45,631 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 10 [2018-01-30 02:36:45,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:45,631 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-01-30 02:36:45,631 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:36:45,631 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-01-30 02:36:45,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 02:36:45,632 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:45,632 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:45,633 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:45,633 INFO L82 PathProgramCache]: Analyzing trace with hash -163205672, now seen corresponding path program 1 times [2018-01-30 02:36:45,633 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:45,633 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:45,634 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:45,634 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:45,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:45,651 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:45,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:36:45,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:36:45,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:36:45,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:36:45,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:36:45,751 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-01-30 02:36:45,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:45,882 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-01-30 02:36:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:36:45,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-30 02:36:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:45,883 INFO L225 Difference]: With dead ends: 126 [2018-01-30 02:36:45,883 INFO L226 Difference]: Without dead ends: 75 [2018-01-30 02:36:45,884 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:36:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-30 02:36:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2018-01-30 02:36:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 02:36:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-30 02:36:45,890 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 19 [2018-01-30 02:36:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:45,891 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-30 02:36:45,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:36:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-30 02:36:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 02:36:45,892 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:45,892 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:45,893 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -764408067, now seen corresponding path program 1 times [2018-01-30 02:36:45,893 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:45,893 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:45,894 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:45,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:45,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:45,905 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:45,933 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:36:45,933 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:36:45,933 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:36:45,934 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:36:45,934 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:36:45,934 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 5 states. [2018-01-30 02:36:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:45,992 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-30 02:36:45,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:36:45,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-30 02:36:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:45,993 INFO L225 Difference]: With dead ends: 68 [2018-01-30 02:36:45,994 INFO L226 Difference]: Without dead ends: 67 [2018-01-30 02:36:45,994 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-01-30 02:36:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-30 02:36:46,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-30 02:36:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-30 02:36:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-30 02:36:46,003 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 20 [2018-01-30 02:36:46,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:46,003 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-30 02:36:46,003 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:36:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-30 02:36:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 02:36:46,004 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:46,004 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:46,005 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash -764408065, now seen corresponding path program 1 times [2018-01-30 02:36:46,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:46,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:46,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:46,007 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:46,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:46,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:36:46,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:36:46,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:36:46,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:36:46,139 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:36:46,139 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 6 states. [2018-01-30 02:36:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:46,251 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2018-01-30 02:36:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:36:46,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-30 02:36:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:46,253 INFO L225 Difference]: With dead ends: 73 [2018-01-30 02:36:46,253 INFO L226 Difference]: Without dead ends: 72 [2018-01-30 02:36:46,253 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:36:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-01-30 02:36:46,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-01-30 02:36:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-30 02:36:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-01-30 02:36:46,259 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 20 [2018-01-30 02:36:46,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:46,260 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-01-30 02:36:46,260 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:36:46,260 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-01-30 02:36:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-30 02:36:46,260 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:46,261 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:46,261 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:46,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2076348503, now seen corresponding path program 1 times [2018-01-30 02:36:46,261 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:46,261 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:46,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:46,262 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:46,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:46,311 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:46,311 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:46,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:46,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:46,454 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:36:46,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-01-30 02:36:46,454 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:36:46,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:36:46,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:36:46,455 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 8 states. [2018-01-30 02:36:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:46,635 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2018-01-30 02:36:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:36:46,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-30 02:36:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:46,636 INFO L225 Difference]: With dead ends: 107 [2018-01-30 02:36:46,636 INFO L226 Difference]: Without dead ends: 86 [2018-01-30 02:36:46,636 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:36:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-30 02:36:46,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2018-01-30 02:36:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-30 02:36:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2018-01-30 02:36:46,642 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 20 [2018-01-30 02:36:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:46,643 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2018-01-30 02:36:46,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:36:46,643 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2018-01-30 02:36:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 02:36:46,644 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:46,644 INFO L350 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] [2018-01-30 02:36:46,644 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2037339621, now seen corresponding path program 1 times [2018-01-30 02:36:46,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:46,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:46,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:46,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:46,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:46,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:46,724 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:46,737 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:46,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:46,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:46,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:46,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-01-30 02:36:46,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:36:46,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:36:46,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:36:46,799 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 5 states. [2018-01-30 02:36:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:46,951 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-01-30 02:36:46,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 02:36:46,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-30 02:36:46,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:46,956 INFO L225 Difference]: With dead ends: 94 [2018-01-30 02:36:46,956 INFO L226 Difference]: Without dead ends: 93 [2018-01-30 02:36:46,956 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:36:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-30 02:36:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-01-30 02:36:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 02:36:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-01-30 02:36:46,967 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 28 [2018-01-30 02:36:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:46,967 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-01-30 02:36:46,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:36:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-01-30 02:36:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-30 02:36:46,969 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:46,969 INFO L350 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] [2018-01-30 02:36:46,969 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1266980718, now seen corresponding path program 1 times [2018-01-30 02:36:46,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:46,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:46,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:46,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:46,982 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:47,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:47,220 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:47,220 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:47,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:47,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:47,280 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-01-30 02:36:47,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:36:47,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:36:47,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:36:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:47,395 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:47,396 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-01-30 02:36:47,396 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:36:47,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:36:47,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:36:47,397 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 13 states. [2018-01-30 02:36:47,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:47,540 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-30 02:36:47,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:36:47,540 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-01-30 02:36:47,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:47,541 INFO L225 Difference]: With dead ends: 93 [2018-01-30 02:36:47,541 INFO L226 Difference]: Without dead ends: 92 [2018-01-30 02:36:47,542 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-01-30 02:36:47,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-30 02:36:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2018-01-30 02:36:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-30 02:36:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2018-01-30 02:36:47,548 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 29 [2018-01-30 02:36:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:47,549 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2018-01-30 02:36:47,549 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:36:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-01-30 02:36:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-30 02:36:47,550 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:47,550 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:47,550 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:47,551 INFO L82 PathProgramCache]: Analyzing trace with hash 241003640, now seen corresponding path program 2 times [2018-01-30 02:36:47,551 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:47,551 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:47,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:47,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:47,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:47,560 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:47,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:47,684 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:47,684 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:47,695 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:36:47,706 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:47,713 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:47,714 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:36:47,717 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:47,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:47,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2018-01-30 02:36:47,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:36:47,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:36:47,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:36:47,915 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand 15 states. [2018-01-30 02:36:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:48,200 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-30 02:36:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 02:36:48,200 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-01-30 02:36:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:48,201 INFO L225 Difference]: With dead ends: 105 [2018-01-30 02:36:48,201 INFO L226 Difference]: Without dead ends: 104 [2018-01-30 02:36:48,202 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=576, Unknown=0, NotChecked=0, Total=756 [2018-01-30 02:36:48,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-30 02:36:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 84. [2018-01-30 02:36:48,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 02:36:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-01-30 02:36:48,211 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 37 [2018-01-30 02:36:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:48,211 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-01-30 02:36:48,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:36:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-01-30 02:36:48,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 02:36:48,213 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:48,213 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:48,214 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1118821281, now seen corresponding path program 2 times [2018-01-30 02:36:48,214 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:48,214 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:48,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:48,215 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:48,215 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:48,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:48,436 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:48,436 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:48,446 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:36:48,464 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:48,468 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:48,470 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:36:48,473 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:48,476 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-01-30 02:36:48,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:36:48,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:36:48,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:36:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:48,622 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:48,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-01-30 02:36:48,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-30 02:36:48,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-30 02:36:48,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:36:48,624 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 13 states. [2018-01-30 02:36:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:48,943 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-01-30 02:36:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 02:36:48,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2018-01-30 02:36:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:48,944 INFO L225 Difference]: With dead ends: 104 [2018-01-30 02:36:48,944 INFO L226 Difference]: Without dead ends: 103 [2018-01-30 02:36:48,945 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:36:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-30 02:36:48,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2018-01-30 02:36:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-30 02:36:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-01-30 02:36:48,957 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 38 [2018-01-30 02:36:48,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:48,958 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-01-30 02:36:48,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-30 02:36:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-01-30 02:36:48,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 02:36:48,960 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:48,960 INFO L350 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:48,960 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:48,960 INFO L82 PathProgramCache]: Analyzing trace with hash -846458449, now seen corresponding path program 1 times [2018-01-30 02:36:48,960 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:48,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:48,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:48,961 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:48,962 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:48,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:49,038 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:49,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:49,038 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:49,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:49,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:49,089 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:49,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-30 02:36:49,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 02:36:49,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 02:36:49,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:36:49,090 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 9 states. [2018-01-30 02:36:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:49,191 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2018-01-30 02:36:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:36:49,192 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-01-30 02:36:49,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:49,193 INFO L225 Difference]: With dead ends: 138 [2018-01-30 02:36:49,193 INFO L226 Difference]: Without dead ends: 118 [2018-01-30 02:36:49,194 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-30 02:36:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-30 02:36:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2018-01-30 02:36:49,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-30 02:36:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-01-30 02:36:49,203 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 38 [2018-01-30 02:36:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:49,203 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-01-30 02:36:49,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 02:36:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-01-30 02:36:49,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-30 02:36:49,204 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:49,204 INFO L350 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] [2018-01-30 02:36:49,205 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:49,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1486004430, now seen corresponding path program 3 times [2018-01-30 02:36:49,205 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:49,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:49,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:49,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:49,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:49,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:36:49,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:49,427 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:49,432 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-30 02:36:49,438 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:36:49,441 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-30 02:36:49,442 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:36:49,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:49,447 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-01-30 02:36:49,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-30 02:36:49,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:36:49,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-30 02:36:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-30 02:36:49,592 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:49,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-01-30 02:36:49,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 02:36:49,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 02:36:49,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-01-30 02:36:49,593 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 17 states. [2018-01-30 02:36:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:49,824 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-01-30 02:36:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 02:36:49,824 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2018-01-30 02:36:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:49,825 INFO L225 Difference]: With dead ends: 103 [2018-01-30 02:36:49,826 INFO L226 Difference]: Without dead ends: 102 [2018-01-30 02:36:49,826 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=433, Unknown=0, NotChecked=0, Total=600 [2018-01-30 02:36:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-01-30 02:36:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 82. [2018-01-30 02:36:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-30 02:36:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-01-30 02:36:49,836 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 47 [2018-01-30 02:36:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:49,837 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-01-30 02:36:49,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 02:36:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-01-30 02:36:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-30 02:36:49,839 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:49,839 INFO L350 BasicCegarLoop]: trace histogram [4, 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] [2018-01-30 02:36:49,839 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1100265189, now seen corresponding path program 2 times [2018-01-30 02:36:49,839 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:49,839 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:49,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:49,840 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:49,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:49,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:36:49,981 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:49,981 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:49,989 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:36:50,004 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:50,013 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:36:50,016 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-01-30 02:36:50,146 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:36:50,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2018-01-30 02:36:50,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-30 02:36:50,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-30 02:36:50,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=100, Unknown=1, NotChecked=0, Total=132 [2018-01-30 02:36:50,147 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 12 states. [2018-01-30 02:36:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:50,608 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2018-01-30 02:36:50,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 02:36:50,621 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-01-30 02:36:50,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:50,622 INFO L225 Difference]: With dead ends: 125 [2018-01-30 02:36:50,622 INFO L226 Difference]: Without dead ends: 94 [2018-01-30 02:36:50,622 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=363, Unknown=1, NotChecked=0, Total=506 [2018-01-30 02:36:50,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-30 02:36:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2018-01-30 02:36:50,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-01-30 02:36:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2018-01-30 02:36:50,635 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 48 [2018-01-30 02:36:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:50,635 INFO L432 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2018-01-30 02:36:50,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-30 02:36:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2018-01-30 02:36:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-01-30 02:36:50,637 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:50,637 INFO L350 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:50,637 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:50,637 INFO L82 PathProgramCache]: Analyzing trace with hash 124901911, now seen corresponding path program 1 times [2018-01-30 02:36:50,637 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:50,638 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:50,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:50,639 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-30 02:36:50,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:50,646 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:50,702 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2018-01-30 02:36:50,703 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:50,703 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:50,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:50,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-30 02:36:50,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:50,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 15 [2018-01-30 02:36:50,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-30 02:36:50,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-30 02:36:50,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:36:50,890 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 15 states. [2018-01-30 02:36:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:51,251 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2018-01-30 02:36:51,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-30 02:36:51,251 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2018-01-30 02:36:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:51,252 INFO L225 Difference]: With dead ends: 123 [2018-01-30 02:36:51,252 INFO L226 Difference]: Without dead ends: 111 [2018-01-30 02:36:51,252 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2018-01-30 02:36:51,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-30 02:36:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2018-01-30 02:36:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-30 02:36:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-01-30 02:36:51,260 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 60 [2018-01-30 02:36:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:51,261 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-01-30 02:36:51,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-30 02:36:51,261 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-01-30 02:36:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-30 02:36:51,262 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:36:51,262 INFO L350 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:36:51,262 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-30 02:36:51,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2076866068, now seen corresponding path program 2 times [2018-01-30 02:36:51,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:36:51,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:36:51,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:51,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:36:51,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:36:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:36:51,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:36:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-01-30 02:36:51,351 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:36:51,351 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:36:51,361 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-30 02:36:51,369 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:51,378 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-30 02:36:51,380 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-30 02:36:51,383 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:36:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-01-30 02:36:51,582 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 02:36:51,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13] total 19 [2018-01-30 02:36:51,583 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-30 02:36:51,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-30 02:36:51,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-30 02:36:51,584 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 19 states. [2018-01-30 02:36:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:36:52,090 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2018-01-30 02:36:52,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 02:36:52,090 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-01-30 02:36:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:36:52,091 INFO L225 Difference]: With dead ends: 139 [2018-01-30 02:36:52,091 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 02:36:52,092 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2018-01-30 02:36:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 02:36:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 02:36:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 02:36:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 02:36:52,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-01-30 02:36:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:36:52,093 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 02:36:52,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-30 02:36:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 02:36:52,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 02:36:52,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 02:36:52,177 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,214 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,248 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,284 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,317 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,349 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,381 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-30 02:36:52,559 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 29 DAG size of output 1 [2018-01-30 02:36:52,884 WARN L146 SmtUtils]: Spent 324ms on a formula simplification. DAG size of input: 26 DAG size of output 21 [2018-01-30 02:36:53,055 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 57 DAG size of output 39 [2018-01-30 02:36:53,180 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point fooFINAL(lines 12 19) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point L15''''(line 15) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point L15'''''(line 15) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point fooEXIT(lines 12 19) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L395 ceAbstractionStarter]: At program point L15''''''(lines 15 17) the Hoare annotation is: (let ((.cse1 (= foo_~size 32)) (.cse0 (select |#length| foo_~b.base)) (.cse2 (= 1 (select |#valid| foo_~b.base)))) (or (not (= (select |#valid| |foo_#in~b.base|) 1)) (not (= 32 |foo_#in~size|)) (and (= .cse0 32) (<= foo_~b.offset 0) .cse1 .cse2 (<= 0 foo_~b.offset) (= foo_~i~1 0)) (< 0 |foo_#in~b.offset|) (and .cse1 (= 32 .cse0) .cse2 (<= 1 (+ foo_~i~1 foo_~b.offset)) (= foo_~b.offset 0)) (< |foo_#in~b.offset| 0) (not (= 32 (select |#length| |foo_#in~b.base|))))) [2018-01-30 02:36:53,181 INFO L402 ceAbstractionStarter]: At program point fooENTRY(lines 12 19) the Hoare annotation is: true [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point L15'''''''(lines 15 17) no Hoare annotation was computed. [2018-01-30 02:36:53,181 INFO L399 ceAbstractionStarter]: For program point L12(lines 12 19) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L15'''(lines 15 17) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L16'''(line 16) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L15'(lines 15 17) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L16'(line 16) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point L16''(line 16) no Hoare annotation was computed. [2018-01-30 02:36:53,182 INFO L399 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 16) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 34) the Hoare annotation is: true [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 34) the Hoare annotation is: true [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 34) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L395 ceAbstractionStarter]: At program point L25'''''(lines 25 27) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point L28''''(line 28) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point mainErr0AssertViolation(line 26) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point mainErr2EnsuresViolation(lines 21 34) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point mainErr1AssertViolation(line 29) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-01-30 02:36:53,183 INFO L395 ceAbstractionStarter]: At program point L28'''''(lines 28 32) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (= main_~i~3 0) .cse2 .cse3))) [2018-01-30 02:36:53,183 INFO L399 ceAbstractionStarter]: For program point L25(lines 25 27) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L25'''(line 25) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L28(lines 28 32) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L24''''(line 24) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L25''''''(lines 25 27) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L29'(lines 29 31) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L24'''''(line 24) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L28''''''(lines 28 32) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L25''''(line 25) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L26''''(line 26) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 21 34) no Hoare annotation was computed. [2018-01-30 02:36:53,184 INFO L399 ceAbstractionStarter]: For program point L24''(line 24) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L25''(lines 25 27) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 21 34) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 21 34) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L24'''(line 24) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L395 ceAbstractionStarter]: At program point L26'(line 26) the Hoare annotation is: (let ((.cse0 (= 32 (select |#length| |main_~#mask~3.base|))) (.cse1 (= (store |old(#valid)| |main_~#mask~3.base| 1) |#valid|)) (.cse2 (= 0 (select |old(#valid)| |main_~#mask~3.base|))) (.cse3 (= 0 |main_~#mask~3.offset|))) (or (and .cse0 .cse1 (= 0 main_~i~3) .cse2 .cse3) (and (<= 1 main_~i~3) .cse0 .cse1 .cse2 .cse3 (<= main_~i~3 31)))) [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L28''(lines 28 32) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L26''(line 26) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L24'(line 24) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L26'''(line 26) no Hoare annotation was computed. [2018-01-30 02:36:53,185 INFO L399 ceAbstractionStarter]: For program point L28'''(line 28) no Hoare annotation was computed. [2018-01-30 02:36:53,190 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,191 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,193 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,196 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,198 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,199 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,200 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,201 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:36:53 BasicIcfg [2018-01-30 02:36:53,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:36:53,204 INFO L168 Benchmark]: Toolchain (without parser) took 23931.54 ms. Allocated memory was 308.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 269.2 MB in the beginning and 1.1 GB in the end (delta: -818.0 MB). Peak memory consumption was 342.2 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:53,205 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:36:53,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.37 ms. Allocated memory is still 308.3 MB. Free memory was 268.2 MB in the beginning and 260.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:53,206 INFO L168 Benchmark]: Boogie Preprocessor took 56.12 ms. Allocated memory is still 308.3 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:53,206 INFO L168 Benchmark]: RCFGBuilder took 247.59 ms. Allocated memory is still 308.3 MB. Free memory was 258.2 MB in the beginning and 241.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:53,207 INFO L168 Benchmark]: IcfgTransformer took 15077.36 ms. Allocated memory was 308.3 MB in the beginning and 1.2 GB in the end (delta: 940.0 MB). Free memory was 241.2 MB in the beginning and 195.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 986.0 MB. Max. memory is 5.3 GB. [2018-01-30 02:36:53,207 INFO L168 Benchmark]: TraceAbstraction took 8284.32 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 220.2 MB). Free memory was 195.2 MB in the beginning and 1.1 GB in the end (delta: -892.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:36:53,209 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.21 ms. Allocated memory is still 308.3 MB. Free memory is still 274.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 246.37 ms. Allocated memory is still 308.3 MB. Free memory was 268.2 MB in the beginning and 260.2 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 56.12 ms. Allocated memory is still 308.3 MB. Free memory was 260.2 MB in the beginning and 258.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 247.59 ms. Allocated memory is still 308.3 MB. Free memory was 258.2 MB in the beginning and 241.2 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 15077.36 ms. Allocated memory was 308.3 MB in the beginning and 1.2 GB in the end (delta: 940.0 MB). Free memory was 241.2 MB in the beginning and 195.2 MB in the end (delta: 46.0 MB). Peak memory consumption was 986.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8284.32 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 220.2 MB). Free memory was 195.2 MB in the beginning and 1.1 GB in the end (delta: -892.0 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 60 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 1038 LocStat_NO_SUPPORTING_DISEQUALITIES : 461 LocStat_NO_DISJUNCTIONS : -120 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 80 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 102 TransStat_NO_SUPPORTING_DISEQUALITIES : 7 TransStat_NO_DISJUNCTIONS : 81 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.288722 RENAME_VARIABLES(MILLISECONDS) : 0.161249 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.256037 PROJECTAWAY(MILLISECONDS) : 0.323055 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.071430 DISJOIN(MILLISECONDS) : 0.313440 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.181014 ADD_EQUALITY(MILLISECONDS) : 0.031311 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.058757 #CONJOIN_DISJUNCTIVE : 682 #RENAME_VARIABLES : 1511 #UNFREEZE : 0 #CONJOIN : 957 #PROJECTAWAY : 898 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 219 #RENAME_VARIABLES_DISJUNCTIVE : 1494 #ADD_EQUALITY : 102 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int] : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 29]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant [2018-01-30 02:36:53,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,216 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,217 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,218 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - InvariantResult [Line: 15]: Loop Invariant [2018-01-30 02:36:53,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,219 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,221 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[b] == 1) || !(32 == \old(size))) || (((((unknown-#length-unknown[b] == 32 && b <= 0) && size == 32) && 1 == \valid[b]) && 0 <= b) && i == 0)) || 0 < b) || ((((size == 32 && 32 == unknown-#length-unknown[b]) && 1 == \valid[b]) && 1 <= i + b) && b == 0)) || b < 0) || !(32 == unknown-#length-unknown[b]) - InvariantResult [Line: 28]: Loop Invariant [2018-01-30 02:36:53,222 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,223 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-30 02:36:53,224 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((1 <= i && 32 == unknown-#length-unknown[mask]) && \old(\valid)[mask := 1] == \valid) && 0 == \old(\valid)[mask]) && 0 == mask) || ((((32 == unknown-#length-unknown[mask] && \old(\valid)[mask := 1] == \valid) && i == 0) && 0 == \old(\valid)[mask]) && 0 == mask) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 62 locations, 6 error locations. SAFE Result, 8.1s OverallTime, 14 OverallIterations, 6 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 775 SDtfs, 1078 SDslu, 3375 SDs, 0 SdLazy, 1412 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 585 GetRequests, 372 SyntacticMatches, 8 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=10, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 136 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 25 PreInvPairs, 49 NumberOfFragments, 223 HoareAnnotationTreeSize, 25 FomulaSimplifications, 2777 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 796 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 913 NumberOfCodeBlocks, 865 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 889 ConstructedInterpolants, 2 QuantifiedInterpolants, 192649 SizeOfPredicates, 52 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 316/650 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! 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_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-30_02-36-53-229.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_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-30_02-36-53-229.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_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-30_02-36-53-229.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_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-30_02-36-53-229.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_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-36-53-229.csv Received shutdown request...