./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.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-30f4e4a [2019-11-28 02:37:35,524 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:37:35,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:37:35,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:37:35,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:37:35,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:37:35,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:37:35,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:37:35,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:37:35,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:37:35,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:37:35,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:37:35,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:37:35,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:37:35,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:37:35,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:37:35,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:37:35,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:37:35,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:37:35,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:37:35,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:37:35,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:37:35,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:37:35,599 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:37:35,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:37:35,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:37:35,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:37:35,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:37:35,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:37:35,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:37:35,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:37:35,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:37:35,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:37:35,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:37:35,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:37:35,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:37:35,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:37:35,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:37:35,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:37:35,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:37:35,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:37:35,617 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 02:37:35,635 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:37:35,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:37:35,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:37:35,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:37:35,637 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:37:35,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:37:35,638 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 02:37:35,638 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:37:35,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:37:35,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 02:37:35,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:37:35,639 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:37:35,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:37:35,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:37:35,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:37:35,640 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:37:35,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 02:37:35,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:37:35,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:37:35,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:37:35,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:37:35,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:37:35,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:37:35,643 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:37:35,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:37:35,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:37:35,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:37:35,644 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-11-28 02:37:35,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:37:35,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:37:35,990 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:37:35,994 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:37:35,994 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:37:35,995 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2019-11-28 02:37:36,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f2241e7/50a1f42798d143479262e7371c8faa60/FLAG7209ec0a2 [2019-11-28 02:37:36,482 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:37:36,484 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2019-11-28 02:37:36,491 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f2241e7/50a1f42798d143479262e7371c8faa60/FLAG7209ec0a2 [2019-11-28 02:37:36,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82f2241e7/50a1f42798d143479262e7371c8faa60 [2019-11-28 02:37:36,860 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:37:36,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:37:36,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:36,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:37:36,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:37:36,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:36" (1/1) ... [2019-11-28 02:37:36,874 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6822e6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:36, skipping insertion in model container [2019-11-28 02:37:36,874 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:37:36" (1/1) ... [2019-11-28 02:37:36,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:37:36,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:37:37,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:37,143 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:37:37,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:37:37,188 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:37:37,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37 WrapperNode [2019-11-28 02:37:37,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:37:37,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:37:37,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:37:37,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:37:37,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (1/1) ... [2019-11-28 02:37:37,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:37:37,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:37:37,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:37:37,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:37:37,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (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-11-28 02:37:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:37:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:37:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-11-28 02:37:37,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:37:37,392 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-11-28 02:37:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:37:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:37:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:37:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:37:37,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:37:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:37:37,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:37:37,745 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:37:37,745 INFO L297 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 02:37:37,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:37 BoogieIcfgContainer [2019-11-28 02:37:37,747 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:37:37,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:37:37,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:37:37,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:37:37,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:37:36" (1/3) ... [2019-11-28 02:37:37,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b4186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:37, skipping insertion in model container [2019-11-28 02:37:37,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:37:37" (2/3) ... [2019-11-28 02:37:37,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c8b4186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:37:37, skipping insertion in model container [2019-11-28 02:37:37,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:37" (3/3) ... [2019-11-28 02:37:37,757 INFO L109 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4.c [2019-11-28 02:37:37,767 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:37:37,776 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-28 02:37:37,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-28 02:37:37,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:37:37,810 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:37:37,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:37:37,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:37:37,812 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:37:37,812 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:37:37,812 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:37:37,812 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:37:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-28 02:37:37,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 02:37:37,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:37,837 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:37,837 INFO L410 AbstractCegarLoop]: === Iteration 1 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1909189377, now seen corresponding path program 1 times [2019-11-28 02:37:37,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:37,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599348524] [2019-11-28 02:37:37,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:38,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599348524] [2019-11-28 02:37:38,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:38,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:37:38,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616323087] [2019-11-28 02:37:38,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:38,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:38,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:38,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:38,093 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-28 02:37:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:38,286 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2019-11-28 02:37:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:38,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 02:37:38,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:38,298 INFO L225 Difference]: With dead ends: 58 [2019-11-28 02:37:38,299 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:38,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:38,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-11-28 02:37:38,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:38,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:38,353 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2019-11-28 02:37:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:38,354 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:38,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 02:37:38,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:38,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:38,355 INFO L410 AbstractCegarLoop]: === Iteration 2 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash -941983064, now seen corresponding path program 1 times [2019-11-28 02:37:38,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:38,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599075803] [2019-11-28 02:37:38,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:38,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599075803] [2019-11-28 02:37:38,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:38,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:38,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411340039] [2019-11-28 02:37:38,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:38,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:38,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:38,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:38,446 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 4 states. [2019-11-28 02:37:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:38,593 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-11-28 02:37:38,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:38,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 02:37:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:38,600 INFO L225 Difference]: With dead ends: 49 [2019-11-28 02:37:38,600 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 02:37:38,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:38,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 02:37:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2019-11-28 02:37:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 02:37:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-11-28 02:37:38,612 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 11 [2019-11-28 02:37:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:38,613 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-11-28 02:37:38,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-11-28 02:37:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:38,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:38,615 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:38,615 INFO L410 AbstractCegarLoop]: === Iteration 3 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash 863296133, now seen corresponding path program 1 times [2019-11-28 02:37:38,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:38,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905982353] [2019-11-28 02:37:38,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:38,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905982353] [2019-11-28 02:37:38,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:38,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:38,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799024476] [2019-11-28 02:37:38,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:38,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 02:37:38,724 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2019-11-28 02:37:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:38,864 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-28 02:37:38,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:38,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-28 02:37:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:38,866 INFO L225 Difference]: With dead ends: 40 [2019-11-28 02:37:38,866 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 02:37:38,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:37:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 02:37:38,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-28 02:37:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:37:38,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-11-28 02:37:38,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 12 [2019-11-28 02:37:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:38,877 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-11-28 02:37:38,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-11-28 02:37:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:37:38,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:38,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:38,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:38,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash 863296134, now seen corresponding path program 1 times [2019-11-28 02:37:38,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:38,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56917459] [2019-11-28 02:37:38,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56917459] [2019-11-28 02:37:39,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 02:37:39,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448412451] [2019-11-28 02:37:39,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:37:39,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:37:39,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:39,032 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 7 states. [2019-11-28 02:37:39,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,214 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-28 02:37:39,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:37:39,215 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-11-28 02:37:39,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,216 INFO L225 Difference]: With dead ends: 42 [2019-11-28 02:37:39,217 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:37:39,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:37:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 02:37:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-28 02:37:39,224 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 12 [2019-11-28 02:37:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,225 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-28 02:37:39,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:37:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-11-28 02:37:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 02:37:39,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,227 INFO L410 AbstractCegarLoop]: === Iteration 5 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,228 INFO L82 PathProgramCache]: Analyzing trace with hash 143250926, now seen corresponding path program 1 times [2019-11-28 02:37:39,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552619815] [2019-11-28 02:37:39,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552619815] [2019-11-28 02:37:39,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:39,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 02:37:39,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434859250] [2019-11-28 02:37:39,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:37:39,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:37:39,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:37:39,354 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2019-11-28 02:37:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:39,508 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-28 02:37:39,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:39,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-28 02:37:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:39,510 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:37:39,510 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 02:37:39,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:37:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 02:37:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 02:37:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 02:37:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-28 02:37:39,523 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 15 [2019-11-28 02:37:39,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:39,523 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-28 02:37:39,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:37:39,524 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-28 02:37:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:37:39,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:39,526 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:39,528 INFO L410 AbstractCegarLoop]: === Iteration 6 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:39,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:39,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1623425863, now seen corresponding path program 1 times [2019-11-28 02:37:39,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:39,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629475002] [2019-11-28 02:37:39,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629475002] [2019-11-28 02:37:39,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339230903] [2019-11-28 02:37:39,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:39,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:37:39,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:39,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:39,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3] total 9 [2019-11-28 02:37:39,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178845322] [2019-11-28 02:37:39,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:37:39,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:39,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:37:39,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:39,776 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 10 states. [2019-11-28 02:37:40,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,042 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2019-11-28 02:37:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:37:40,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-11-28 02:37:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,046 INFO L225 Difference]: With dead ends: 47 [2019-11-28 02:37:40,046 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 02:37:40,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-11-28 02:37:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 02:37:40,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 02:37:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 02:37:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2019-11-28 02:37:40,052 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 16 [2019-11-28 02:37:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,052 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2019-11-28 02:37:40,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:37:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2019-11-28 02:37:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:37:40,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,054 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:40,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:40,258 INFO L410 AbstractCegarLoop]: === Iteration 7 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:40,259 INFO L82 PathProgramCache]: Analyzing trace with hash -661735507, now seen corresponding path program 1 times [2019-11-28 02:37:40,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:40,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985042237] [2019-11-28 02:37:40,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,359 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-28 02:37:40,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985042237] [2019-11-28 02:37:40,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:37:40,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:37:40,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257393691] [2019-11-28 02:37:40,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:37:40,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:37:40,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:40,361 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 4 states. [2019-11-28 02:37:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:40,418 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2019-11-28 02:37:40,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:37:40,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-28 02:37:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:40,422 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:37:40,422 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 02:37:40,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:37:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 02:37:40,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-28 02:37:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 02:37:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-28 02:37:40,427 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 30 [2019-11-28 02:37:40,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:40,427 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-28 02:37:40,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:37:40,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-28 02:37:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 02:37:40,429 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:40,429 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:40,429 INFO L410 AbstractCegarLoop]: === Iteration 8 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:40,430 INFO L82 PathProgramCache]: Analyzing trace with hash -661735506, now seen corresponding path program 1 times [2019-11-28 02:37:40,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:40,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431740605] [2019-11-28 02:37:40,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431740605] [2019-11-28 02:37:40,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308588092] [2019-11-28 02:37:40,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:40,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:37:40,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:40,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:40,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-28 02:37:40,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919393270] [2019-11-28 02:37:40,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:37:40,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:40,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:37:40,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:37:40,810 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 13 states. [2019-11-28 02:37:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:41,202 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2019-11-28 02:37:41,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:37:41,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-28 02:37:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:41,205 INFO L225 Difference]: With dead ends: 57 [2019-11-28 02:37:41,207 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:37:41,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 02:37:41,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:37:41,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-11-28 02:37:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:37:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-28 02:37:41,221 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 30 [2019-11-28 02:37:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:41,223 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-28 02:37:41,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:37:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-28 02:37:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 02:37:41,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:41,226 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:37:41,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,431 INFO L410 AbstractCegarLoop]: === Iteration 9 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1228723375, now seen corresponding path program 2 times [2019-11-28 02:37:41,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:41,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016572507] [2019-11-28 02:37:41,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:41,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016572507] [2019-11-28 02:37:41,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12997079] [2019-11-28 02:37:41,692 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:41,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:41,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:41,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:41,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:41,756 INFO L404 ElimStorePlain]: Different costs {0=[|v_#length_12|], 1=[|v_#valid_24|]} [2019-11-28 02:37:41,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:41,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 11 [2019-11-28 02:37:41,774 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:41,786 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:41,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 02:37:41,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-28 02:37:41,792 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:41,800 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:41,801 INFO L508 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-11-28 02:37:41,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 02:37:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 02:37:41,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:41,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2019-11-28 02:37:41,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094144496] [2019-11-28 02:37:41,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:37:41,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:41,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:37:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:41,959 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2019-11-28 02:37:42,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:42,002 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-28 02:37:42,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:37:42,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-28 02:37:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:42,004 INFO L225 Difference]: With dead ends: 48 [2019-11-28 02:37:42,004 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 02:37:42,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:37:42,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 02:37:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 02:37:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 02:37:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2019-11-28 02:37:42,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 35 [2019-11-28 02:37:42,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:42,009 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2019-11-28 02:37:42,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:37:42,009 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2019-11-28 02:37:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 02:37:42,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:42,011 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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-11-28 02:37:42,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,212 INFO L410 AbstractCegarLoop]: === Iteration 10 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:42,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1738652280, now seen corresponding path program 1 times [2019-11-28 02:37:42,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:42,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438017062] [2019-11-28 02:37:42,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-11-28 02:37:42,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438017062] [2019-11-28 02:37:42,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146145838] [2019-11-28 02:37:42,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:42,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:42,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:37:42,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:37:42,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2019-11-28 02:37:42,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115669589] [2019-11-28 02:37:42,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:37:42,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:42,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:37:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:42,428 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 11 states. [2019-11-28 02:37:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:42,701 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2019-11-28 02:37:42,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:37:42,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2019-11-28 02:37:42,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:42,703 INFO L225 Difference]: With dead ends: 84 [2019-11-28 02:37:42,703 INFO L226 Difference]: Without dead ends: 81 [2019-11-28 02:37:42,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-11-28 02:37:42,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-28 02:37:42,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2019-11-28 02:37:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-28 02:37:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-11-28 02:37:42,723 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 44 [2019-11-28 02:37:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:42,723 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-11-28 02:37:42,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:37:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-11-28 02:37:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-28 02:37:42,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:37:42,732 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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-11-28 02:37:42,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:42,936 INFO L410 AbstractCegarLoop]: === Iteration 11 === [fooErr1REQUIRES_VIOLATION, fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:37:42,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:37:42,936 INFO L82 PathProgramCache]: Analyzing trace with hash -950238676, now seen corresponding path program 2 times [2019-11-28 02:37:42,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:37:42,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134256890] [2019-11-28 02:37:42,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:37:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:37:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-28 02:37:43,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134256890] [2019-11-28 02:37:43,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436306693] [2019-11-28 02:37:43,081 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:37:43,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:37:43,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:37:43,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:37:43,191 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:43,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 02:37:43,192 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:43,201 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:43,202 INFO L508 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-11-28 02:37:43,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:43,354 INFO L343 Elim1Store]: treesize reduction 14, result has 50.0 percent of original size [2019-11-28 02:37:43,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 29 [2019-11-28 02:37:43,355 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:37:43,361 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:37:43,362 INFO L508 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-11-28 02:37:43,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2019-11-28 02:37:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-11-28 02:37:43,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:37:43,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2019-11-28 02:37:43,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973640751] [2019-11-28 02:37:43,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:37:43,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:37:43,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:37:43,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:37:43,502 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 6 states. [2019-11-28 02:37:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:37:43,579 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-28 02:37:43,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:37:43,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-11-28 02:37:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:37:43,581 INFO L225 Difference]: With dead ends: 62 [2019-11-28 02:37:43,581 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 02:37:43,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:37:43,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 02:37:43,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 02:37:43,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 02:37:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 02:37:43,587 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2019-11-28 02:37:43,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:37:43,587 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 02:37:43,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:37:43,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 02:37:43,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 02:37:43,788 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:37:43,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:37:43 BoogieIcfgContainer [2019-11-28 02:37:43,793 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:37:43,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:37:43,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:37:43,793 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:37:43,794 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:37:37" (3/4) ... [2019-11-28 02:37:43,798 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 02:37:43,804 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-28 02:37:43,804 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2019-11-28 02:37:43,805 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-28 02:37:43,809 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2019-11-28 02:37:43,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-28 02:37:43,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 02:37:43,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 02:37:43,854 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:37:43,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:37:43,857 INFO L168 Benchmark]: Toolchain (without parser) took 6994.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 955.0 MB in the beginning and 899.4 MB in the end (delta: 55.6 MB). Peak memory consumption was 260.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:43,857 INFO L168 Benchmark]: CDTParser took 1.55 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:43,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.23 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:43,862 INFO L168 Benchmark]: Boogie Preprocessor took 143.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:43,863 INFO L168 Benchmark]: RCFGBuilder took 413.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:43,864 INFO L168 Benchmark]: TraceAbstraction took 6044.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 899.4 MB in the end (delta: 211.1 MB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:37:43,865 INFO L168 Benchmark]: Witness Printer took 62.20 ms. Allocated memory is still 1.2 GB. Free memory is still 899.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:37:43,867 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.55 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 324.23 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 143.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 413.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6044.64 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.1 GB in the beginning and 899.4 MB in the end (delta: 211.1 MB). Peak memory consumption was 275.6 MB. Max. memory is 11.5 GB. * Witness Printer took 62.20 ms. Allocated memory is still 1.2 GB. Free memory is still 899.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 16]: 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 - 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. Result: SAFE, OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 280 SDtfs, 478 SDslu, 686 SDs, 0 SdLazy, 820 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 220 SyntacticMatches, 4 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 51 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 510 NumberOfCodeBlocks, 418 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 494 ConstructedInterpolants, 90 QuantifiedInterpolants, 182724 SizeOfPredicates, 5 NumberOfNonLiveVariables, 450 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 596/712 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...