./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/NonTermination3-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/NonTermination3-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 76e89a58b9c6f7059fcf416ee7a1666558a3d440 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 02:47:14,923 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:47:14,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:47:14,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:47:14,938 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:47:14,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:47:14,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:47:14,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:47:14,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:47:14,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:47:14,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:47:14,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:47:14,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:47:14,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:47:14,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:47:14,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:47:14,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:47:14,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:47:14,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:47:14,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:47:14,962 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:47:14,963 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:47:14,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:47:14,965 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:47:14,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:47:14,969 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:47:14,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:47:14,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:47:14,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:47:14,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:47:14,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:47:14,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:47:14,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:47:14,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:47:14,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:47:14,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:47:14,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:47:14,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:47:14,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:47:14,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:47:14,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:47:14,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-28 02:47:15,016 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:47:15,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:47:15,019 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:47:15,019 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:47:15,019 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:47:15,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:47:15,020 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:47:15,020 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:47:15,020 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:47:15,020 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 02:47:15,021 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 02:47:15,022 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 02:47:15,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 02:47:15,022 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 02:47:15,023 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:47:15,023 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:47:15,023 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:47:15,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 02:47:15,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 02:47:15,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 02:47:15,024 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:47:15,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 02:47:15,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:47:15,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 02:47:15,025 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76e89a58b9c6f7059fcf416ee7a1666558a3d440 [2019-11-28 02:47:15,335 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:47:15,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:47:15,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:47:15,353 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:47:15,354 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:47:15,354 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2019-11-28 02:47:15,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea67455b/89a66904878a45eaac7d4a2e2202157e/FLAGc9647bd6f [2019-11-28 02:47:15,840 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:47:15,843 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NonTermination3-1.c [2019-11-28 02:47:15,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea67455b/89a66904878a45eaac7d4a2e2202157e/FLAGc9647bd6f [2019-11-28 02:47:16,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aea67455b/89a66904878a45eaac7d4a2e2202157e [2019-11-28 02:47:16,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:47:16,203 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 02:47:16,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:16,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:47:16,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:47:16,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad95f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16, skipping insertion in model container [2019-11-28 02:47:16,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:47:16,242 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:47:16,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:16,421 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:47:16,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:47:16,462 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:47:16,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16 WrapperNode [2019-11-28 02:47:16,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:47:16,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:47:16,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:47:16,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:47:16,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (1/1) ... [2019-11-28 02:47:16,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:47:16,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:47:16,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:47:16,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:47:16,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (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:47:16,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 02:47:16,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:47:16,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 02:47:16,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 02:47:16,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 02:47:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 02:47:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 02:47:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 02:47:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 02:47:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 02:47:16,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:47:16,913 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:47:16,914 INFO L297 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-28 02:47:16,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:16 BoogieIcfgContainer [2019-11-28 02:47:16,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:47:16,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 02:47:16,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 02:47:16,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 02:47:16,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:16" (1/3) ... [2019-11-28 02:47:16,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3973d9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:16, skipping insertion in model container [2019-11-28 02:47:16,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:16" (2/3) ... [2019-11-28 02:47:16,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3973d9db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:16, skipping insertion in model container [2019-11-28 02:47:16,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:16" (3/3) ... [2019-11-28 02:47:16,935 INFO L109 eAbstractionObserver]: Analyzing ICFG NonTermination3-1.c [2019-11-28 02:47:16,942 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 02:47:16,949 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-11-28 02:47:16,962 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-11-28 02:47:16,985 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 02:47:16,985 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 02:47:16,986 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 02:47:16,986 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:47:16,986 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:47:16,986 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 02:47:16,986 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:47:16,987 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 02:47:17,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 02:47:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:47:17,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:17,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:17,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1254763092, now seen corresponding path program 1 times [2019-11-28 02:47:17,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:17,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116271509] [2019-11-28 02:47:17,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,314 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:47:17,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116271509] [2019-11-28 02:47:17,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:17,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:17,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282295929] [2019-11-28 02:47:17,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:17,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:17,348 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 4 states. [2019-11-28 02:47:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:17,497 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 02:47:17,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:17,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:47:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:17,514 INFO L225 Difference]: With dead ends: 33 [2019-11-28 02:47:17,514 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:47:17,520 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:17,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:47:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-11-28 02:47:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:47:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-11-28 02:47:17,570 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 8 [2019-11-28 02:47:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:17,571 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-11-28 02:47:17,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-11-28 02:47:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 02:47:17,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:17,573 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:17,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:17,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:17,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1254763091, now seen corresponding path program 1 times [2019-11-28 02:47:17,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:17,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769471798] [2019-11-28 02:47:17,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,680 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:47:17,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769471798] [2019-11-28 02:47:17,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:17,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 02:47:17,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323246140] [2019-11-28 02:47:17,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:17,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:17,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:17,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:17,686 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2019-11-28 02:47:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:17,772 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-28 02:47:17,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:17,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-28 02:47:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:17,774 INFO L225 Difference]: With dead ends: 24 [2019-11-28 02:47:17,774 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 02:47:17,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:47:17,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 02:47:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-28 02:47:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:47:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 02:47:17,783 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 8 [2019-11-28 02:47:17,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:17,783 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 02:47:17,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-28 02:47:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 02:47:17,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:17,785 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:17,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash 707835031, now seen corresponding path program 1 times [2019-11-28 02:47:17,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:17,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783755673] [2019-11-28 02:47:17,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,919 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:47:17,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783755673] [2019-11-28 02:47:17,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055598362] [2019-11-28 02:47:17,920 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:47:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:17,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:17,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:18,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:18,065 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:18,095 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:18,097 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:18,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:47:18,120 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:47:18,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:18,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-11-28 02:47:18,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590805880] [2019-11-28 02:47:18,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:18,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:18,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:18,124 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-11-28 02:47:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:18,238 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 02:47:18,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:18,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-28 02:47:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:18,240 INFO L225 Difference]: With dead ends: 30 [2019-11-28 02:47:18,240 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 02:47:18,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:47:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 02:47:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-11-28 02:47:18,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 02:47:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 02:47:18,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 12 [2019-11-28 02:47:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:18,248 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 02:47:18,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:18,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 02:47:18,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 02:47:18,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:18,249 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:18,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:18,455 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2098043558, now seen corresponding path program 2 times [2019-11-28 02:47:18,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:18,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380886632] [2019-11-28 02:47:18,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:18,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380886632] [2019-11-28 02:47:18,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410315054] [2019-11-28 02:47:18,619 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 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:47:18,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:47:18,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:18,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:18,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:18,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:18,693 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:18,705 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:18,706 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:18,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 02:47:18,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:18,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:18,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-28 02:47:18,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75637197] [2019-11-28 02:47:18,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 02:47:18,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:18,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 02:47:18,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:18,799 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-11-28 02:47:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:18,855 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2019-11-28 02:47:18,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:18,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 02:47:18,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:18,858 INFO L225 Difference]: With dead ends: 29 [2019-11-28 02:47:18,858 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 02:47:18,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 02:47:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-28 02:47:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 02:47:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-28 02:47:18,868 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2019-11-28 02:47:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:18,869 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-28 02:47:18,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 02:47:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-28 02:47:18,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 02:47:18,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:18,870 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:19,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:19,072 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:19,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1880246455, now seen corresponding path program 1 times [2019-11-28 02:47:19,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:19,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093679923] [2019-11-28 02:47:19,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:19,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:19,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093679923] [2019-11-28 02:47:19,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418044463] [2019-11-28 02:47:19,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:47:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:19,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:47:19,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:19,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:19,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:19,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-28 02:47:19,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337426029] [2019-11-28 02:47:19,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 02:47:19,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:19,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 02:47:19,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:19,214 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2019-11-28 02:47:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:19,278 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 02:47:19,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:19,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-11-28 02:47:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:19,280 INFO L225 Difference]: With dead ends: 33 [2019-11-28 02:47:19,280 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 02:47:19,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 02:47:19,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 02:47:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-28 02:47:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:47:19,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-28 02:47:19,286 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 18 [2019-11-28 02:47:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:19,286 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-28 02:47:19,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 02:47:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-28 02:47:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 02:47:19,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:19,288 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:19,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:19,494 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:19,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:19,495 INFO L82 PathProgramCache]: Analyzing trace with hash 671779276, now seen corresponding path program 2 times [2019-11-28 02:47:19,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:19,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366000950] [2019-11-28 02:47:19,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:19,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366000950] [2019-11-28 02:47:19,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647287436] [2019-11-28 02:47:19,598 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 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:47:19,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:19,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:19,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:47:19,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:19,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 02:47:19,647 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 02:47:19,652 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 02:47:19,653 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 02:47:19,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 02:47:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:47:19,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:19,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-28 02:47:19,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489036702] [2019-11-28 02:47:19,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:19,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:19,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:19,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:19,724 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2019-11-28 02:47:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:19,817 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-28 02:47:19,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 02:47:19,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 02:47:19,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:19,818 INFO L225 Difference]: With dead ends: 33 [2019-11-28 02:47:19,819 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 02:47:19,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:19,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 02:47:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-28 02:47:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:47:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-28 02:47:19,824 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2019-11-28 02:47:19,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:19,824 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 02:47:19,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-28 02:47:19,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 02:47:19,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:19,825 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:20,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:20,029 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:20,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:20,030 INFO L82 PathProgramCache]: Analyzing trace with hash -649672835, now seen corresponding path program 1 times [2019-11-28 02:47:20,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:20,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410758859] [2019-11-28 02:47:20,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:47:20,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410758859] [2019-11-28 02:47:20,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:47:20,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 02:47:20,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431275733] [2019-11-28 02:47:20,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 02:47:20,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:20,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 02:47:20,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 02:47:20,089 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 4 states. [2019-11-28 02:47:20,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:20,129 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-11-28 02:47:20,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 02:47:20,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-28 02:47:20,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:20,131 INFO L225 Difference]: With dead ends: 32 [2019-11-28 02:47:20,131 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 02:47:20,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:47:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 02:47:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 02:47:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 02:47:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-11-28 02:47:20,138 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-11-28 02:47:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:20,139 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-11-28 02:47:20,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 02:47:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-11-28 02:47:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 02:47:20,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:20,140 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:20,140 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:20,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1334976847, now seen corresponding path program 1 times [2019-11-28 02:47:20,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:20,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523182905] [2019-11-28 02:47:20,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:20,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523182905] [2019-11-28 02:47:20,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823406084] [2019-11-28 02:47:20,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:47:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:47:20,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:20,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:20,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 02:47:20,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384820808] [2019-11-28 02:47:20,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 02:47:20,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:20,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 02:47:20,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:20,297 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2019-11-28 02:47:20,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:20,360 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-28 02:47:20,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 02:47:20,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-11-28 02:47:20,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:20,361 INFO L225 Difference]: With dead ends: 39 [2019-11-28 02:47:20,362 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 02:47:20,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-28 02:47:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 02:47:20,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 02:47:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 02:47:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-28 02:47:20,374 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 24 [2019-11-28 02:47:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:20,374 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-28 02:47:20,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 02:47:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-28 02:47:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 02:47:20,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:20,376 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:20,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:20,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1360643474, now seen corresponding path program 2 times [2019-11-28 02:47:20,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:20,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606275526] [2019-11-28 02:47:20,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:20,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606275526] [2019-11-28 02:47:20,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573252702] [2019-11-28 02:47:20,688 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:20,731 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 02:47:20,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:20,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:47:20,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-28 02:47:20,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 02:47:20,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-28 02:47:20,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975716792] [2019-11-28 02:47:20,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 02:47:20,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:20,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:47:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:20,802 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2019-11-28 02:47:20,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:20,838 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2019-11-28 02:47:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:47:20,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 02:47:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:20,840 INFO L225 Difference]: With dead ends: 35 [2019-11-28 02:47:20,840 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 02:47:20,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:20,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 02:47:20,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-28 02:47:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 02:47:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-28 02:47:20,851 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2019-11-28 02:47:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:20,852 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-28 02:47:20,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 02:47:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-28 02:47:20,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 02:47:20,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:20,854 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:21,055 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:21,056 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:21,057 INFO L82 PathProgramCache]: Analyzing trace with hash -775549161, now seen corresponding path program 1 times [2019-11-28 02:47:21,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:21,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95057573] [2019-11-28 02:47:21,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:21,148 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95057573] [2019-11-28 02:47:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957570150] [2019-11-28 02:47:21,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:21,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:47:21,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:21,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:21,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-28 02:47:21,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425337335] [2019-11-28 02:47:21,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 02:47:21,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 02:47:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:21,228 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2019-11-28 02:47:21,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:21,327 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-11-28 02:47:21,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 02:47:21,328 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-28 02:47:21,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:21,329 INFO L225 Difference]: With dead ends: 37 [2019-11-28 02:47:21,329 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 02:47:21,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-28 02:47:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 02:47:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2019-11-28 02:47:21,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 02:47:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-11-28 02:47:21,339 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2019-11-28 02:47:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:21,339 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-11-28 02:47:21,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 02:47:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-11-28 02:47:21,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 02:47:21,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:21,342 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:21,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:21,549 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash -105276236, now seen corresponding path program 2 times [2019-11-28 02:47:21,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:21,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029877692] [2019-11-28 02:47:21,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:21,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029877692] [2019-11-28 02:47:21,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336393991] [2019-11-28 02:47:21,620 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:21,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 02:47:21,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:21,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:47:21,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:21,683 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:21,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:21,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-28 02:47:21,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369454145] [2019-11-28 02:47:21,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 02:47:21,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:21,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 02:47:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:21,688 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 10 states. [2019-11-28 02:47:21,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:21,752 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-11-28 02:47:21,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 02:47:21,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2019-11-28 02:47:21,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:21,753 INFO L225 Difference]: With dead ends: 41 [2019-11-28 02:47:21,754 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 02:47:21,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-11-28 02:47:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 02:47:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-28 02:47:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 02:47:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 02:47:21,759 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-11-28 02:47:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:21,760 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 02:47:21,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 02:47:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 02:47:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 02:47:21,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:21,762 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:21,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:21,967 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1144843311, now seen corresponding path program 3 times [2019-11-28 02:47:21,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:21,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664120668] [2019-11-28 02:47:21,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:22,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664120668] [2019-11-28 02:47:22,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132143360] [2019-11-28 02:47:22,081 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:22,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-28 02:47:22,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:22,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:47:22,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:22,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:22,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-28 02:47:22,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787918494] [2019-11-28 02:47:22,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 02:47:22,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:22,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 02:47:22,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:22,160 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 11 states. [2019-11-28 02:47:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:22,235 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 02:47:22,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 02:47:22,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2019-11-28 02:47:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:22,236 INFO L225 Difference]: With dead ends: 45 [2019-11-28 02:47:22,236 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 02:47:22,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-28 02:47:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 02:47:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-11-28 02:47:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-28 02:47:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-11-28 02:47:22,243 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2019-11-28 02:47:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:22,243 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-11-28 02:47:22,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 02:47:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-11-28 02:47:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 02:47:22,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:22,245 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:22,452 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:22,452 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:22,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:22,453 INFO L82 PathProgramCache]: Analyzing trace with hash -539904914, now seen corresponding path program 4 times [2019-11-28 02:47:22,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:22,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980912906] [2019-11-28 02:47:22,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:22,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980912906] [2019-11-28 02:47:22,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096023858] [2019-11-28 02:47:22,540 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:22,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 02:47:22,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:22,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 02:47:22,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:22,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:22,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2019-11-28 02:47:22,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749987953] [2019-11-28 02:47:22,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 02:47:22,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:22,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 02:47:22,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:47:22,622 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2019-11-28 02:47:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:22,701 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-11-28 02:47:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 02:47:22,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-11-28 02:47:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:22,702 INFO L225 Difference]: With dead ends: 49 [2019-11-28 02:47:22,702 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 02:47:22,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-11-28 02:47:22,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 02:47:22,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-11-28 02:47:22,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-28 02:47:22,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-11-28 02:47:22,713 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2019-11-28 02:47:22,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:22,713 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-11-28 02:47:22,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 02:47:22,714 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-11-28 02:47:22,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 02:47:22,714 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:22,714 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:22,915 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:22,915 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:22,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:22,917 INFO L82 PathProgramCache]: Analyzing trace with hash 607436427, now seen corresponding path program 5 times [2019-11-28 02:47:22,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:22,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460773296] [2019-11-28 02:47:22,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460773296] [2019-11-28 02:47:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440487278] [2019-11-28 02:47:23,019 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:23,071 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-11-28 02:47:23,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:23,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 02:47:23,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:23,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:23,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2019-11-28 02:47:23,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295158387] [2019-11-28 02:47:23,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 02:47:23,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 02:47:23,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:23,109 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2019-11-28 02:47:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:23,168 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-11-28 02:47:23,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 02:47:23,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2019-11-28 02:47:23,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:23,169 INFO L225 Difference]: With dead ends: 53 [2019-11-28 02:47:23,169 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 02:47:23,169 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-11-28 02:47:23,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 02:47:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-11-28 02:47:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 02:47:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 02:47:23,174 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2019-11-28 02:47:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:23,175 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 02:47:23,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 02:47:23,175 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 02:47:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 02:47:23,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:23,176 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:23,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:23,381 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:23,382 INFO L82 PathProgramCache]: Analyzing trace with hash 228291112, now seen corresponding path program 6 times [2019-11-28 02:47:23,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:23,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144347359] [2019-11-28 02:47:23,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:47:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:23,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144347359] [2019-11-28 02:47:23,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036302054] [2019-11-28 02:47:23,512 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:23,625 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-11-28 02:47:23,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 02:47:23,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 02:47:23,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:47:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:47:23,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:47:23,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2019-11-28 02:47:23,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702644250] [2019-11-28 02:47:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 02:47:23,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:47:23,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 02:47:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:23,660 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 14 states. [2019-11-28 02:47:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:47:23,743 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 02:47:23,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 02:47:23,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2019-11-28 02:47:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 02:47:23,744 INFO L225 Difference]: With dead ends: 54 [2019-11-28 02:47:23,744 INFO L226 Difference]: Without dead ends: 54 [2019-11-28 02:47:23,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2019-11-28 02:47:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-28 02:47:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 02:47:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 02:47:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-11-28 02:47:23,757 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2019-11-28 02:47:23,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 02:47:23,757 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-11-28 02:47:23,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 02:47:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-11-28 02:47:23,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 02:47:23,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 02:47:23,761 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 02:47:23,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:47:23,966 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr6ENSURES_VIOLATIONMEMORY_LEAK, mainErr1REQUIRES_VIOLATION]=== [2019-11-28 02:47:23,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:47:23,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1223356603, now seen corresponding path program 7 times [2019-11-28 02:47:23,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:47:23,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897032726] [2019-11-28 02:47:23,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:47:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:47:24,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:47:24,075 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:47:24,076 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 02:47:24,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:47:24 BoogieIcfgContainer [2019-11-28 02:47:24,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 02:47:24,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:47:24,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:47:24,134 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:47:24,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:16" (3/4) ... [2019-11-28 02:47:24,138 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 02:47:24,205 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:47:24,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:47:24,207 INFO L168 Benchmark]: Toolchain (without parser) took 8004.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 956.3 MB in the beginning and 956.0 MB in the end (delta: 376.4 kB). Peak memory consumption was 211.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:24,208 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:47:24,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.21 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 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:47:24,209 INFO L168 Benchmark]: Boogie Preprocessor took 85.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:24,210 INFO L168 Benchmark]: RCFGBuilder took 376.75 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:24,211 INFO L168 Benchmark]: TraceAbstraction took 7206.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 963.1 MB in the end (delta: 151.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:24,211 INFO L168 Benchmark]: Witness Printer took 72.04 ms. Allocated memory is still 1.2 GB. Free memory was 963.1 MB in the beginning and 956.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:47:24,215 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 257.21 ms. Allocated memory is still 1.0 GB. Free memory was 956.3 MB in the beginning and 945.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -192.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 376.75 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: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7206.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 963.1 MB in the end (delta: 151.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.04 ms. Allocated memory is still 1.2 GB. Free memory was 963.1 MB in the beginning and 956.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; VAL [a={2:0}, i=0, n=0] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=0] [L13] ++n VAL [a={2:0}, i=0, n=1] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=1] [L13] ++n VAL [a={2:0}, i=0, n=2] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=2] [L13] ++n VAL [a={2:0}, i=0, n=3] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=3] [L13] ++n VAL [a={2:0}, i=0, n=4] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=4] [L13] ++n VAL [a={2:0}, i=0, n=5] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=5] [L13] ++n VAL [a={2:0}, i=0, n=6] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=6] [L13] ++n VAL [a={2:0}, i=0, n=7] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=7] [L13] ++n VAL [a={2:0}, i=0, n=8] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=8] [L13] ++n VAL [a={2:0}, i=0, n=9] [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={2:0}, i=0, n=9] [L13] ++n VAL [a={2:0}, i=0, n=10] [L13] COND FALSE !(n < 10) VAL [a={2:0}, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, i=0, n=10] [L17] EXPR a[i] VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=0, i=0, n=10] [L17] 0 <= i && i < 10 && a[i] >= 0 VAL [0 <= i && i < 10 && a[i] >= 0=1, a={2:0}, a[i]=0, i=0, n=10] [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] i = __VERIFIER_nondet_int() [L20] a[i] = 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 7 error locations. Result: UNSAFE, OverallTime: 7.0s, OverallIterations: 16, TraceHistogramMax: 10, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 236 SDtfs, 208 SDslu, 698 SDs, 0 SdLazy, 662 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=15, 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, 15 MinimizatonAttempts, 33 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 800 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 720 ConstructedInterpolants, 1 QuantifiedInterpolants, 70815 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1149 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 66/1169 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 incorrect! Received shutdown request...