./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8b9ae191666cff52a5646f600ca779e3fb8cdedc --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))) --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 12:11:36,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:11:36,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:11:36,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:11:36,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:11:36,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:11:36,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:11:36,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:11:36,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:11:36,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:11:36,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:11:36,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:11:36,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:11:36,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:11:36,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:11:36,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:11:36,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:11:36,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:11:36,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:11:36,659 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:11:36,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:11:36,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:11:36,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:11:36,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:11:36,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:11:36,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:11:36,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:11:36,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:11:36,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:11:36,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:11:36,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:11:36,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:11:36,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:11:36,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:11:36,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:11:36,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:11:36,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:11:36,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:11:36,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:11:36,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:11:36,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:11:36,689 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-64bit-Automizer_Bitvector.epf [2019-11-21 12:11:36,713 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:11:36,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:11:36,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:11:36,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:11:36,717 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:11:36,717 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:11:36,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:11:36,718 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:11:36,718 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:11:36,718 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:11:36,720 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:11:36,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:11:36,720 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:11:36,721 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:11:36,721 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:11:36,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:11:36,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:11:36,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:11:36,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:11:36,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:11:36,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:11:36,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:11:36,724 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:11:36,724 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:11:36,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:11:36,725 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b9ae191666cff52a5646f600ca779e3fb8cdedc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:11:37,042 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:11:37,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:11:37,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:11:37,060 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:11:37,060 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:11:37,061 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-21 12:11:37,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da252924f/6fe3e919160540ee8b23efe8b2852012/FLAG5826ec56c [2019-11-21 12:11:37,629 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:11:37,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-1.i [2019-11-21 12:11:37,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da252924f/6fe3e919160540ee8b23efe8b2852012/FLAG5826ec56c [2019-11-21 12:11:38,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da252924f/6fe3e919160540ee8b23efe8b2852012 [2019-11-21 12:11:38,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:11:38,006 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:11:38,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:11:38,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:11:38,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:11:38,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc4890b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38, skipping insertion in model container [2019-11-21 12:11:38,015 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:11:38,064 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:11:38,496 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:11:38,498 INFO L969 CHandler]: at location: C: (mlist*)malloc(sizeof(mlist)) [531] [2019-11-21 12:11:38,498 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:11:38,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:11:38,526 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:11:38,533 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:11:38,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:11:38,568 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:11:38,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:11:38,691 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:11:38,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38 WrapperNode [2019-11-21 12:11:38,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:11:38,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:11:38,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:11:38,693 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:11:38,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,761 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (1/1) ... [2019-11-21 12:11:38,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:11:38,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:11:38,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:11:38,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:11:38,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (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-21 12:11:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:11:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:11:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-21 12:11:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:11:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:11:38,847 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 12:11:38,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 12:11:38,849 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 12:11:38,849 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2019-11-21 12:11:38,849 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2019-11-21 12:11:38,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:11:38,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 12:11:38,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-21 12:11:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:11:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:11:38,851 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:11:38,852 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:11:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:11:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:11:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:11:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:11:38,854 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:11:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:11:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:11:38,855 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:11:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:11:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:11:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:11:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:11:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:11:38,856 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:11:38,857 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:11:38,858 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:11:38,859 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:11:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:11:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:11:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:11:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:11:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:11:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:11:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:11:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:11:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:11:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:11:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:11:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:11:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:11:39,540 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:11:39,540 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-21 12:11:39,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:11:39 BoogieIcfgContainer [2019-11-21 12:11:39,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:11:39,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:11:39,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:11:39,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:11:39,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:11:38" (1/3) ... [2019-11-21 12:11:39,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a2c8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:11:39, skipping insertion in model container [2019-11-21 12:11:39,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:11:38" (2/3) ... [2019-11-21 12:11:39,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a2c8c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:11:39, skipping insertion in model container [2019-11-21 12:11:39,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:11:39" (3/3) ... [2019-11-21 12:11:39,550 INFO L109 eAbstractionObserver]: Analyzing ICFG list_search-1.i [2019-11-21 12:11:39,559 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:11:39,568 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-21 12:11:39,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-21 12:11:39,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:11:39,601 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:11:39,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:11:39,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:11:39,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:11:39,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:11:39,602 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:11:39,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:11:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-21 12:11:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 12:11:39,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:39,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:39,630 INFO L410 AbstractCegarLoop]: === Iteration 1 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:39,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:39,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1520208519, now seen corresponding path program 1 times [2019-11-21 12:11:39,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:39,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1704136420] [2019-11-21 12:11:39,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:39,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 12:11:39,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:39,974 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-21 12:11:39,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:39,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:39,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:39,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:11:40,000 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-21 12:11:40,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:40,014 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-21 12:11:40,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1704136420] [2019-11-21 12:11:40,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:40,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:11:40,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304648688] [2019-11-21 12:11:40,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:11:40,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:40,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:11:40,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:11:40,041 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-11-21 12:11:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:40,208 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-11-21 12:11:40,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:11:40,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-21 12:11:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:40,219 INFO L225 Difference]: With dead ends: 70 [2019-11-21 12:11:40,219 INFO L226 Difference]: Without dead ends: 66 [2019-11-21 12:11:40,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:11:40,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-21 12:11:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-21 12:11:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-21 12:11:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-11-21 12:11:40,267 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 9 [2019-11-21 12:11:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:40,267 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-11-21 12:11:40,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:11:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-11-21 12:11:40,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 12:11:40,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:40,268 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:40,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:40,471 INFO L410 AbstractCegarLoop]: === Iteration 2 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1520208520, now seen corresponding path program 1 times [2019-11-21 12:11:40,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:40,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [542275975] [2019-11-21 12:11:40,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:40,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:11:40,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:40,713 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-21 12:11:40,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:40,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:40,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:40,726 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:11:40,740 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-21 12:11:40,741 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:40,786 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-21 12:11:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542275975] [2019-11-21 12:11:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:40,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:11:40,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947962238] [2019-11-21 12:11:40,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:11:40,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:40,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:11:40,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:11:40,791 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 4 states. [2019-11-21 12:11:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:40,972 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-11-21 12:11:40,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:11:40,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-21 12:11:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:40,975 INFO L225 Difference]: With dead ends: 62 [2019-11-21 12:11:40,975 INFO L226 Difference]: Without dead ends: 62 [2019-11-21 12:11:40,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:11:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-21 12:11:40,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-21 12:11:40,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 12:11:40,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-11-21 12:11:40,985 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2019-11-21 12:11:40,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:40,986 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-11-21 12:11:40,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:11:40,986 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-11-21 12:11:40,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-21 12:11:40,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:40,988 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:41,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:41,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1488025840, now seen corresponding path program 1 times [2019-11-21 12:11:41,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:41,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [82964563] [2019-11-21 12:11:41,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:41,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:11:41,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-21 12:11:41,593 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:41,705 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-21 12:11:41,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [82964563] [2019-11-21 12:11:41,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:11:41,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-21 12:11:41,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350591198] [2019-11-21 12:11:41,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-21 12:11:41,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-21 12:11:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:11:41,718 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 7 states. [2019-11-21 12:11:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:42,227 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2019-11-21 12:11:42,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 12:11:42,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-21 12:11:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:42,229 INFO L225 Difference]: With dead ends: 118 [2019-11-21 12:11:42,229 INFO L226 Difference]: Without dead ends: 118 [2019-11-21 12:11:42,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-21 12:11:42,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-21 12:11:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 69. [2019-11-21 12:11:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-21 12:11:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-11-21 12:11:42,246 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 47 [2019-11-21 12:11:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:42,247 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-11-21 12:11:42,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-21 12:11:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-11-21 12:11:42,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-21 12:11:42,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:42,249 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:42,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:42,463 INFO L410 AbstractCegarLoop]: === Iteration 4 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:42,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:42,464 INFO L82 PathProgramCache]: Analyzing trace with hash 493032989, now seen corresponding path program 1 times [2019-11-21 12:11:42,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:42,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [840456768] [2019-11-21 12:11:42,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:42,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:11:42,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:42,880 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-21 12:11:42,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:42,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:42,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:42,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:11:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:42,919 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:43,031 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:43,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [840456768] [2019-11-21 12:11:43,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:43,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:11:43,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701081259] [2019-11-21 12:11:43,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:11:43,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:43,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:11:43,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:11:43,033 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2019-11-21 12:11:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:43,368 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-11-21 12:11:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:11:43,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-11-21 12:11:43,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:43,371 INFO L225 Difference]: With dead ends: 83 [2019-11-21 12:11:43,372 INFO L226 Difference]: Without dead ends: 83 [2019-11-21 12:11:43,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:11:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-21 12:11:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-11-21 12:11:43,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-21 12:11:43,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-11-21 12:11:43,381 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 50 [2019-11-21 12:11:43,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:43,382 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-11-21 12:11:43,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:11:43,382 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-11-21 12:11:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-21 12:11:43,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:43,384 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:43,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:43,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash 493032990, now seen corresponding path program 1 times [2019-11-21 12:11:43,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:43,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1898470673] [2019-11-21 12:11:43,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:43,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 12:11:44,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:44,015 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-21 12:11:44,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:44,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:44,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:44,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:11:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:44,073 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:44,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1898470673] [2019-11-21 12:11:44,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:44,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 12:11:44,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332196911] [2019-11-21 12:11:44,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:11:44,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:44,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:11:44,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:11:44,337 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 8 states. [2019-11-21 12:11:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:45,005 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2019-11-21 12:11:45,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:11:45,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-11-21 12:11:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:45,007 INFO L225 Difference]: With dead ends: 94 [2019-11-21 12:11:45,007 INFO L226 Difference]: Without dead ends: 94 [2019-11-21 12:11:45,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:11:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-21 12:11:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2019-11-21 12:11:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 12:11:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-21 12:11:45,016 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 50 [2019-11-21 12:11:45,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:45,017 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-21 12:11:45,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:11:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-21 12:11:45,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-21 12:11:45,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:45,020 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:45,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:45,233 INFO L410 AbstractCegarLoop]: === Iteration 6 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:45,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:45,233 INFO L82 PathProgramCache]: Analyzing trace with hash -782626401, now seen corresponding path program 1 times [2019-11-21 12:11:45,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:45,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1033081376] [2019-11-21 12:11:45,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:45,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:11:45,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:45,566 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:45,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:11:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:45,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1033081376] [2019-11-21 12:11:45,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:45,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 9 [2019-11-21 12:11:45,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423172705] [2019-11-21 12:11:45,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 12:11:45,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:45,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 12:11:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 12:11:45,711 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 9 states. [2019-11-21 12:11:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:46,106 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-11-21 12:11:46,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 12:11:46,107 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-11-21 12:11:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:46,108 INFO L225 Difference]: With dead ends: 89 [2019-11-21 12:11:46,108 INFO L226 Difference]: Without dead ends: 89 [2019-11-21 12:11:46,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:11:46,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-21 12:11:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-11-21 12:11:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 12:11:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-21 12:11:46,117 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 55 [2019-11-21 12:11:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:46,117 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-21 12:11:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 12:11:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-21 12:11:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 12:11:46,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:46,119 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:46,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:46,330 INFO L410 AbstractCegarLoop]: === Iteration 7 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:46,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1546121596, now seen corresponding path program 1 times [2019-11-21 12:11:46,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:46,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1018440553] [2019-11-21 12:11:46,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:46,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 12:11:46,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:46,751 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-21 12:11:46,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:46,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:46,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:46,754 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:11:46,811 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:46,811 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:46,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1018440553] [2019-11-21 12:11:46,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:46,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-21 12:11:46,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454395169] [2019-11-21 12:11:46,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:11:46,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:11:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:11:46,963 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 10 states. [2019-11-21 12:11:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:47,664 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2019-11-21 12:11:47,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:11:47,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-21 12:11:47,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:47,667 INFO L225 Difference]: With dead ends: 96 [2019-11-21 12:11:47,667 INFO L226 Difference]: Without dead ends: 96 [2019-11-21 12:11:47,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-11-21 12:11:47,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-21 12:11:47,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2019-11-21 12:11:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 12:11:47,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-11-21 12:11:47,675 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 57 [2019-11-21 12:11:47,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:47,675 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-11-21 12:11:47,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:11:47,676 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-11-21 12:11:47,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 12:11:47,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:47,677 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:47,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:47,881 INFO L410 AbstractCegarLoop]: === Iteration 8 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:47,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:47,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1546121597, now seen corresponding path program 1 times [2019-11-21 12:11:47,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:47,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [758219969] [2019-11-21 12:11:47,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:48,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 12:11:48,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:48,324 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-21 12:11:48,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:48,330 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:48,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:48,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:11:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:48,472 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-21 12:11:49,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [758219969] [2019-11-21 12:11:49,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:11:49,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-21 12:11:49,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358839604] [2019-11-21 12:11:49,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:11:49,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:49,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:11:49,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:11:49,190 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 14 states. [2019-11-21 12:11:50,370 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2019-11-21 12:11:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:50,782 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2019-11-21 12:11:50,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 12:11:50,783 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-11-21 12:11:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:50,784 INFO L225 Difference]: With dead ends: 119 [2019-11-21 12:11:50,784 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 12:11:50,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2019-11-21 12:11:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 12:11:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 84. [2019-11-21 12:11:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-21 12:11:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2019-11-21 12:11:50,792 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 57 [2019-11-21 12:11:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:50,793 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2019-11-21 12:11:50,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:11:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2019-11-21 12:11:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 12:11:50,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:50,794 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:50,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:50,998 INFO L410 AbstractCegarLoop]: === Iteration 9 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:50,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1596651362, now seen corresponding path program 1 times [2019-11-21 12:11:51,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:51,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2133114126] [2019-11-21 12:11:51,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:51,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 12:11:51,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:51,506 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-21 12:11:51,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:51,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:11:51,556 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-21 12:11:51,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:51,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-21 12:11:51,640 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:51,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 46 [2019-11-21 12:11:51,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,664 INFO L567 ElimStorePlain]: treesize reduction 26, result has 40.9 percent of original size [2019-11-21 12:11:51,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,665 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-11-21 12:11:51,725 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 19 treesize of output 11 [2019-11-21 12:11:51,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:51,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:51,731 INFO L496 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-21 12:11:51,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2019-11-21 12:11:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 12:11:51,780 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 12:11:52,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2133114126] [2019-11-21 12:11:52,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:11:52,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2019-11-21 12:11:52,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068834039] [2019-11-21 12:11:52,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-21 12:11:52,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:11:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-21 12:11:52,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-21 12:11:52,236 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 17 states. [2019-11-21 12:11:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:11:53,940 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2019-11-21 12:11:53,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 12:11:53,940 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-21 12:11:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:11:53,942 INFO L225 Difference]: With dead ends: 114 [2019-11-21 12:11:53,942 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 12:11:53,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2019-11-21 12:11:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 12:11:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 91. [2019-11-21 12:11:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-21 12:11:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-21 12:11:53,959 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 57 [2019-11-21 12:11:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:11:53,959 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-21 12:11:53,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-21 12:11:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2019-11-21 12:11:53,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-21 12:11:53,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:11:53,964 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:11:54,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:54,165 INFO L410 AbstractCegarLoop]: === Iteration 10 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:11:54,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:11:54,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1596651363, now seen corresponding path program 1 times [2019-11-21 12:11:54,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:11:54,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [944416836] [2019-11-21 12:11:54,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:11:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:11:54,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-21 12:11:54,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:11:54,728 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-21 12:11:54,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:54,744 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-21 12:11:54,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:54,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,752 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:11:54,830 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-21 12:11:54,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:54,856 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-21 12:11:54,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:54,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-11-21 12:11:54,968 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:54,968 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 17 treesize of output 21 [2019-11-21 12:11:54,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:54,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:54,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2019-11-21 12:11:54,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:55,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:55,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:11:55,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:33 [2019-11-21 12:11:55,098 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-21 12:11:55,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:55,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:55,122 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-21 12:11:55,122 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:11:55,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:11:55,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:11:55,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:20 [2019-11-21 12:11:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 12:11:55,241 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:11:55,800 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-21 12:11:55,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:11:58,455 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:11:58,807 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:11:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:11:59,151 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-11-21 12:11:59,628 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2019-11-21 12:12:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 12:12:04,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [944416836] [2019-11-21 12:12:04,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:12:04,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-21 12:12:04,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982954820] [2019-11-21 12:12:04,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 12:12:04,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:12:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 12:12:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=395, Unknown=1, NotChecked=0, Total=462 [2019-11-21 12:12:04,880 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 22 states. [2019-11-21 12:12:07,842 WARN L192 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2019-11-21 12:12:09,173 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-11-21 12:12:09,553 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-11-21 12:12:10,637 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-21 12:12:11,640 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-21 12:12:14,476 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-21 12:12:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:12:22,043 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2019-11-21 12:12:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-21 12:12:22,044 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-11-21 12:12:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:12:22,046 INFO L225 Difference]: With dead ends: 120 [2019-11-21 12:12:22,046 INFO L226 Difference]: Without dead ends: 120 [2019-11-21 12:12:22,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=288, Invalid=1193, Unknown=1, NotChecked=0, Total=1482 [2019-11-21 12:12:22,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-21 12:12:22,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2019-11-21 12:12:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-21 12:12:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2019-11-21 12:12:22,056 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 57 [2019-11-21 12:12:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:12:22,057 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2019-11-21 12:12:22,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 12:12:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2019-11-21 12:12:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-21 12:12:22,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:12:22,059 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:12:22,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:12:22,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:12:22,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:12:22,269 INFO L82 PathProgramCache]: Analyzing trace with hash -65719430, now seen corresponding path program 1 times [2019-11-21 12:12:22,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:12:22,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1686187180] [2019-11-21 12:12:22,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:12:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:12:22,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 12:12:22,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:12:22,678 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-21 12:12:22,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:22,685 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:22,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:12:22,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-21 12:12:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 12:12:22,856 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:12:23,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:12:23,426 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-21 12:12:23,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1686187180] [2019-11-21 12:12:23,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:12:23,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-21 12:12:23,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828493541] [2019-11-21 12:12:23,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 12:12:23,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:12:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 12:12:23,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-21 12:12:23,430 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 22 states. [2019-11-21 12:12:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:12:25,454 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-11-21 12:12:25,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-21 12:12:25,454 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 62 [2019-11-21 12:12:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:12:25,456 INFO L225 Difference]: With dead ends: 114 [2019-11-21 12:12:25,456 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 12:12:25,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2019-11-21 12:12:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 12:12:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2019-11-21 12:12:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-21 12:12:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-11-21 12:12:25,463 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 62 [2019-11-21 12:12:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:12:25,463 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-11-21 12:12:25,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 12:12:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-11-21 12:12:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-21 12:12:25,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:12:25,464 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:12:25,668 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:12:25,670 INFO L410 AbstractCegarLoop]: === Iteration 12 === [insert_listErr4REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-11-21 12:12:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:12:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash -945484163, now seen corresponding path program 2 times [2019-11-21 12:12:25,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:12:25,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [589411022] [2019-11-21 12:12:25,672 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:12:26,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 12:12:26,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 12:12:26,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-21 12:12:26,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:12:26,261 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-21 12:12:26,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:26,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:12:26,304 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-21 12:12:26,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:26,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-11-21 12:12:26,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:26,398 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 23 treesize of output 61 [2019-11-21 12:12:26,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,424 INFO L567 ElimStorePlain]: treesize reduction 26, result has 50.0 percent of original size [2019-11-21 12:12:26,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:26 [2019-11-21 12:12:26,568 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:26,652 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.9 percent of original size [2019-11-21 12:12:26,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:26,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:50 [2019-11-21 12:12:26,720 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_244|], 2=[|v_#memory_$Pointer$.base_255|]} [2019-11-21 12:12:26,732 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-21 12:12:26,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:26,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:26,795 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:26,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:26,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:26,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:54 [2019-11-21 12:12:28,823 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 12:12:30,767 WARN L192 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-21 12:12:30,834 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:30,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 93 [2019-11-21 12:12:30,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:31,001 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 12:12:31,002 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-11-21 12:12:31,008 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2019-11-21 12:12:31,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 25 [2019-11-21 12:12:31,023 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:31,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:31,049 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:12:31,124 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2019-11-21 12:12:31,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:12:31,125 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:72, output treesize:81 [2019-11-21 12:12:31,267 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-21 12:12:31,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:12:31,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:31,296 INFO L496 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-21 12:12:31,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:92, output treesize:81 [2019-11-21 12:12:31,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:31,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 40 [2019-11-21 12:12:31,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:12:31,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:12:31,513 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:31,567 INFO L567 ElimStorePlain]: treesize reduction 4, result has 88.2 percent of original size [2019-11-21 12:12:31,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:31,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:82, output treesize:30 [2019-11-21 12:12:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:12:31,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:12:32,486 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-21 12:12:32,693 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 12:12:33,094 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-21 12:12:33,387 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-21 12:12:33,401 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_265|], 3=[|v_#memory_$Pointer$.base_266|]} [2019-11-21 12:12:33,406 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:33,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:33,434 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:33,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:12:33,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-21 12:12:33,460 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:61, output treesize:54 [2019-11-21 12:12:45,561 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:12:47,576 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse0 (select |c_old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |c_old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |c_old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |c_old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |c_old(~head~0.base)|)) |c_old(~head~0.base)|) (bvadd |c_old(~head~0.offset)| (_ bv4 32)))))))))) (= (_ bv1 1) (select |c_#valid| (let ((.cse2 (bvadd c_insert_list_~l.offset (_ bv4 32)))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_insert_list_~l.base) .cse2)) (bvadd (select (select |c_#memory_$Pointer$.offset| c_insert_list_~l.base) .cse2) (_ bv4 32))))))) is different from true [2019-11-21 12:12:56,952 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:12:56,960 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:13:01,547 WARN L192 SmtUtils]: Spent 4.59 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 12:13:01,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:13:01,749 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:13:01,750 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:493) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 12:13:01,757 INFO L168 Benchmark]: Toolchain (without parser) took 83750.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 301.5 MB). Free memory was 957.7 MB in the beginning and 799.5 MB in the end (delta: 158.2 MB). Peak memory consumption was 459.7 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:01,757 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:13:01,757 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -99.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:01,758 INFO L168 Benchmark]: Boogie Preprocessor took 75.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:01,758 INFO L168 Benchmark]: RCFGBuilder took 773.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:01,759 INFO L168 Benchmark]: TraceAbstraction took 82212.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 217.6 MB). Free memory was 996.2 MB in the beginning and 799.5 MB in the end (delta: 196.7 MB). Peak memory consumption was 414.3 MB. Max. memory is 11.5 GB. [2019-11-21 12:13:01,761 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 685.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -99.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 773.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 996.2 MB in the end (delta: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 82212.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 217.6 MB). Free memory was 996.2 MB in the beginning and 799.5 MB in the end (delta: 196.7 MB). Peak memory consumption was 414.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((v_DerPreprocessor_5 (_ BitVec 32))) (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_insert_list_~l.base_141 (_ BitVec 32))) (let ((.cse2 (store (select |#memory_$Pointer$.base| insert_list_~l.base) (bvadd insert_list_~l.offset (_ bv2 32)) v_DerPreprocessor_5))) (or (let ((.cse0 (select |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141))) (let ((.cse1 (store .cse0 (_ bv2 32) v_DerPreprocessor_4))) (and (= v_DerPreprocessor_3 (select (store .cse0 (_ bv2 32) v_DerPreprocessor_3) (_ bv0 32))) (= v_DerPreprocessor_4 (select .cse1 (_ bv0 32))) (= (select |old(#valid)| v_insert_list_~l.base_141) (_ bv0 1)) (not (= (_ bv1 1) (select (store |old(#valid)| v_insert_list_~l.base_141 (_ bv1 1)) (select (select (store |old(#memory_$Pointer$.base)| v_insert_list_~l.base_141 (store .cse1 (_ bv4 32) |old(~head~0.base)|)) |old(~head~0.base)|) (bvadd |old(~head~0.offset)| (_ bv4 32))))))))) (not (= (_ bv1 1) (select |#valid| insert_list_~l.base))) (not (= v_DerPreprocessor_5 (select .cse2 insert_list_~l.offset))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| insert_list_~l.base (store .cse2 (bvadd insert_list_~l.offset (_ bv4 32)) ~head~0.base)) ~head~0.base) (bvadd ~head~0.offset (_ bv4 32))))))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:667) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...