./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b9ae191666cff52a5646f600ca779e3fb8cdedc .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:56:38,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:56:38,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:56:38,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:56:38,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:56:38,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:56:38,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:56:38,994 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:56:38,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:56:39,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:56:39,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:56:39,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:56:39,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:56:39,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:56:39,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:56:39,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:56:39,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:56:39,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:56:39,019 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:56:39,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:56:39,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:56:39,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:56:39,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:56:39,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:56:39,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:56:39,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:56:39,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:56:39,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:56:39,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:56:39,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:56:39,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:56:39,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:56:39,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:56:39,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:56:39,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:56:39,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:56:39,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:56:39,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:56:39,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:56:39,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:56:39,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:56:39,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:56:39,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:56:39,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:56:39,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:56:39,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:56:39,089 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:56:39,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:56:39,090 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:56:39,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:56:39,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:56:39,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:56:39,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:56:39,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:56:39,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:56:39,094 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:56:39,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:56:39,094 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:56:39,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:56:39,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:56:39,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:56:39,095 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:56:39,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:56:39,096 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:56:39,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:56:39,097 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:56:39,097 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:56:39,097 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:56:39,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:56:39,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:56:39,098 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:56:39,098 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc [2019-11-28 16:56:39,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:56:39,410 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:56:39,414 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:56:39,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:56:39,417 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:56:39,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-1.i [2019-11-28 16:56:39,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f8c3452/4dcf199a11cf461ca07a4401fe102f4b/FLAG054c39fe8 [2019-11-28 16:56:40,041 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:56:40,042 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-28 16:56:40,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f8c3452/4dcf199a11cf461ca07a4401fe102f4b/FLAG054c39fe8 [2019-11-28 16:56:40,309 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f8c3452/4dcf199a11cf461ca07a4401fe102f4b [2019-11-28 16:56:40,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:56:40,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:56:40,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:56:40,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:56:40,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:56:40,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:40,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19255d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40, skipping insertion in model container [2019-11-28 16:56:40,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:40,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:56:40,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:56:40,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:56:40,838 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:56:40,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:56:40,951 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:56:40,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40 WrapperNode [2019-11-28 16:56:40,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:56:40,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:56:40,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:56:40,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:56:40,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:40,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:56:41,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:56:41,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:56:41,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:56:41,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (1/1) ... [2019-11-28 16:56:41,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:56:41,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:56:41,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:56:41,074 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:56:41,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (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 16:56:41,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:56:41,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 16:56:41,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 16:56:41,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 16:56:41,138 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 16:56:41,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:56:41,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:56:41,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:56:41,607 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:56:41,607 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 16:56:41,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:41 BoogieIcfgContainer [2019-11-28 16:56:41,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:56:41,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:56:41,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:56:41,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:56:41,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:56:40" (1/3) ... [2019-11-28 16:56:41,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73841a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:41, skipping insertion in model container [2019-11-28 16:56:41,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:56:40" (2/3) ... [2019-11-28 16:56:41,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73841a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:56:41, skipping insertion in model container [2019-11-28 16:56:41,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:41" (3/3) ... [2019-11-28 16:56:41,620 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-28 16:56:41,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:56:41,636 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:56:41,649 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:56:41,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:56:41,671 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:56:41,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:56:41,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:56:41,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:56:41,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:56:41,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:56:41,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:56:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-28 16:56:41,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:56:41,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:41,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:41,694 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:41,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:41,699 INFO L82 PathProgramCache]: Analyzing trace with hash -332178203, now seen corresponding path program 1 times [2019-11-28 16:56:41,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:41,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521118068] [2019-11-28 16:56:41,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:41,976 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 16:56:41,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521118068] [2019-11-28 16:56:41,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:41,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:56:41,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774841459] [2019-11-28 16:56:41,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:56:41,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:56:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:56:42,000 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 4 states. [2019-11-28 16:56:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:42,121 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2019-11-28 16:56:42,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:56:42,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-28 16:56:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:42,133 INFO L225 Difference]: With dead ends: 49 [2019-11-28 16:56:42,134 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 16:56:42,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 16:56:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 16:56:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 16:56:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 16:56:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-28 16:56:42,176 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2019-11-28 16:56:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:42,176 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 16:56:42,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:56:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-28 16:56:42,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:56:42,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:42,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:42,178 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:42,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:42,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1321983588, now seen corresponding path program 1 times [2019-11-28 16:56:42,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:42,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894587076] [2019-11-28 16:56:42,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:42,382 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 16:56:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894587076] [2019-11-28 16:56:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 16:56:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615036131] [2019-11-28 16:56:42,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:56:42,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:42,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:56:42,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:56:42,390 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2019-11-28 16:56:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:42,561 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-28 16:56:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:56:42,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-11-28 16:56:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:42,563 INFO L225 Difference]: With dead ends: 38 [2019-11-28 16:56:42,563 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 16:56:42,565 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:56:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 16:56:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-28 16:56:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 16:56:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 16:56:42,573 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2019-11-28 16:56:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:42,574 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 16:56:42,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:56:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-28 16:56:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:56:42,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:42,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:42,576 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1379241890, now seen corresponding path program 1 times [2019-11-28 16:56:42,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:42,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977522402] [2019-11-28 16:56:42,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:42,725 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 16:56:42,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977522402] [2019-11-28 16:56:42,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:56:42,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 16:56:42,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650155102] [2019-11-28 16:56:42,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 16:56:42,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 16:56:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:56:42,729 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 7 states. [2019-11-28 16:56:42,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:42,992 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-28 16:56:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:56:42,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-28 16:56:42,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:42,995 INFO L225 Difference]: With dead ends: 30 [2019-11-28 16:56:42,995 INFO L226 Difference]: Without dead ends: 25 [2019-11-28 16:56:42,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:56:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-28 16:56:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-28 16:56:43,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 16:56:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2019-11-28 16:56:43,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2019-11-28 16:56:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:43,006 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2019-11-28 16:56:43,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 16:56:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2019-11-28 16:56:43,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:56:43,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:43,007 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:43,008 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:43,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:43,008 INFO L82 PathProgramCache]: Analyzing trace with hash -633881513, now seen corresponding path program 1 times [2019-11-28 16:56:43,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:43,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22437674] [2019-11-28 16:56:43,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:43,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22437674] [2019-11-28 16:56:43,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475729890] [2019-11-28 16:56:43,255 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 16:56:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:43,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 16:56:43,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:43,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:43,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-28 16:56:43,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-28 16:56:43,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,541 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:43,541 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:43,542 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-28 16:56:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:43,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:43,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-28 16:56:43,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510864088] [2019-11-28 16:56:43,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 16:56:43,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:43,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 16:56:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:56:43,554 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 14 states. [2019-11-28 16:56:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:44,029 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-11-28 16:56:44,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 16:56:44,030 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-28 16:56:44,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:44,032 INFO L225 Difference]: With dead ends: 45 [2019-11-28 16:56:44,032 INFO L226 Difference]: Without dead ends: 37 [2019-11-28 16:56:44,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-11-28 16:56:44,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-28 16:56:44,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-11-28 16:56:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:56:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-11-28 16:56:44,050 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2019-11-28 16:56:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:44,051 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-11-28 16:56:44,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 16:56:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-11-28 16:56:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 16:56:44,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:44,053 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:44,259 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:44,260 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash -691139815, now seen corresponding path program 1 times [2019-11-28 16:56:44,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:44,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963245232] [2019-11-28 16:56:44,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:44,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963245232] [2019-11-28 16:56:44,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108354003] [2019-11-28 16:56:44,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:44,756 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-28 16:56:44,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:44,768 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 16:56:44,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,776 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:56:44,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:44,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-28 16:56:44,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,822 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,822 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2019-11-28 16:56:44,922 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:56:44,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,935 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 16:56:44,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:44,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:44,956 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2019-11-28 16:56:44,995 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_35|], 10=[|v_#memory_int_33|]} [2019-11-28 16:56:45,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:45,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:45,031 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,047 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:45,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-28 16:56:45,060 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,072 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:36 [2019-11-28 16:56:45,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-28 16:56:45,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 16:56:45,254 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:45,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:45,265 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:14 [2019-11-28 16:56:45,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:45,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:45,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-11-28 16:56:45,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499913427] [2019-11-28 16:56:45,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 16:56:45,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:45,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 16:56:45,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:56:45,353 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 22 states. [2019-11-28 16:56:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:45,965 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-28 16:56:45,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:56:45,965 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2019-11-28 16:56:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:45,966 INFO L225 Difference]: With dead ends: 33 [2019-11-28 16:56:45,966 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 16:56:45,967 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:56:45,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 16:56:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 16:56:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 16:56:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-28 16:56:45,973 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2019-11-28 16:56:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:45,974 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-28 16:56:45,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 16:56:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-28 16:56:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:56:45,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:45,975 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:46,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:46,184 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:46,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:46,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1263868996, now seen corresponding path program 2 times [2019-11-28 16:56:46,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:46,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548344330] [2019-11-28 16:56:46,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:46,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548344330] [2019-11-28 16:56:46,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602329681] [2019-11-28 16:56:46,523 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:46,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:56:46,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:56:46,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-28 16:56:46,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:46,709 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 16:56:46,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,715 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:56:46,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:46,722 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-28 16:56:46,751 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 16:56:46,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,768 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-11-28 16:56:46,769 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,776 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,777 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,777 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:19 [2019-11-28 16:56:46,781 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 2=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.base_40|]} [2019-11-28 16:56:46,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:46,786 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,809 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:46,822 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:46,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2019-11-28 16:56:46,830 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,875 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,876 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,878 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-28 16:56:46,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-28 16:56:46,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:46,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:46,995 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:46,995 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-11-28 16:56:47,074 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2019-11-28 16:56:47,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:47,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:47,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:4 [2019-11-28 16:56:47,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:47,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:47,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2019-11-28 16:56:47,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869630478] [2019-11-28 16:56:47,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 16:56:47,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:47,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 16:56:47,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-11-28 16:56:47,088 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-11-28 16:56:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:48,008 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2019-11-28 16:56:48,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 16:56:48,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2019-11-28 16:56:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:48,010 INFO L225 Difference]: With dead ends: 51 [2019-11-28 16:56:48,010 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 16:56:48,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:56:48,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 16:56:48,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-11-28 16:56:48,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:56:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-28 16:56:48,019 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2019-11-28 16:56:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:48,020 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-28 16:56:48,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 16:56:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-28 16:56:48,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:56:48,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:48,022 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:48,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:48,227 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:48,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1321127298, now seen corresponding path program 2 times [2019-11-28 16:56:48,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:48,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657495829] [2019-11-28 16:56:48,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:48,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657495829] [2019-11-28 16:56:48,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608813806] [2019-11-28 16:56:48,945 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 16:56:49,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 16:56:49,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:56:49,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 80 conjunts are in the unsatisfiable core [2019-11-28 16:56:49,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:49,090 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 16:56:49,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,109 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,109 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,109 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 16:56:49,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-28 16:56:49,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-11-28 16:56:49,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-28 16:56:49,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,295 INFO L614 ElimStorePlain]: treesize reduction 14, result has 73.6 percent of original size [2019-11-28 16:56:49,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-28 16:56:49,299 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,314 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,314 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,315 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:35 [2019-11-28 16:56:49,363 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_41|], 10=[|v_#memory_int_36|]} [2019-11-28 16:56:49,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:49,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:49,401 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-11-28 16:56:49,428 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,444 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,444 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:77, output treesize:52 [2019-11-28 16:56:49,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-28 16:56:49,579 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2019-11-28 16:56:49,616 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 16:56:49,651 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,679 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2019-11-28 16:56:49,689 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,706 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:101, output treesize:60 [2019-11-28 16:56:49,767 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_38|, |v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_44|], 10=[|v_#memory_int_38|]} [2019-11-28 16:56:49,770 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:49,812 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,816 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:49,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-28 16:56:49,855 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,890 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-28 16:56:49,905 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,955 INFO L614 ElimStorePlain]: treesize reduction 4, result has 96.0 percent of original size [2019-11-28 16:56:49,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:49,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2019-11-28 16:56:49,964 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:49,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:49,987 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:124, output treesize:77 [2019-11-28 16:56:50,186 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:56:50,204 INFO L343 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-28 16:56:50,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 53 [2019-11-28 16:56:50,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,208 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:50,242 INFO L614 ElimStorePlain]: treesize reduction 4, result has 92.6 percent of original size [2019-11-28 16:56:50,251 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-11-28 16:56:50,252 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:50,263 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,263 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:99, output treesize:14 [2019-11-28 16:56:50,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:50,295 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_int|], 2=[v_prenex_1]} [2019-11-28 16:56:50,298 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-28 16:56:50,298 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,312 INFO L614 ElimStorePlain]: treesize reduction 21, result has 19.2 percent of original size [2019-11-28 16:56:50,312 INFO L502 ElimStorePlain]: Eliminatee v_prenex_1 vanished before elimination [2019-11-28 16:56:50,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:50,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:5 [2019-11-28 16:56:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:50,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:50,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2019-11-28 16:56:50,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618010940] [2019-11-28 16:56:50,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 16:56:50,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:50,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 16:56:50,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2019-11-28 16:56:50,346 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-11-28 16:56:51,157 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-28 16:56:51,333 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 77 [2019-11-28 16:56:51,615 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 110 [2019-11-28 16:56:51,932 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 111 [2019-11-28 16:56:52,135 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 107 [2019-11-28 16:56:52,374 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 108 [2019-11-28 16:56:52,565 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2019-11-28 16:56:52,772 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 86 [2019-11-28 16:56:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:52,851 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-28 16:56:52,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 16:56:52,852 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 27 [2019-11-28 16:56:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:52,853 INFO L225 Difference]: With dead ends: 36 [2019-11-28 16:56:52,853 INFO L226 Difference]: Without dead ends: 31 [2019-11-28 16:56:52,854 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 16:56:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-28 16:56:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-28 16:56:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:56:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-28 16:56:52,861 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-11-28 16:56:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:52,862 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 16:56:52,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 16:56:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-11-28 16:56:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 16:56:52,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:52,863 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:53,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:53,078 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:53,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:53,079 INFO L82 PathProgramCache]: Analyzing trace with hash -213891529, now seen corresponding path program 3 times [2019-11-28 16:56:53,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:53,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991261886] [2019-11-28 16:56:53,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:56:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:53,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991261886] [2019-11-28 16:56:53,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952224087] [2019-11-28 16:56:53,696 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 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 16:56:54,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 16:56:54,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 16:56:54,211 INFO L264 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-28 16:56:54,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:56:54,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 16:56:54,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-28 16:56:54,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:54,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-28 16:56:54,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,375 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,375 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-11-28 16:56:54,409 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_41|], 2=[|v_#memory_$Pointer$.base_46|, |v_#memory_$Pointer$.base_49|]} [2019-11-28 16:56:54,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 9 [2019-11-28 16:56:54,413 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,434 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:54,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:54,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:56:54,468 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,469 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 44 [2019-11-28 16:56:54,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,470 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,501 INFO L614 ElimStorePlain]: treesize reduction 16, result has 71.9 percent of original size [2019-11-28 16:56:54,502 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,502 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2019-11-28 16:56:54,571 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_43|], 6=[|v_#memory_$Pointer$.base_50|]} [2019-11-28 16:56:54,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:54,580 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-28 16:56:54,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:54,600 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:56:54,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2019-11-28 16:56:54,604 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,627 INFO L614 ElimStorePlain]: treesize reduction 30, result has 57.1 percent of original size [2019-11-28 16:56:54,628 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,628 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:40 [2019-11-28 16:56:54,673 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.offset_42|], 5=[|v_#memory_$Pointer$.base_51|]} [2019-11-28 16:56:54,676 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:54,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 16:56:54,706 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:56:54,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-28 16:56:54,740 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:54,779 INFO L614 ElimStorePlain]: treesize reduction 16, result has 78.9 percent of original size [2019-11-28 16:56:54,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 16:56:54,789 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 16:56:54,813 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:54,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 82 [2019-11-28 16:56:54,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,836 INFO L534 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:54,961 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-11-28 16:56:54,961 INFO L614 ElimStorePlain]: treesize reduction 122, result has 52.0 percent of original size [2019-11-28 16:56:54,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:54,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:54,964 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:91, output treesize:194 [2019-11-28 16:56:54,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:55,287 INFO L343 Elim1Store]: treesize reduction 16, result has 56.8 percent of original size [2019-11-28 16:56:55,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 48 [2019-11-28 16:56:55,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:55,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:55,302 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 16:56:55,302 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:89, output treesize:51 [2019-11-28 16:56:55,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:55,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2019-11-28 16:56:55,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:55,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:55,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:55,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:55,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 16:56:55,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 16:56:55,377 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 16:56:55,377 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:52, output treesize:4 [2019-11-28 16:56:55,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:56:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:56:55,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:56:55,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-11-28 16:56:55,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286154825] [2019-11-28 16:56:55,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 16:56:55,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:56:55,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 16:56:55,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-11-28 16:56:55,387 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 32 states. [2019-11-28 16:56:56,779 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-28 16:56:56,999 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-11-28 16:56:57,188 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2019-11-28 16:56:57,376 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2019-11-28 16:56:57,556 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-11-28 16:56:57,745 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-28 16:56:57,909 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-28 16:56:58,088 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-11-28 16:56:58,231 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-28 16:56:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:56:58,289 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-11-28 16:56:58,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 16:56:58,290 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-11-28 16:56:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:56:58,291 INFO L225 Difference]: With dead ends: 57 [2019-11-28 16:56:58,291 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 16:56:58,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=757, Invalid=2435, Unknown=0, NotChecked=0, Total=3192 [2019-11-28 16:56:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 16:56:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-28 16:56:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 16:56:58,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-11-28 16:56:58,301 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-11-28 16:56:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:56:58,301 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-11-28 16:56:58,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 16:56:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-11-28 16:56:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 16:56:58,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:56:58,302 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:56:58,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:56:58,507 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:56:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:56:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash -271149831, now seen corresponding path program 3 times [2019-11-28 16:56:58,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:56:58,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676944259] [2019-11-28 16:56:58,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:56:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:56:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:56:58,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:56:58,628 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:56:58,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:56:58 BoogieIcfgContainer [2019-11-28 16:56:58,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:56:58,721 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:56:58,721 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:56:58,721 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:56:58,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:56:41" (3/4) ... [2019-11-28 16:56:58,725 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 16:56:58,846 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:56:58,847 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:56:58,853 INFO L168 Benchmark]: Toolchain (without parser) took 18534.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 960.4 MB in the beginning and 918.8 MB in the end (delta: 41.6 MB). Peak memory consumption was 403.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:58,854 INFO L168 Benchmark]: CDTParser took 0.85 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 16:56:58,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 633.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:58,855 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.65 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:58,856 INFO L168 Benchmark]: Boogie Preprocessor took 53.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:56:58,856 INFO L168 Benchmark]: RCFGBuilder took 535.52 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: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:58,857 INFO L168 Benchmark]: TraceAbstraction took 17110.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 929.2 MB in the end (delta: 152.1 MB). Peak memory consumption was 372.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:58,858 INFO L168 Benchmark]: Witness Printer took 126.46 ms. Allocated memory is still 1.4 GB. Free memory was 929.2 MB in the beginning and 918.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:56:58,862 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.85 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 633.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -158.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.65 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 535.52 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: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17110.19 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.1 GB in the beginning and 929.2 MB in the end (delta: 152.1 MB). Peak memory consumption was 372.3 MB. Max. memory is 11.5 GB. * Witness Printer took 126.46 ms. Allocated memory is still 1.4 GB. Free memory was 929.2 MB in the beginning and 918.8 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L522] mlist *head; VAL [head={0:0}] [L543] int i; [L544] mlist *mylist, *temp; [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={0:0}] [L533] COND TRUE head==((void *)0) [L534] l->next = ((void *)0) VAL [head={0:0}] [L539] head = l [L540] return 0; VAL [head={-4:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-4:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-4:0}] [L539] head = l [L540] return 0; VAL [head={-3:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-3:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-3:0}] [L539] head = l [L540] return 0; VAL [head={-2:0}] [L531] l = (mlist*)malloc(sizeof(mlist)) [L532] l->key = k VAL [head={-2:0}] [L533] COND FALSE !(head==((void *)0)) [L536] l->key = k [L537] l->next = head VAL [head={-2:0}] [L539] head = l [L540] return 0; VAL [head={-1:0}] [L524] l = head VAL [head={-1:0}] [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND TRUE l!=((void *)0) && l->key!=k [L526] EXPR l->next [L526] l = l->next [L525] l!=((void *)0) && l->key!=k [L525] EXPR l->key [L525] l!=((void *)0) && l->key!=k VAL [head={-1:0}] [L525] COND FALSE !(l!=((void *)0) && l->key!=k) [L528] return l; VAL [head={-1:0}] [L549] temp = search_list(head,2) [L550] temp->key [L3] COND TRUE !(cond) VAL [head={-1:0}] [L4] __VERIFIER_error() VAL [head={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 1 error locations. Result: UNSAFE, OverallTime: 16.9s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 916 SDslu, 295 SDs, 0 SdLazy, 1533 SolverSat, 566 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 115 SyntacticMatches, 11 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 312 ConstructedInterpolants, 12 QuantifiedInterpolants, 112892 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1061 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 12/84 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...