./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10cd30ad3ca5cbac349bf58887b96141941b6c91 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:22:32,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:22:32,961 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:22:32,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:22:32,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:22:32,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:22:32,974 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:22:32,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:22:32,977 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:22:32,977 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:22:32,978 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:22:32,978 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:22:32,979 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:22:32,979 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:22:32,981 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:22:32,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:22:32,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:22:32,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:22:32,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:22:32,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:22:32,987 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:22:32,988 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:22:32,990 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:22:32,990 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:22:32,990 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:22:32,991 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:22:32,992 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:22:32,993 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:22:32,994 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:22:32,994 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:22:32,995 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:22:32,995 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:22:32,995 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:22:32,996 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:22:32,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:22:32,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:22:32,997 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:22:33,007 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:22:33,008 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:22:33,008 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:22:33,008 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:22:33,009 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:22:33,009 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:22:33,009 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:22:33,009 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:22:33,009 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:22:33,009 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:22:33,009 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:22:33,010 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:22:33,010 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:22:33,010 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:22:33,010 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:22:33,010 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:22:33,011 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:22:33,011 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:22:33,011 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:22:33,011 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:22:33,011 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:22:33,011 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:22:33,013 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:22:33,013 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:22:33,013 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:22:33,014 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:22:33,014 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:22:33,014 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:22:33,014 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:22:33,014 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:22:33,014 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:22:33,014 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:22:33,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:22:33,015 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:22:33,015 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10cd30ad3ca5cbac349bf58887b96141941b6c91 [2018-10-26 23:22:33,040 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:22:33,051 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:22:33,057 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:22:33,058 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:22:33,058 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:22:33,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-10-26 23:22:33,105 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/data/fb6c970e3/8cb33c86a4a344f484064fe873192613/FLAGfd1cdfc15 [2018-10-26 23:22:33,537 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:22:33,538 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/sv-benchmarks/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-10-26 23:22:33,553 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/data/fb6c970e3/8cb33c86a4a344f484064fe873192613/FLAGfd1cdfc15 [2018-10-26 23:22:33,567 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/data/fb6c970e3/8cb33c86a4a344f484064fe873192613 [2018-10-26 23:22:33,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:22:33,571 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:22:33,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:22:33,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:22:33,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:22:33,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:33,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45023a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33, skipping insertion in model container [2018-10-26 23:22:33,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:33,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:22:33,617 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:22:33,828 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:22:33,831 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:22:33,863 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:22:33,903 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:22:33,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33 WrapperNode [2018-10-26 23:22:33,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:22:33,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:22:33,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:22:33,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:22:33,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:33,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:33,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:22:34,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:22:34,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:22:34,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:22:34,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... [2018-10-26 23:22:34,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:22:34,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:22:34,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:22:34,022 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:22:34,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/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 [2018-10-26 23:22:34,077 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2018-10-26 23:22:34,077 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2018-10-26 23:22:34,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:22:34,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:22:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:22:34,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:22:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2018-10-26 23:22:34,078 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2018-10-26 23:22:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-10-26 23:22:34,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-10-26 23:22:34,078 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2018-10-26 23:22:34,078 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2018-10-26 23:22:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure __getMemory [2018-10-26 23:22:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure __getMemory [2018-10-26 23:22:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:22:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:22:34,476 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:22:34,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:22:34 BoogieIcfgContainer [2018-10-26 23:22:34,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:22:34,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:22:34,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:22:34,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:22:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:22:33" (1/3) ... [2018-10-26 23:22:34,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700a324d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:22:34, skipping insertion in model container [2018-10-26 23:22:34,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:22:33" (2/3) ... [2018-10-26 23:22:34,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700a324d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:22:34, skipping insertion in model container [2018-10-26 23:22:34,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:22:34" (3/3) ... [2018-10-26 23:22:34,483 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-10-26 23:22:34,491 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:22:34,500 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:22:34,517 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:22:34,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:22:34,541 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:22:34,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:22:34,542 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:22:34,542 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:22:34,542 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:22:34,542 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:22:34,542 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:22:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-10-26 23:22:34,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-26 23:22:34,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:34,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:34,562 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:34,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 713355486, now seen corresponding path program 1 times [2018-10-26 23:22:34,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:34,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:34,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:34,608 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:22:34,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:22:34,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:22:34,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:22:34,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:22:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:22:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:22:34,799 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 6 states. [2018-10-26 23:22:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:34,943 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-10-26 23:22:34,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:22:34,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-10-26 23:22:34,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:34,952 INFO L225 Difference]: With dead ends: 84 [2018-10-26 23:22:34,953 INFO L226 Difference]: Without dead ends: 39 [2018-10-26 23:22:34,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:22:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-26 23:22:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-26 23:22:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-26 23:22:34,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-10-26 23:22:34,987 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 13 [2018-10-26 23:22:34,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:34,988 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-10-26 23:22:34,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:22:34,988 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-10-26 23:22:34,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 23:22:34,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:34,990 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:22:34,990 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:34,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:34,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1315059296, now seen corresponding path program 1 times [2018-10-26 23:22:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:34,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:34,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:34,992 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:22:35,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:22:35,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:22:35,278 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:22:35,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:22:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:22:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:22:35,281 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 7 states. [2018-10-26 23:22:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:35,336 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-10-26 23:22:35,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:22:35,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-10-26 23:22:35,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:35,339 INFO L225 Difference]: With dead ends: 63 [2018-10-26 23:22:35,339 INFO L226 Difference]: Without dead ends: 44 [2018-10-26 23:22:35,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:22:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-26 23:22:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-26 23:22:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-26 23:22:35,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-10-26 23:22:35,353 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 38 [2018-10-26 23:22:35,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:35,353 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-10-26 23:22:35,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:22:35,354 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-10-26 23:22:35,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-26 23:22:35,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:35,354 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-10-26 23:22:35,355 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:35,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1021656289, now seen corresponding path program 1 times [2018-10-26 23:22:35,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:35,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:35,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:35,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:35,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:22:35,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:35,557 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:35,557 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-26 23:22:35,559 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [19], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79] [2018-10-26 23:22:35,601 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:22:35,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:22:36,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:22:36,120 INFO L272 AbstractInterpreter]: Visited 27 different actions 73 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-10-26 23:22:36,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:36,168 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:22:36,665 INFO L227 lantSequenceWeakener]: Weakened 34 states. On average, predicates are now at 59.62% of their original sizes. [2018-10-26 23:22:36,665 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:22:40,255 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-10-26 23:22:40,256 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:22:40,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:22:40,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [7] total 32 [2018-10-26 23:22:40,256 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:22:40,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-26 23:22:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-26 23:22:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-10-26 23:22:40,257 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 27 states. [2018-10-26 23:22:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:22:47,902 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-10-26 23:22:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-26 23:22:47,902 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2018-10-26 23:22:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:22:47,903 INFO L225 Difference]: With dead ends: 70 [2018-10-26 23:22:47,904 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 23:22:47,904 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=148, Invalid=1412, Unknown=0, NotChecked=0, Total=1560 [2018-10-26 23:22:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 23:22:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2018-10-26 23:22:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-26 23:22:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-10-26 23:22:47,919 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 38 [2018-10-26 23:22:47,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:22:47,919 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-10-26 23:22:47,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-26 23:22:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-10-26 23:22:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:22:47,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:22:47,920 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1] [2018-10-26 23:22:47,921 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:22:47,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:47,921 INFO L82 PathProgramCache]: Analyzing trace with hash -579660525, now seen corresponding path program 1 times [2018-10-26 23:22:47,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:22:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:47,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:22:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:22:47,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:22:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:22:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:22:48,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:22:48,051 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:22:48,051 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-26 23:22:48,051 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81] [2018-10-26 23:22:48,053 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:22:48,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:22:48,205 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:22:48,205 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-10-26 23:22:48,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:22:48,206 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:22:48,402 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 61.9% of their original sizes. [2018-10-26 23:22:48,402 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:22:50,704 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-10-26 23:22:50,705 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:22:50,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:22:50,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [7] total 38 [2018-10-26 23:22:50,705 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:22:50,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-26 23:22:50,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-26 23:22:50,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=975, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 23:22:50,706 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 33 states. [2018-10-26 23:23:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:00,647 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-10-26 23:23:00,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 23:23:00,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 45 [2018-10-26 23:23:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:00,649 INFO L225 Difference]: With dead ends: 88 [2018-10-26 23:23:00,649 INFO L226 Difference]: Without dead ends: 81 [2018-10-26 23:23:00,650 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2018-10-26 23:23:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-26 23:23:00,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-10-26 23:23:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-26 23:23:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-10-26 23:23:00,666 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 45 [2018-10-26 23:23:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:00,667 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-10-26 23:23:00,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-26 23:23:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-10-26 23:23:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:23:00,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:00,668 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1] [2018-10-26 23:23:00,668 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:00,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1389007151, now seen corresponding path program 1 times [2018-10-26 23:23:00,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:00,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:00,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:00,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:00,670 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-26 23:23:00,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:00,798 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:00,798 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-26 23:23:00,798 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [14], [17], [19], [22], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81] [2018-10-26 23:23:00,800 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:00,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:00,945 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:23:00,945 INFO L272 AbstractInterpreter]: Visited 33 different actions 85 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-10-26 23:23:00,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:00,952 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:23:01,162 INFO L227 lantSequenceWeakener]: Weakened 41 states. On average, predicates are now at 61.9% of their original sizes. [2018-10-26 23:23:01,162 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:23:03,449 INFO L415 sIntCurrentIteration]: We unified 44 AI predicates to 44 [2018-10-26 23:23:03,449 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:23:03,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:23:03,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [32] imperfect sequences [7] total 37 [2018-10-26 23:23:03,449 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:23:03,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-26 23:23:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-26 23:23:03,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-10-26 23:23:03,450 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 32 states. [2018-10-26 23:23:11,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:11,076 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-10-26 23:23:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-26 23:23:11,077 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-10-26 23:23:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:11,078 INFO L225 Difference]: With dead ends: 99 [2018-10-26 23:23:11,078 INFO L226 Difference]: Without dead ends: 80 [2018-10-26 23:23:11,078 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 60 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2018-10-26 23:23:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-26 23:23:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2018-10-26 23:23:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-26 23:23:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-10-26 23:23:11,092 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 45 [2018-10-26 23:23:11,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:11,093 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-10-26 23:23:11,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-26 23:23:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-10-26 23:23:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 23:23:11,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:11,094 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-10-26 23:23:11,094 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:11,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:11,094 INFO L82 PathProgramCache]: Analyzing trace with hash 279544102, now seen corresponding path program 1 times [2018-10-26 23:23:11,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:11,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:11,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:11,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:11,098 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:23:11,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:11,179 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:11,179 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 23:23:11,180 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-10-26 23:23:11,181 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:11,181 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:11,290 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:23:11,290 INFO L272 AbstractInterpreter]: Visited 37 different actions 89 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-10-26 23:23:11,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:11,296 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:23:11,483 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 63.19% of their original sizes. [2018-10-26 23:23:11,483 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:23:14,260 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 23:23:14,260 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:23:14,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:23:14,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [7] total 44 [2018-10-26 23:23:14,260 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:23:14,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-26 23:23:14,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-26 23:23:14,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1382, Unknown=0, NotChecked=0, Total=1482 [2018-10-26 23:23:14,262 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 39 states. [2018-10-26 23:23:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:22,439 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2018-10-26 23:23:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-26 23:23:22,439 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 57 [2018-10-26 23:23:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:22,440 INFO L225 Difference]: With dead ends: 104 [2018-10-26 23:23:22,440 INFO L226 Difference]: Without dead ends: 96 [2018-10-26 23:23:22,441 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=214, Invalid=2978, Unknown=0, NotChecked=0, Total=3192 [2018-10-26 23:23:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-26 23:23:22,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2018-10-26 23:23:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-26 23:23:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-10-26 23:23:22,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 57 [2018-10-26 23:23:22,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:22,457 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-10-26 23:23:22,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-26 23:23:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-10-26 23:23:22,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 23:23:22,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:22,458 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-10-26 23:23:22,459 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:22,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:22,459 INFO L82 PathProgramCache]: Analyzing trace with hash -529802524, now seen corresponding path program 1 times [2018-10-26 23:23:22,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:22,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:22,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:22,462 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:23:22,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:22,549 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:22,549 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 23:23:22,550 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-10-26 23:23:22,551 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:22,551 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:22,672 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:23:22,672 INFO L272 AbstractInterpreter]: Visited 40 different actions 98 times. Merged at 9 different actions 23 times. Never widened. Never found a fixpoint. Largest state had 32 variables. [2018-10-26 23:23:22,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:22,684 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:23:22,852 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-10-26 23:23:22,853 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:23:25,960 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 23:23:25,960 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:23:25,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:23:25,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [7] total 46 [2018-10-26 23:23:25,961 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:23:25,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-26 23:23:25,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-26 23:23:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1536, Unknown=0, NotChecked=0, Total=1640 [2018-10-26 23:23:25,962 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 41 states. [2018-10-26 23:23:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:37,777 INFO L93 Difference]: Finished difference Result 96 states and 99 transitions. [2018-10-26 23:23:37,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-26 23:23:37,777 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 57 [2018-10-26 23:23:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:37,778 INFO L225 Difference]: With dead ends: 96 [2018-10-26 23:23:37,779 INFO L226 Difference]: Without dead ends: 83 [2018-10-26 23:23:37,779 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 76 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=229, Invalid=3431, Unknown=0, NotChecked=0, Total=3660 [2018-10-26 23:23:37,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-26 23:23:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-10-26 23:23:37,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-26 23:23:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-10-26 23:23:37,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 57 [2018-10-26 23:23:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:37,792 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-10-26 23:23:37,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-26 23:23:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-10-26 23:23:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 23:23:37,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:37,793 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:23:37,793 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:37,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash -307261912, now seen corresponding path program 1 times [2018-10-26 23:23:37,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:37,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:37,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:37,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:23:37,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:37,874 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:37,874 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 23:23:37,875 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [9], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-10-26 23:23:37,876 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:37,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:38,067 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:23:38,067 INFO L272 AbstractInterpreter]: Visited 41 different actions 125 times. Merged at 13 different actions 34 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-10-26 23:23:38,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:38,076 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:23:38,324 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-10-26 23:23:38,328 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:23:41,835 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 23:23:41,835 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:23:41,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:23:41,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [7] total 47 [2018-10-26 23:23:41,836 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:23:41,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-26 23:23:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-26 23:23:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1525, Unknown=0, NotChecked=0, Total=1722 [2018-10-26 23:23:41,837 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 42 states. [2018-10-26 23:23:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:23:54,085 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-10-26 23:23:54,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-26 23:23:54,085 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 57 [2018-10-26 23:23:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:23:54,086 INFO L225 Difference]: With dead ends: 84 [2018-10-26 23:23:54,086 INFO L226 Difference]: Without dead ends: 63 [2018-10-26 23:23:54,087 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 79 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=405, Invalid=3755, Unknown=0, NotChecked=0, Total=4160 [2018-10-26 23:23:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-26 23:23:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2018-10-26 23:23:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 23:23:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-26 23:23:54,102 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 57 [2018-10-26 23:23:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:23:54,102 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-26 23:23:54,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-26 23:23:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-26 23:23:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 23:23:54,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:23:54,103 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:23:54,103 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:23:54,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:54,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1347450974, now seen corresponding path program 1 times [2018-10-26 23:23:54,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:23:54,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:54,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:23:54,107 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:23:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 23:23:54,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:54,228 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:23:54,228 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 23:23:54,228 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [64], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-10-26 23:23:54,230 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:23:54,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:23:54,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 23:23:54,527 INFO L272 AbstractInterpreter]: Visited 43 different actions 149 times. Merged at 14 different actions 40 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-10-26 23:23:54,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:23:54,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 23:23:54,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:23:54,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:23:54,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:23:54,583 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 23:23:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:23:54,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:23:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-26 23:23:57,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 23:23:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 23:23:57,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 23:23:57,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 21, 23] total 42 [2018-10-26 23:23:57,640 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 23:23:57,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-26 23:23:57,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-26 23:23:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2018-10-26 23:23:57,641 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 26 states. [2018-10-26 23:24:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:24:00,571 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-26 23:24:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 23:24:00,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 57 [2018-10-26 23:24:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:24:00,573 INFO L225 Difference]: With dead ends: 92 [2018-10-26 23:24:00,573 INFO L226 Difference]: Without dead ends: 58 [2018-10-26 23:24:00,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 77 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=368, Invalid=3054, Unknown=0, NotChecked=0, Total=3422 [2018-10-26 23:24:00,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-26 23:24:00,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-26 23:24:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-26 23:24:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 57 transitions. [2018-10-26 23:24:00,588 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 57 transitions. Word has length 57 [2018-10-26 23:24:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:24:00,588 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 57 transitions. [2018-10-26 23:24:00,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-26 23:24:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2018-10-26 23:24:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-26 23:24:00,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:24:00,592 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2018-10-26 23:24:00,592 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:24:00,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:24:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1246775843, now seen corresponding path program 1 times [2018-10-26 23:24:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:24:00,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:24:00,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:24:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:24:00,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:24:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:24:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-26 23:24:00,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:24:00,923 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:24:00,923 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-26 23:24:00,923 INFO L202 CegarAbsIntRunner]: [0], [2], [3], [4], [5], [6], [11], [13], [14], [17], [19], [22], [25], [27], [29], [30], [36], [38], [40], [43], [53], [56], [61], [65], [66], [67], [68], [69], [71], [72], [73], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85] [2018-10-26 23:24:00,924 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:24:00,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:24:01,229 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:24:01,229 INFO L272 AbstractInterpreter]: Visited 40 different actions 99 times. Merged at 5 different actions 14 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 32 variables. [2018-10-26 23:24:01,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:24:01,272 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:24:01,614 INFO L227 lantSequenceWeakener]: Weakened 53 states. On average, predicates are now at 64.32% of their original sizes. [2018-10-26 23:24:01,614 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:24:08,855 INFO L415 sIntCurrentIteration]: We unified 56 AI predicates to 56 [2018-10-26 23:24:08,855 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:24:08,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:24:08,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [20] total 60 [2018-10-26 23:24:08,856 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:24:08,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-26 23:24:08,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-26 23:24:08,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2018-10-26 23:24:08,857 INFO L87 Difference]: Start difference. First operand 58 states and 57 transitions. Second operand 42 states. [2018-10-26 23:24:25,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:24:25,117 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2018-10-26 23:24:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-26 23:24:25,118 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 57 [2018-10-26 23:24:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:24:25,118 INFO L225 Difference]: With dead ends: 58 [2018-10-26 23:24:25,118 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:24:25,119 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 74 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=388, Invalid=3152, Unknown=0, NotChecked=0, Total=3540 [2018-10-26 23:24:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:24:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:24:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:24:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:24:25,120 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-10-26 23:24:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:24:25,120 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:24:25,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-26 23:24:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:24:25,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:24:25,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:24:25,616 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 213 [2018-10-26 23:24:25,899 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 190 [2018-10-26 23:24:26,376 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 217 [2018-10-26 23:24:26,489 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 225 [2018-10-26 23:24:32,658 WARN L179 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 466 DAG size of output: 120 [2018-10-26 23:24:33,506 WARN L179 SmtUtils]: Spent 844.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 70 [2018-10-26 23:24:34,382 WARN L179 SmtUtils]: Spent 872.00 ms on a formula simplification. DAG size of input: 379 DAG size of output: 63 [2018-10-26 23:24:35,245 WARN L179 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 316 DAG size of output: 56 [2018-10-26 23:24:35,896 WARN L179 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 62 [2018-10-26 23:24:36,044 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 43 [2018-10-26 23:24:36,764 WARN L179 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 61 [2018-10-26 23:24:36,915 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 43 [2018-10-26 23:24:37,656 WARN L179 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 325 DAG size of output: 91 [2018-10-26 23:24:37,990 WARN L179 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 45 [2018-10-26 23:24:39,346 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 348 DAG size of output: 94 [2018-10-26 23:24:39,778 WARN L179 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 269 DAG size of output: 53 [2018-10-26 23:24:40,662 WARN L179 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 73 [2018-10-26 23:24:41,191 WARN L179 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 53 [2018-10-26 23:24:41,193 INFO L425 ceAbstractionStarter]: For program point my_mallocFINAL(lines 878 880) no Hoare annotation was computed. [2018-10-26 23:24:41,193 INFO L421 ceAbstractionStarter]: At program point L879(line 879) the Hoare annotation is: (let ((.cse4 (+ |~#head~0.offset| 8))) (let ((.cse0 (<= 8 (+ ~guard_malloc_counter~0.base |my_malloc_#in~size|))) (.cse1 (<= my_malloc_~size (+ ~elem~0.base 8))) (.cse2 (<= (+ ~guard_malloc_counter~0.base 8) my_malloc_~size)) (.cse3 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse5 (< 0 (+ |~#head~0.offset| ~elem~0.base))) (.cse6 (< .cse4 |my_malloc_#in~size|)) (.cse7 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse8 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (and .cse0 .cse1 (<= ~guard_malloc_counter~0.offset ~elem~0.offset) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) .cse2) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< .cse3 0) (< |my_malloc_#in~size| .cse4) .cse5 .cse6 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse7 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse8) (or (and .cse0 .cse1 (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1)) .cse2) (< (+ ~elem~0.offset ~elem~0.base) 0) (< |my_malloc_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse3 1) .cse5 .cse6 .cse7 .cse8)))) [2018-10-26 23:24:41,194 INFO L425 ceAbstractionStarter]: For program point L879-1(line 879) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L421 ceAbstractionStarter]: At program point my_mallocENTRY(lines 878 880) the Hoare annotation is: (let ((.cse6 (+ |~#head~0.offset| 8))) (let ((.cse0 (<= 0 (* 2 ~guard_malloc_counter~0.base))) (.cse1 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse2 (< 0 (+ |~#head~0.offset| ~elem~0.base))) (.cse3 (< .cse6 |my_malloc_#in~size|)) (.cse4 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse5 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (and (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0) .cse0 (<= 1 (+ ~elem~0.base ~guard_malloc_counter~0.offset)) (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1))) (< (+ ~elem~0.offset ~elem~0.base) 0) (< |my_malloc_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse1 1) .cse2 .cse3 .cse4 .cse5) (or (and (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) .cse0 (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset))) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< .cse1 0) (< |my_malloc_#in~size| .cse6) .cse2 .cse3 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse4 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse5)))) [2018-10-26 23:24:41,195 INFO L425 ceAbstractionStarter]: For program point my_mallocEXIT(lines 878 880) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (<= |old(~guard_malloc_counter~0.offset)| ~guard_malloc_counter~0.offset) (<= ~elem~0.offset |old(~elem~0.offset)|)) [2018-10-26 23:24:41,195 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L425 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L425 ceAbstractionStarter]: For program point L896-2(lines 895 898) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L425 ceAbstractionStarter]: For program point list_delEXIT(lines 895 898) no Hoare annotation was computed. [2018-10-26 23:24:41,195 INFO L421 ceAbstractionStarter]: At program point list_delENTRY(lines 895 898) the Hoare annotation is: (let ((.cse7 (+ ~elem~0.base |list_del_#in~entry.base|))) (let ((.cse1 (* 2 |old(~elem~0.offset)|)) (.cse3 (* 2 ~elem~0.offset)) (.cse4 (<= .cse7 0)) (.cse2 (not (= (mod |list_del_#in~entry.offset| 2) 0))) (.cse6 (+ |old(~elem~0.offset)| |old(~elem~0.base)|)) (.cse5 (< |~#head~0.offset| |list_del_#in~entry.base|)) (.cse0 (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)))) (and (or (and (<= 0 (* 2 ~elem~0.base)) (= ~elem~0.offset 0) (<= (+ |~#head~0.offset| ~elem~0.base) 0)) (< |old(~elem~0.base)| |old(~elem~0.offset)|) .cse0 (< (+ |~#head~0.offset| |old(~elem~0.offset)|) 0) (< .cse1 0) (< 0 .cse1)) (or .cse2 (and (<= ~elem~0.offset (+ ~elem~0.base 1)) (<= 2 .cse3) .cse4) (< .cse1 2) (< (+ |list_del_#in~entry.base| 1) |old(~elem~0.offset)|) .cse5 (< .cse6 1) (< |list_del_#in~entry.offset| |old(~elem~0.offset)|) (< 3 (+ |list_del_#in~entry.offset| |old(~elem~0.offset)|)) .cse0) (or (and (= (mod ~elem~0.offset 2) 0) (and (<= 0 .cse7) (<= 0 .cse3) (<= ~elem~0.offset (+ ~elem~0.base 2)) .cse4)) (or .cse2 (< .cse6 0) (< (+ |list_del_#in~entry.base| 2) |old(~elem~0.offset)|) (< 2 (+ |list_del_#in~entry.offset| |~#head~0.offset|)) (< 0 (* 2 |~#head~0.offset|)) (< (+ |~#head~0.offset| |list_del_#in~entry.base|) 0) (< (+ |old(~elem~0.base)| |list_del_#in~entry.base|) 0) .cse5 (< (+ |list_del_#in~entry.offset| |list_del_#in~entry.base|) 1) .cse0) (not (= (mod |old(~elem~0.offset)| 2) 0)))))) [2018-10-26 23:24:41,196 INFO L421 ceAbstractionStarter]: At program point list_addENTRY(lines 889 893) the Hoare annotation is: (let ((.cse23 (* 2 ~elem~0.offset)) (.cse21 (+ ~elem~0.offset ~elem~0.base)) (.cse22 (+ |old(~elem~0.offset)| |old(~elem~0.base)|))) (let ((.cse2 (< ~guard_malloc_counter~0.offset 0)) (.cse11 (<= ~elem~0.base |list_add_#in~new.base|)) (.cse14 (< 1 (+ |old(~elem~0.offset)| |list_add_#in~new.base|))) (.cse13 (not (= (mod |list_add_#in~new.offset| 2) 0))) (.cse5 (< .cse22 0)) (.cse16 (< (+ |list_add_#in~new.base| 2) |list_add_#in~new.offset|)) (.cse8 (< 0 (* 2 |list_add_#in~new.base|))) (.cse0 (<= .cse21 0)) (.cse1 (<= 0 .cse23)) (.cse3 (< |list_add_#in~head.base| |~#head~0.base|)) (.cse4 (< |~#head~0.base| |list_add_#in~head.base|)) (.cse18 (+ |list_add_#in~head.offset| |old(~elem~0.offset)|)) (.cse12 (<= 2 .cse23)) (.cse20 (+ ~elem~0.base 2)) (.cse17 (< |old(~elem~0.base)| |~#head~0.offset|)) (.cse15 (< .cse22 1)) (.cse7 (< (+ |list_add_#in~head.offset| |list_add_#in~new.base|) 0)) (.cse9 (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|))) (.cse19 (< |~#head~0.offset| |list_add_#in~new.base|)) (.cse10 (not (= |list_add_#in~new.offset| 1))) (.cse6 (< (+ |~#head~0.offset| 1) |list_add_#in~new.offset|))) (and (or (and (<= 0 (+ |list_add_#in~head.offset| ~elem~0.base)) .cse0 .cse1) .cse2 (or .cse3 (not (= |old(~elem~0.offset)| 0)) .cse4 .cse5 .cse6) .cse7 (< 1 (+ |list_add_#in~new.offset| |list_add_#in~head.offset|)) .cse8 .cse9 .cse10) (or (and .cse11 (<= ~elem~0.offset (+ ~elem~0.base 1)) .cse12) .cse13 (< (+ |list_add_#in~new.offset| |list_add_#in~new.base|) 1) (< (+ |~#head~0.offset| |old(~elem~0.offset)|) 1) .cse14 (< |old(~elem~0.offset)| (+ |list_add_#in~head.offset| 1)) .cse15 .cse7 .cse16 .cse9) (or .cse2 (and (<= ~elem~0.offset |old(~elem~0.offset)|) .cse11 (<= 2 (+ |list_add_#in~new.offset| ~elem~0.base)) .cse1) (or .cse14 .cse7 (< |list_add_#in~new.offset| (+ |list_add_#in~head.offset| 2)) .cse16 .cse8) (or .cse17 (< (* 2 |~#head~0.offset|) 0) .cse9 (< (* 2 |old(~elem~0.offset)|) 0))) (or .cse3 .cse13 (< 0 .cse18) .cse4 .cse5 (< (+ |list_add_#in~new.offset| |~#head~0.offset|) 1) .cse7 .cse16 .cse8 .cse9 .cse19 (and (<= |list_add_#in~new.offset| .cse20) .cse0 .cse1)) (or (or .cse3 (not (= (mod |old(~elem~0.offset)| 2) 0)) .cse4 (< 2 .cse18)) (and (= (mod ~elem~0.offset 2) 0) (<= .cse21 2) .cse12 (<= ~elem~0.offset .cse20)) .cse17 .cse15 .cse7 .cse9 .cse19 .cse10 .cse6)))) [2018-10-26 23:24:41,196 INFO L425 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2018-10-26 23:24:41,196 INFO L425 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-10-26 23:24:41,196 INFO L425 ceAbstractionStarter]: For program point L891-2(lines 889 893) no Hoare annotation was computed. [2018-10-26 23:24:41,196 INFO L421 ceAbstractionStarter]: At program point L890-2(line 890) the Hoare annotation is: (let ((.cse16 (+ |old(~elem~0.offset)| |old(~elem~0.base)|))) (let ((.cse9 (not (= (mod |list_add_#in~new.offset| 2) 0))) (.cse3 (< .cse16 0)) (.cse0 (< ~guard_malloc_counter~0.offset 0)) (.cse10 (< 1 (+ |old(~elem~0.offset)| |list_add_#in~new.base|))) (.cse12 (< (+ |list_add_#in~new.base| 2) |list_add_#in~new.offset|)) (.cse6 (< 0 (* 2 |list_add_#in~new.base|))) (.cse1 (< |list_add_#in~head.base| |~#head~0.base|)) (.cse2 (< |~#head~0.base| |list_add_#in~head.base|)) (.cse13 (+ |list_add_#in~head.offset| |old(~elem~0.offset)|)) (.cse15 (< |old(~elem~0.base)| |~#head~0.offset|)) (.cse11 (< .cse16 1)) (.cse5 (< (+ |list_add_#in~head.offset| |list_add_#in~new.base|) 0)) (.cse7 (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|))) (.cse14 (< |~#head~0.offset| |list_add_#in~new.base|)) (.cse8 (not (= |list_add_#in~new.offset| 1))) (.cse4 (< (+ |~#head~0.offset| 1) |list_add_#in~new.offset|))) (and (or .cse0 (or .cse1 (not (= |old(~elem~0.offset)| 0)) .cse2 .cse3 .cse4) .cse5 (< 1 (+ |list_add_#in~new.offset| |list_add_#in~head.offset|)) .cse6 .cse7 .cse8) (or .cse9 (< (+ |list_add_#in~new.offset| |list_add_#in~new.base|) 1) (< (+ |~#head~0.offset| |old(~elem~0.offset)|) 1) .cse10 (< |old(~elem~0.offset)| (+ |list_add_#in~head.offset| 1)) .cse11 .cse5 .cse12 .cse7) (or .cse1 .cse9 (< 0 .cse13) .cse2 .cse3 (< (+ |list_add_#in~new.offset| |~#head~0.offset|) 1) .cse5 .cse12 .cse6 .cse7 .cse14) (or .cse0 (or .cse10 .cse5 (< |list_add_#in~new.offset| (+ |list_add_#in~head.offset| 2)) .cse12 .cse6) (or .cse15 (< (* 2 |~#head~0.offset|) 0) .cse7 (< (* 2 |old(~elem~0.offset)|) 0))) (or (or .cse1 (not (= (mod |old(~elem~0.offset)| 2) 0)) .cse2 (< 2 .cse13)) .cse15 .cse11 .cse5 .cse7 .cse14 .cse8 .cse4)))) [2018-10-26 23:24:41,196 INFO L425 ceAbstractionStarter]: For program point L890-3(line 890) no Hoare annotation was computed. [2018-10-26 23:24:41,196 INFO L425 ceAbstractionStarter]: For program point list_addEXIT(lines 889 893) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-10-26 23:24:41,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= ~guard_malloc_counter~0.offset ~elem~0.base) (<= ~guard_malloc_counter~0.offset ~elem~0.offset) (<= 0 (+ |~#head~0.offset| ~guard_malloc_counter~0.base)) (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) [2018-10-26 23:24:41,197 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:24:41,197 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 902 917) the Hoare annotation is: (or (and (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) (<= ~guard_malloc_counter~0.offset ~elem~0.base) (<= 0 (* 2 ~guard_malloc_counter~0.base)) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-10-26 23:24:41,197 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 902 917) no Hoare annotation was computed. [2018-10-26 23:24:41,197 INFO L421 ceAbstractionStarter]: At program point L909(line 909) the Hoare annotation is: (let ((.cse0 (<= main_~dev2~0.offset (+ ~elem~0.base 2))) (.cse1 (= (mod main_~dev2~0.offset 2) 0))) (or (and (<= ~elem~0.base main_~dev2~0.base) (<= 1 (+ main_~dev2~0.offset ~elem~0.offset)) .cse0 .cse1 (<= main_~dev2~0.base ~elem~0.offset) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) (let ((.cse2 (+ ~elem~0.base 1))) (and (<= (+ ~elem~0.base main_~dev2~0.base) 0) .cse0 (<= ~elem~0.offset .cse2) (<= .cse2 main_~dev2~0.offset) (<= 2 (* 2 ~elem~0.offset)) .cse1 (<= ~elem~0.offset (+ main_~dev2~0.base 1)))) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|))) [2018-10-26 23:24:41,198 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 902 917) no Hoare annotation was computed. [2018-10-26 23:24:41,198 INFO L421 ceAbstractionStarter]: At program point L908(line 908) the Hoare annotation is: (let ((.cse3 (+ main_~dev2~0.base 1)) (.cse7 (+ ~elem~0.base 1)) (.cse6 (+ ~elem~0.base 2))) (let ((.cse0 (<= main_~dev2~0.offset .cse6)) (.cse5 (<= .cse7 main_~dev2~0.offset)) (.cse4 (* 2 ~elem~0.offset)) (.cse2 (= (mod main_~dev2~0.offset 2) 0)) (.cse1 (<= ~elem~0.offset .cse3))) (or (and (and (<= ~elem~0.base main_~dev2~0.base) (<= main_~dev2~0.base |~#head~0.offset|) .cse0 (<= main_~dev2~0.base ~elem~0.offset) .cse1) .cse2 (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= 1 (+ main_~dev2~0.offset ~elem~0.offset)) (not (= main_~dev2~0.offset 0))) (and .cse2 (= main_~dev2~0.base 0) (<= .cse3 main_~dev1~0.offset) (<= (+ main_~dev1~0.offset ~elem~0.base) 1) (<= 0 .cse4) .cse5 (<= main_~dev2~0.offset (+ main_~dev1~0.base 2)) (<= 0 (+ main_~dev1~0.base ~elem~0.base)) (<= ~elem~0.offset .cse6) (<= (+ main_~dev1~0.base |~#head~0.offset|) 0)) (and (<= (+ ~elem~0.base main_~dev2~0.base) 0) .cse0 (<= ~elem~0.offset .cse7) .cse5 (<= 2 .cse4) .cse2 .cse1) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)))) [2018-10-26 23:24:41,198 INFO L421 ceAbstractionStarter]: At program point L907(line 907) the Hoare annotation is: (or (and (<= 2 (+ main_~dev2~0.offset main_~dev2~0.base)) (<= main_~dev2~0.base |~#head~0.offset|) (<= (+ main_~dev1~0.base main_~dev1~0.offset) 1) (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= main_~dev2~0.offset (+ main_~dev1~0.base 2)) (<= 1 (+ ~elem~0.offset main_~dev1~0.offset)) (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= 0 (+ main_~dev1~0.base ~elem~0.base)) (<= (+ main_~dev1~0.base |~#head~0.offset|) 0)) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-10-26 23:24:41,198 INFO L425 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-10-26 23:24:41,198 INFO L421 ceAbstractionStarter]: At program point L907-1(line 907) the Hoare annotation is: (let ((.cse0 (<= main_~dev1~0.offset (+ main_~dev1~0.base 1))) (.cse1 (+ ~elem~0.offset ~elem~0.base)) (.cse2 (* 2 ~elem~0.offset)) (.cse3 (<= main_~dev2~0.offset (+ main_~dev1~0.base 2))) (.cse4 (<= (+ main_~dev1~0.base |~#head~0.offset|) 0))) (or (and (<= (+ |old(~guard_malloc_counter~0.offset)| 1) ~guard_malloc_counter~0.offset) (<= 2 (+ main_~dev2~0.offset main_~dev2~0.base)) (<= main_~dev2~0.base |~#head~0.offset|) (<= 3 (+ main_~dev2~0.offset main_~dev1~0.offset)) .cse0 (<= .cse1 0) (<= 0 .cse2) .cse3 (<= 0 (+ main_~dev1~0.base ~elem~0.base)) .cse4) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (and (= (mod main_~dev2~0.offset 2) 0) (= main_~dev2~0.base 0) (= (mod ~elem~0.offset 2) 0) (<= (+ main_~dev2~0.base 1) main_~dev1~0.offset) .cse0 (<= .cse1 2) (<= (+ ~elem~0.base 1) main_~dev2~0.offset) (<= 2 .cse2) .cse3 (<= ~elem~0.offset (+ ~elem~0.base 2)) .cse4) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|))) [2018-10-26 23:24:41,198 INFO L421 ceAbstractionStarter]: At program point L905(line 905) the Hoare annotation is: (or (let ((.cse0 (<= 1 (+ ~elem~0.offset ~guard_malloc_counter~0.offset))) (.cse1 (<= 0 (+ main_~dev1~0.base ~guard_malloc_counter~0.base))) (.cse2 (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0)) (.cse3 (<= (+ ~elem~0.offset ~elem~0.base) 0)) (.cse4 (<= (+ main_~dev1~0.base |~#head~0.offset|) 0)) (.cse5 (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1)))) (or (and .cse0 (<= (+ main_~dev1~0.offset ~guard_malloc_counter~0.offset) 2) .cse1 .cse2 (<= ~guard_malloc_counter~0.offset main_~dev1~0.offset) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= ~guard_malloc_counter~0.offset (+ main_~dev1~0.offset 1)) (<= (* 2 main_~dev1~0.offset) 0) .cse4 .cse5))) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-10-26 23:24:41,198 INFO L425 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L421 ceAbstractionStarter]: At program point L904(line 904) the Hoare annotation is: (or (and (<= (+ ~elem~0.offset ~elem~0.base) 0) (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) (<= ~guard_malloc_counter~0.offset ~elem~0.base) (<= 0 (* 2 ~guard_malloc_counter~0.base)) (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset)) (<= (+ |~#head~0.offset| ~elem~0.offset) 0)) (< 0 (* 2 |old(~guard_malloc_counter~0.offset)|)) (< (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|) 0) (< 0 (+ |~#head~0.offset| |old(~elem~0.base)|)) (< (+ |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|) 0) (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|)) (< |old(~elem~0.base)| |old(~guard_malloc_counter~0.offset)|) (< |old(~guard_malloc_counter~0.base)| |old(~elem~0.offset)|)) [2018-10-26 23:24:41,199 INFO L425 ceAbstractionStarter]: For program point L905-1(line 905) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L425 ceAbstractionStarter]: For program point L904-1(line 904) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L421 ceAbstractionStarter]: At program point __getMemoryENTRY(lines 869 876) the Hoare annotation is: (let ((.cse0 (<= 0 (* 2 ~guard_malloc_counter~0.base))) (.cse1 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse2 (< 16 (* 2 |__getMemory_#in~size|))) (.cse3 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse4 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (and (<= (+ ~elem~0.offset ~guard_malloc_counter~0.base) 0) .cse0 (<= 1 (+ ~elem~0.base ~guard_malloc_counter~0.offset)) (<= ~guard_malloc_counter~0.offset (+ ~elem~0.base 1))) (< (+ ~elem~0.offset ~elem~0.base) 0) (< |__getMemory_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse1 1) (< 0 (+ |~#head~0.offset| ~elem~0.base)) .cse2 .cse3 .cse4) (or (and (<= (+ ~guard_malloc_counter~0.base ~guard_malloc_counter~0.offset) 0) .cse0 (<= 0 (+ ~elem~0.offset ~guard_malloc_counter~0.offset))) (< |__getMemory_#in~size| (+ ~elem~0.base 8)) (< .cse1 0) .cse2 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse3 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse4))) [2018-10-26 23:24:41,199 INFO L425 ceAbstractionStarter]: For program point __getMemoryEXIT(lines 869 876) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L425 ceAbstractionStarter]: For program point __getMemoryFINAL(lines 869 876) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L425 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L425 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-10-26 23:24:41,199 INFO L421 ceAbstractionStarter]: At program point L871-2(line 871) the Hoare annotation is: (let ((.cse0 (+ |~#head~0.offset| |old(~guard_malloc_counter~0.offset)|)) (.cse1 (< 16 (* 2 |__getMemory_#in~size|))) (.cse2 (< 0 (+ |old(~guard_malloc_counter~0.base)| |~#head~0.offset|))) (.cse3 (< |old(~guard_malloc_counter~0.base)| ~elem~0.offset))) (and (or (< (+ ~elem~0.offset ~elem~0.base) 0) (< |__getMemory_#in~size| (+ |old(~guard_malloc_counter~0.offset)| 7)) (< .cse0 1) (< 0 (+ |~#head~0.offset| ~elem~0.base)) .cse1 .cse2 .cse3) (or (< |__getMemory_#in~size| (+ ~elem~0.base 8)) (< .cse0 0) .cse1 (< (+ |old(~guard_malloc_counter~0.base)| ~elem~0.offset) 0) .cse2 (< ~elem~0.base |old(~guard_malloc_counter~0.offset)|) .cse3))) [2018-10-26 23:24:41,200 INFO L425 ceAbstractionStarter]: For program point L871-3(line 871) no Hoare annotation was computed. [2018-10-26 23:24:41,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:24:41 BoogieIcfgContainer [2018-10-26 23:24:41,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:24:41,203 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:24:41,203 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:24:41,203 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:24:41,203 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:22:34" (3/4) ... [2018-10-26 23:24:41,206 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 23:24:41,215 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure my_malloc [2018-10-26 23:24:41,215 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 23:24:41,215 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure list_del [2018-10-26 23:24:41,215 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure list_add [2018-10-26 23:24:41,216 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __blast_assert [2018-10-26 23:24:41,216 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 23:24:41,216 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __getMemory [2018-10-26 23:24:41,219 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-10-26 23:24:41,223 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-10-26 23:24:41,224 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 23:24:41,224 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 23:24:41,259 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c50f1a0b-452b-4781-85fe-5d4c1b06f2a1/bin-2019/utaipan/witness.graphml [2018-10-26 23:24:41,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:24:41,260 INFO L168 Benchmark]: Toolchain (without parser) took 127689.77 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 826.3 MB). Free memory was 957.5 MB in the beginning and 1.6 GB in the end (delta: -617.4 MB). Peak memory consumption was 208.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,260 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:24:41,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.89 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 928.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 928.0 MB in the beginning and 1.2 GB in the end (delta: -270.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,261 INFO L168 Benchmark]: Boogie Preprocessor took 21.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,262 INFO L168 Benchmark]: RCFGBuilder took 455.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,262 INFO L168 Benchmark]: TraceAbstraction took 126724.94 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 625.5 MB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -422.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,262 INFO L168 Benchmark]: Witness Printer took 56.37 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-10-26 23:24:41,268 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.89 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 928.0 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 928.0 MB in the beginning and 1.2 GB in the end (delta: -270.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 126724.94 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 625.5 MB). Free memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: -422.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 56.37 ms. Allocated memory is still 1.9 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 47 locations, 1 error locations. SAFE Result, 126.6s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 76.8s AutomataDifference, 0.0s DeadEndRemovalTime, 16.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 348 SDtfs, 479 SDslu, 3362 SDs, 0 SdLazy, 4353 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 14 DeclaredPredicates, 628 GetRequests, 187 SyntacticMatches, 7 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3992 ImplicationChecksByTransitivity, 43.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.0s AbstIntTime, 8 AbstIntIterations, 7 AbstIntStrong, 0.9458531746534413 AbsIntWeakeningRatio, 1.5587392550143266 AbsIntAvgWeakeningVarsNumRemoved, 173.7134670487106 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 70 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 78 PreInvPairs, 91 NumberOfFragments, 2124 HoareAnnotationTreeSize, 78 FomulaSimplifications, 6320 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 18 FomulaSimplificationsInter, 31990 FormulaSimplificationTreeSizeReductionInter, 14.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 566 ConstructedInterpolants, 0 QuantifiedInterpolants, 76586 SizeOfPredicates, 8 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 142/195 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...