./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 19:06:16,791 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:06:16,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:06:16,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:06:16,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:06:16,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:06:16,818 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:06:16,822 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:06:16,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:06:16,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:06:16,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:06:16,829 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:06:16,830 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:06:16,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:06:16,841 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:06:16,842 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:06:16,843 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:06:16,847 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:06:16,849 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:06:16,853 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:06:16,854 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:06:16,858 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:06:16,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:06:16,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:06:16,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:06:16,866 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:06:16,867 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:06:16,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:06:16,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:06:16,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:06:16,874 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:06:16,875 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:06:16,875 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:06:16,876 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:06:16,878 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:06:16,881 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:06:16,882 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:06:16,909 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:06:16,909 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:06:16,912 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:06:16,912 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:06:16,912 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:06:16,912 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:06:16,913 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:06:16,913 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:06:16,913 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:06:16,913 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:06:16,913 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:06:16,913 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:06:16,914 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:06:16,914 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:06:16,914 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:06:16,914 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:06:16,915 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:06:16,915 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:06:16,915 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:06:16,915 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:06:16,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:06:16,916 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:06:16,917 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:06:16,918 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:06:16,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:06:16,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97fe3d28a1849ecc88958d9d302f4fb4c5dbb992 [2019-01-14 19:06:16,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:06:16,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:06:16,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:06:16,992 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:06:16,993 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:06:16,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2019-01-14 19:06:17,056 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281fa15fc/6ffa2db84fc14e81a0c664a1410c8699/FLAG48c06c3c3 [2019-01-14 19:06:17,464 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:06:17,465 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2019-01-14 19:06:17,472 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281fa15fc/6ffa2db84fc14e81a0c664a1410c8699/FLAG48c06c3c3 [2019-01-14 19:06:17,833 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/281fa15fc/6ffa2db84fc14e81a0c664a1410c8699 [2019-01-14 19:06:17,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:06:17,839 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:06:17,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:06:17,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:06:17,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:06:17,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:06:17" (1/1) ... [2019-01-14 19:06:17,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562a7442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:17, skipping insertion in model container [2019-01-14 19:06:17,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:06:17" (1/1) ... [2019-01-14 19:06:17,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:06:17,883 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:06:18,130 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:06:18,145 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:06:18,164 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:06:18,179 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:06:18,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18 WrapperNode [2019-01-14 19:06:18,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:06:18,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:06:18,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:06:18,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:06:18,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,200 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,200 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... [2019-01-14 19:06:18,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:06:18,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:06:18,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:06:18,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:06:18,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (1/1) ... No working directory specified, using /storage/repos/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 [2019-01-14 19:06:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:06:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:06:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-01-14 19:06:18,353 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:06:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-01-14 19:06:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:06:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:06:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:06:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:06:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:06:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:06:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:06:18,818 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:06:18,819 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-14 19:06:18,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:18 BoogieIcfgContainer [2019-01-14 19:06:18,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:06:18,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:06:18,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:06:18,825 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:06:18,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:06:17" (1/3) ... [2019-01-14 19:06:18,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1f1ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:06:18, skipping insertion in model container [2019-01-14 19:06:18,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:06:18" (2/3) ... [2019-01-14 19:06:18,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c1f1ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:06:18, skipping insertion in model container [2019-01-14 19:06:18,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:18" (3/3) ... [2019-01-14 19:06:18,830 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4_true-valid-memsafety_true-termination.c [2019-01-14 19:06:18,838 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:06:18,846 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 19:06:18,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 19:06:18,882 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:06:18,883 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:06:18,883 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:06:18,883 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:06:18,883 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:06:18,883 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:06:18,883 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:06:18,884 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:06:18,884 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:06:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-01-14 19:06:18,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 19:06:18,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:18,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:18,917 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-01-14 19:06:18,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:18,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:18,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:18,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:19,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:19,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 19:06:19,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:19,118 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-14 19:06:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:19,236 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-01-14 19:06:19,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:19,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-14 19:06:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:19,249 INFO L225 Difference]: With dead ends: 58 [2019-01-14 19:06:19,249 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 19:06:19,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 19:06:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-14 19:06:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 19:06:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-14 19:06:19,295 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-01-14 19:06:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:19,296 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-14 19:06:19,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-14 19:06:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 19:06:19,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:19,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:19,297 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:19,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-01-14 19:06:19,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:19,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:19,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:19,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:19,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 19:06:19,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 19:06:19,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 19:06:19,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:19,405 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 3 states. [2019-01-14 19:06:19,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:19,543 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-01-14 19:06:19,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 19:06:19,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-01-14 19:06:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:19,548 INFO L225 Difference]: With dead ends: 49 [2019-01-14 19:06:19,548 INFO L226 Difference]: Without dead ends: 49 [2019-01-14 19:06:19,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 19:06:19,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-14 19:06:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-01-14 19:06:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 19:06:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-01-14 19:06:19,555 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-01-14 19:06:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:19,555 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-14 19:06:19,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 19:06:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-01-14 19:06:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 19:06:19,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:19,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:19,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-01-14 19:06:19,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:19,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:19,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:19,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:06:19,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:19,688 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2019-01-14 19:06:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:19,911 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-14 19:06:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:06:19,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-01-14 19:06:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:19,912 INFO L225 Difference]: With dead ends: 40 [2019-01-14 19:06:19,912 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 19:06:19,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 19:06:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-14 19:06:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 19:06:19,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-01-14 19:06:19,923 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-01-14 19:06:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:19,923 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-01-14 19:06:19,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-01-14 19:06:19,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 19:06:19,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:19,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:19,926 INFO L423 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:19,926 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-01-14 19:06:19,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:19,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:19,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:19,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:20,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:20,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:06:20,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:06:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:06:20,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:20,113 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 6 states. [2019-01-14 19:06:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:20,381 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-01-14 19:06:20,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:06:20,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-14 19:06:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:20,383 INFO L225 Difference]: With dead ends: 42 [2019-01-14 19:06:20,383 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 19:06:20,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:06:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 19:06:20,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-14 19:06:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 19:06:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 19:06:20,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-01-14 19:06:20,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:20,390 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 19:06:20,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:06:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-01-14 19:06:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 19:06:20,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:20,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:20,391 INFO L423 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:20,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:20,392 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-01-14 19:06:20,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:20,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:20,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:20,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:06:20,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:06:20,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:06:20,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:06:20,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:06:20,530 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-01-14 19:06:20,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:20,954 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-01-14 19:06:20,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 19:06:20,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-14 19:06:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:20,958 INFO L225 Difference]: With dead ends: 45 [2019-01-14 19:06:20,958 INFO L226 Difference]: Without dead ends: 42 [2019-01-14 19:06:20,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:06:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-14 19:06:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-01-14 19:06:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 19:06:20,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-01-14 19:06:20,966 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2019-01-14 19:06:20,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:20,967 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-01-14 19:06:20,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:06:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-01-14 19:06:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 19:06:20,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:20,968 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:20,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-01-14 19:06:20,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:20,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:20,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:21,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:21,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:21,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:21,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:21,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:21,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-01-14 19:06:21,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:06:21,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:06:21,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:06:21,186 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 9 states. [2019-01-14 19:06:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:21,396 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-01-14 19:06:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:06:21,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-14 19:06:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:21,405 INFO L225 Difference]: With dead ends: 47 [2019-01-14 19:06:21,405 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 19:06:21,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:06:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 19:06:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-14 19:06:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 19:06:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-01-14 19:06:21,411 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2019-01-14 19:06:21,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:21,412 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-01-14 19:06:21,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:06:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-01-14 19:06:21,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 19:06:21,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:21,413 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:21,413 INFO L423 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:21,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2019-01-14 19:06:21,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:21,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:21,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:21,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:21,752 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:21,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:21,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:22,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-01-14 19:06:22,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:06:22,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:06:22,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:06:22,065 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2019-01-14 19:06:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:22,448 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2019-01-14 19:06:22,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:06:22,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-01-14 19:06:22,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:22,454 INFO L225 Difference]: With dead ends: 59 [2019-01-14 19:06:22,454 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 19:06:22,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:06:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 19:06:22,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-01-14 19:06:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 19:06:22,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-01-14 19:06:22,467 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2019-01-14 19:06:22,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:22,468 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-01-14 19:06:22,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:06:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-01-14 19:06:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:06:22,471 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:22,471 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:22,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:22,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723374, now seen corresponding path program 2 times [2019-01-14 19:06:22,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:22,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:22,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:22,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:22,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:22,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:22,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:06:22,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:06:22,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:22,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:23,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:23,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 27 [2019-01-14 19:06:23,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 19:06:23,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:23,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:23,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:06:23,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-01-14 19:06:23,254 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-01-14 19:06:23,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:06:23,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-01-14 19:06:23,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:06:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:06:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:06:23,291 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 10 states. [2019-01-14 19:06:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:23,750 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2019-01-14 19:06:23,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:06:23,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-14 19:06:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:23,754 INFO L225 Difference]: With dead ends: 62 [2019-01-14 19:06:23,754 INFO L226 Difference]: Without dead ends: 59 [2019-01-14 19:06:23,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:06:23,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-14 19:06:23,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2019-01-14 19:06:23,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-14 19:06:23,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2019-01-14 19:06:23,760 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 35 [2019-01-14 19:06:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:23,760 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2019-01-14 19:06:23,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:06:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2019-01-14 19:06:23,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 19:06:23,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:23,762 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:23,762 INFO L423 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:23,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:23,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1819430834, now seen corresponding path program 1 times [2019-01-14 19:06:23,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:23,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:23,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:23,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:06:23,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:24,362 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-14 19:06:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:24,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:24,496 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:24,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:24,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:24,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:24,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-14 19:06:24,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 19:06:24,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 19:06:24,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:06:24,815 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 16 states. [2019-01-14 19:06:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:25,301 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-14 19:06:25,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:06:25,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-14 19:06:25,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:25,305 INFO L225 Difference]: With dead ends: 67 [2019-01-14 19:06:25,305 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 19:06:25,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2019-01-14 19:06:25,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 19:06:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-01-14 19:06:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 19:06:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-01-14 19:06:25,311 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 40 [2019-01-14 19:06:25,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:25,312 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-01-14 19:06:25,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 19:06:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-01-14 19:06:25,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 19:06:25,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:25,313 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:25,314 INFO L423 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:25,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:25,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2080753, now seen corresponding path program 2 times [2019-01-14 19:06:25,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:25,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:25,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:25,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:25,712 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2019-01-14 19:06:25,998 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2019-01-14 19:06:26,164 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:26,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:26,164 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:26,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:06:26,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:06:26,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:26,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:26,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 19:06:26,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:26,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 19:06:26,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:26,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2019-01-14 19:06:26,254 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:26,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:26,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:06:26,273 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-01-14 19:06:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-01-14 19:06:26,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:06:26,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-01-14 19:06:26,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 19:06:26,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 19:06:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:06:26,610 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 13 states. [2019-01-14 19:06:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:27,259 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-14 19:06:27,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 19:06:27,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-01-14 19:06:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:27,261 INFO L225 Difference]: With dead ends: 70 [2019-01-14 19:06:27,262 INFO L226 Difference]: Without dead ends: 67 [2019-01-14 19:06:27,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:06:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-14 19:06:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2019-01-14 19:06:27,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 19:06:27,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2019-01-14 19:06:27,268 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 45 [2019-01-14 19:06:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:27,268 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2019-01-14 19:06:27,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 19:06:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2019-01-14 19:06:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-14 19:06:27,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:27,270 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:27,270 INFO L423 AbstractCegarLoop]: === Iteration 11 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:27,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:27,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1165684695, now seen corresponding path program 1 times [2019-01-14 19:06:27,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:27,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:27,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 19:06:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-01-14 19:06:27,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:27,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:27,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:06:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:06:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 11] total 13 [2019-01-14 19:06:27,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 19:06:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 19:06:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:06:27,936 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 13 states. [2019-01-14 19:06:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:28,133 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2019-01-14 19:06:28,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 19:06:28,134 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-01-14 19:06:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:28,136 INFO L225 Difference]: With dead ends: 99 [2019-01-14 19:06:28,136 INFO L226 Difference]: Without dead ends: 96 [2019-01-14 19:06:28,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:06:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-14 19:06:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2019-01-14 19:06:28,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-14 19:06:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2019-01-14 19:06:28,144 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 59 [2019-01-14 19:06:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:28,145 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2019-01-14 19:06:28,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 19:06:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2019-01-14 19:06:28,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-14 19:06:28,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:06:28,150 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:06:28,150 INFO L423 AbstractCegarLoop]: === Iteration 12 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 19:06:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:06:28,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1970017626, now seen corresponding path program 2 times [2019-01-14 19:06:28,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:06:28,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:06:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:28,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:06:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:06:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:06:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-01-14 19:06:28,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:06:28,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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 [2019-01-14 19:06:28,274 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 19:06:28,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 19:06:28,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 19:06:28,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:06:28,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:28,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-14 19:06:28,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 19:06:28,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:28,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:28,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 19:06:28,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:28,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:06:28,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2019-01-14 19:06:28,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 19:06:28,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:06:28,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:06:28,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 19:06:28,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-01-14 19:06:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 645 trivial. 0 not checked. [2019-01-14 19:06:29,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 19:06:29,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-01-14 19:06:29,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:06:29,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:06:29,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=51, Unknown=1, NotChecked=0, Total=72 [2019-01-14 19:06:29,528 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 9 states. [2019-01-14 19:06:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:06:43,113 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2019-01-14 19:06:43,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 19:06:43,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-01-14 19:06:43,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:06:43,115 INFO L225 Difference]: With dead ends: 101 [2019-01-14 19:06:43,115 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 19:06:43,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=173, Unknown=1, NotChecked=0, Total=240 [2019-01-14 19:06:43,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 19:06:43,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 19:06:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 19:06:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 19:06:43,116 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 115 [2019-01-14 19:06:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:06:43,116 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 19:06:43,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:06:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 19:06:43,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 19:06:43,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:06:43 BoogieIcfgContainer [2019-01-14 19:06:43,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:06:43,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:06:43,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:06:43,122 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:06:43,123 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:06:18" (3/4) ... [2019-01-14 19:06:43,126 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 19:06:43,131 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 19:06:43,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-01-14 19:06:43,132 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 19:06:43,136 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-01-14 19:06:43,137 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-01-14 19:06:43,137 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 19:06:43,137 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 19:06:43,181 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:06:43,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:06:43,182 INFO L168 Benchmark]: Toolchain (without parser) took 25344.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -246.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:43,183 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:06:43,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.96 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:43,184 INFO L168 Benchmark]: Boogie Preprocessor took 45.47 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:06:43,185 INFO L168 Benchmark]: RCFGBuilder took 594.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:43,186 INFO L168 Benchmark]: TraceAbstraction took 24300.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:43,186 INFO L168 Benchmark]: Witness Printer took 59.77 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-01-14 19:06:43,190 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.96 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.47 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 594.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24300.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 124.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -80.2 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.77 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 29]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds 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: 26]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 8 error locations. SAFE Result, 24.2s OverallTime, 12 OverallIterations, 16 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 315 SDtfs, 483 SDslu, 1344 SDs, 0 SdLazy, 946 SolverSat, 81 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 444 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=11, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 63 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 740 NumberOfCodeBlocks, 588 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 721 ConstructedInterpolants, 159 QuantifiedInterpolants, 362989 SizeOfPredicates, 8 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 1511/1896 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...