./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f099b3088cdddba520ecec4ee7d81a8a64d96ac3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label27.c -s /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f099b3088cdddba520ecec4ee7d81a8a64d96ac3 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:01:13,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:01:13,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:01:13,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:01:13,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:01:13,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:01:13,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:01:13,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:01:13,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:01:13,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:01:13,822 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:01:13,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:01:13,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:01:13,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:01:13,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:01:13,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:01:13,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:01:13,829 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:01:13,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:01:13,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:01:13,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:01:13,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:01:13,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:01:13,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:01:13,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:01:13,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:01:13,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:01:13,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:01:13,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:01:13,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:01:13,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:01:13,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:01:13,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:01:13,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:01:13,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:01:13,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:01:13,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:01:13,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:01:13,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:01:13,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:01:13,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:01:13,849 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 19:01:13,865 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:01:13,865 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:01:13,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:01:13,866 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 19:01:13,866 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 19:01:13,867 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:01:13,867 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 19:01:13,867 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 19:01:13,867 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 19:01:13,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:01:13,867 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:01:13,868 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:01:13,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:01:13,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 19:01:13,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 19:01:13,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:01:13,870 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:01:13,870 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:01:13,870 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/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(reach_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 -> f099b3088cdddba520ecec4ee7d81a8a64d96ac3 [2020-12-09 19:01:14,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:01:14,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:01:14,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:01:14,065 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:01:14,065 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:01:14,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label27.c [2020-12-09 19:01:14,107 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/c4bcb7413/4998e523206545e5b760d50c0914d862/FLAGc38fee2e0 [2020-12-09 19:01:14,542 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:01:14,542 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/sv-benchmarks/c/eca-rers2012/Problem10_label27.c [2020-12-09 19:01:14,554 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/c4bcb7413/4998e523206545e5b760d50c0914d862/FLAGc38fee2e0 [2020-12-09 19:01:14,567 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/c4bcb7413/4998e523206545e5b760d50c0914d862 [2020-12-09 19:01:14,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:01:14,570 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:01:14,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:01:14,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:01:14,575 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:01:14,576 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:14,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486aa70c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14, skipping insertion in model container [2020-12-09 19:01:14,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:14,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:01:14,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:01:14,774 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/sv-benchmarks/c/eca-rers2012/Problem10_label27.c[6867,6880] [2020-12-09 19:01:14,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:01:14,863 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:01:14,884 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/sv-benchmarks/c/eca-rers2012/Problem10_label27.c[6867,6880] [2020-12-09 19:01:14,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:01:14,935 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:01:14,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14 WrapperNode [2020-12-09 19:01:14,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:01:14,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:01:14,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:01:14,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:01:14,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:14,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,011 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:01:15,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:01:15,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:01:15,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:01:15,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,072 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... [2020-12-09 19:01:15,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:01:15,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:01:15,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:01:15,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:01:15,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/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 [2020-12-09 19:01:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 19:01:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:01:15,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:01:15,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:01:21,222 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:01:21,223 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 19:01:21,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:01:21 BoogieIcfgContainer [2020-12-09 19:01:21,225 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:01:21,226 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:01:21,227 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:01:21,229 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:01:21,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:01:14" (1/3) ... [2020-12-09 19:01:21,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb7a630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:01:21, skipping insertion in model container [2020-12-09 19:01:21,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:14" (2/3) ... [2020-12-09 19:01:21,230 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb7a630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:01:21, skipping insertion in model container [2020-12-09 19:01:21,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:01:21" (3/3) ... [2020-12-09 19:01:21,231 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label27.c [2020-12-09 19:01:21,240 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:01:21,243 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 19:01:21,250 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 19:01:21,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:01:21,265 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:01:21,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:01:21,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:01:21,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:01:21,266 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:01:21,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:01:21,266 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:01:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 19:01:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 19:01:21,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:01:21,277 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 19:01:21,277 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:01:21,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:01:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash 857618522, now seen corresponding path program 1 times [2020-12-09 19:01:21,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:01:21,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364518495] [2020-12-09 19:01:21,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:01:21,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:01:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:01:21,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364518495] [2020-12-09 19:01:21,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:01:21,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:01:21,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468812647] [2020-12-09 19:01:21,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:01:21,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:01:21,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:01:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:01:21,454 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2020-12-09 19:01:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:01:21,526 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 19:01:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:01:21,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-12-09 19:01:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:01:21,533 INFO L225 Difference]: With dead ends: 23 [2020-12-09 19:01:21,533 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 19:01:21,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:01:21,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 19:01:21,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 19:01:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 19:01:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 19:01:21,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 19:01:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:01:21,557 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 19:01:21,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:01:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 19:01:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:01:21,558 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:01:21,558 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 19:01:21,558 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 19:01:21,558 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:01:21,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:01:21,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1058801748, now seen corresponding path program 1 times [2020-12-09 19:01:21,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:01:21,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109227804] [2020-12-09 19:01:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:01:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:01:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:01:21,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109227804] [2020-12-09 19:01:21,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214781624] [2020-12-09 19:01:21,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:01:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:01:21,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 19:01:21,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:01:22,066 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 1003 DAG size of output: 128 [2020-12-09 19:01:22,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 2, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 19:01:22,115 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 19:01:22,119 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 19:01:22,130 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:01:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:01:22,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:01:22,524 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 1668 DAG size of output: 930 [2020-12-09 19:01:22,568 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,569 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,570 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,570 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,577 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,578 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,579 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,579 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,584 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,584 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,587 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,588 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,591 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,591 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,592 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,592 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,593 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,593 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,594 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,594 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,594 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,594 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,595 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,596 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,596 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,597 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,597 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,597 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,598 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,598 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,599 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,599 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,600 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,600 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,600 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,601 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,602 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,602 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,603 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,603 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,603 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,604 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,605 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,605 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,607 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,608 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,610 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,611 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,613 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,613 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,614 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,614 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,618 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,618 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,620 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,620 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,623 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,623 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,624 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,624 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,625 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,625 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,626 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,626 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,628 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,628 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,629 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,629 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,632 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,632 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,633 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,633 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,636 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,636 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,638 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,639 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,641 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,641 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,643 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,643 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,645 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,645 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,647 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,648 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,648 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,649 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,651 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,652 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,654 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,654 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,654 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,655 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,657 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,658 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,660 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,660 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,660 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,661 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,663 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,664 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,665 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,665 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,667 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,667 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,668 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,669 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,670 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,670 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,671 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,671 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,672 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,673 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,674 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,674 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,675 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,675 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,675 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,676 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,676 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,676 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,677 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,677 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,679 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,679 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,681 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,681 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,682 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,682 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,683 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,683 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,684 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,684 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,685 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,685 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,686 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,686 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,687 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,687 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,688 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,688 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,689 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,689 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,689 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,690 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,690 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,690 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,691 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,691 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,692 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,692 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,693 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,693 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,694 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,694 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,695 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,696 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,697 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,697 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,698 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,698 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,713 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,713 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,715 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,716 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,719 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:01:22,719 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,720 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,721 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,722 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,722 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,723 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,723 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,725 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:01:22,725 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,726 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,726 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,728 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:01:22,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,734 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,735 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,738 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,739 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,741 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,742 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,745 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,745 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,748 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,748 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,751 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,751 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,754 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,754 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,756 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,757 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,759 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,759 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,762 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,762 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,764 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,765 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,767 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,767 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,770 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,770 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,773 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 7, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,773 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,776 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,776 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,778 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,779 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,781 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 12, 7, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,781 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,782 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,783 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,784 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,784 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,785 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,786 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,787 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,787 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,788 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,788 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,789 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,790 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,790 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,790 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,791 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,798 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,798 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,803 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,803 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,806 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,807 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,810 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,810 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,812 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,815 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,817 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,819 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,821 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,821 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,824 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,824 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,826 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,826 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,828 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,829 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 6, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,830 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,831 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 7, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,831 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,832 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,832 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,833 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,834 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,835 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 12, 7, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,836 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,837 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,837 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,839 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,839 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,840 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,841 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,842 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,842 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,843 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,843 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,845 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,845 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,846 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,846 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:22,847 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 8, 7, 2, 1] term [2020-12-09 19:01:22,847 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:01:23,297 WARN L197 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 34 [2020-12-09 19:01:23,345 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 7, 1] term [2020-12-09 19:01:23,345 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 19:01:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:01:23,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1661565580] [2020-12-09 19:01:23,413 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 19:01:23,413 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:01:23,417 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:01:23,421 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:01:23,421 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:01:23,536 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 55 [2020-12-09 19:01:23,889 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 55 [2020-12-09 19:01:24,521 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 1663 DAG size of output: 1578 [2020-12-09 19:10:44,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 19:10:44,203 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 19:10:44,213 INFO L168 Benchmark]: Toolchain (without parser) took 569640.57 ms. Allocated memory was 98.6 MB in the beginning and 648.0 MB in the end (delta: 549.5 MB). Free memory was 59.4 MB in the beginning and 320.5 MB in the end (delta: -261.1 MB). Peak memory consumption was 431.7 MB. Max. memory is 16.1 GB. [2020-12-09 19:10:44,214 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 98.6 MB. Free memory is still 77.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:10:44,214 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.70 ms. Allocated memory is still 98.6 MB. Free memory was 59.3 MB in the beginning and 57.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:10:44,215 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.43 ms. Allocated memory is still 98.6 MB. Free memory was 57.4 MB in the beginning and 49.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:10:44,215 INFO L168 Benchmark]: Boogie Preprocessor took 70.22 ms. Allocated memory is still 98.6 MB. Free memory was 49.6 MB in the beginning and 44.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:10:44,216 INFO L168 Benchmark]: RCFGBuilder took 6141.53 ms. Allocated memory was 98.6 MB in the beginning and 255.9 MB in the end (delta: 157.3 MB). Free memory was 44.2 MB in the beginning and 109.3 MB in the end (delta: -65.1 MB). Peak memory consumption was 138.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:10:44,216 INFO L168 Benchmark]: TraceAbstraction took 562983.95 ms. Allocated memory was 255.9 MB in the beginning and 648.0 MB in the end (delta: 392.2 MB). Free memory was 108.3 MB in the beginning and 320.5 MB in the end (delta: -212.3 MB). Peak memory consumption was 322.5 MB. Max. memory is 16.1 GB. [2020-12-09 19:10:44,219 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 98.6 MB. Free memory is still 77.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 363.70 ms. Allocated memory is still 98.6 MB. Free memory was 59.3 MB in the beginning and 57.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.43 ms. Allocated memory is still 98.6 MB. Free memory was 57.4 MB in the beginning and 49.6 MB in the end (delta: 7.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.22 ms. Allocated memory is still 98.6 MB. Free memory was 49.6 MB in the beginning and 44.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6141.53 ms. Allocated memory was 98.6 MB in the beginning and 255.9 MB in the end (delta: 157.3 MB). Free memory was 44.2 MB in the beginning and 109.3 MB in the end (delta: -65.1 MB). Peak memory consumption was 138.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 562983.95 ms. Allocated memory was 255.9 MB in the beginning and 648.0 MB in the end (delta: 392.2 MB). Free memory was 108.3 MB in the beginning and 320.5 MB in the end (delta: -212.3 MB). Peak memory consumption was 322.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:10:45,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:10:45,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:10:45,756 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:10:45,757 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:10:45,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:10:45,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:10:45,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:10:45,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:10:45,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:10:45,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:10:45,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:10:45,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:10:45,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:10:45,767 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:10:45,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:10:45,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:10:45,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:10:45,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:10:45,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:10:45,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:10:45,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:10:45,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:10:45,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:10:45,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:10:45,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:10:45,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:10:45,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:10:45,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:10:45,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:10:45,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:10:45,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:10:45,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:10:45,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:10:45,786 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:10:45,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:10:45,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:10:45,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:10:45,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:10:45,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:10:45,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:10:45,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 19:10:45,806 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:10:45,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:10:45,807 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:10:45,807 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:10:45,807 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:10:45,807 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:10:45,807 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:10:45,807 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:10:45,807 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:10:45,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:10:45,808 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:10:45,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 19:10:45,809 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:10:45,810 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:10:45,810 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:10:45,811 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/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(reach_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 -> f099b3088cdddba520ecec4ee7d81a8a64d96ac3 [2020-12-09 19:10:46,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:10:46,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:10:46,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:10:46,054 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:10:46,055 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:10:46,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label27.c [2020-12-09 19:10:46,102 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/5d6f417ab/501f694f42aa45c2887ec1072922a9f8/FLAG965c40c40 [2020-12-09 19:10:46,562 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:10:46,563 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/sv-benchmarks/c/eca-rers2012/Problem10_label27.c [2020-12-09 19:10:46,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/5d6f417ab/501f694f42aa45c2887ec1072922a9f8/FLAG965c40c40 [2020-12-09 19:10:46,588 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/data/5d6f417ab/501f694f42aa45c2887ec1072922a9f8 [2020-12-09 19:10:46,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:10:46,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:10:46,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:10:46,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:10:46,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:10:46,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:46" (1/1) ... [2020-12-09 19:10:46,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffa1768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:46, skipping insertion in model container [2020-12-09 19:10:46,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:10:46" (1/1) ... [2020-12-09 19:10:46,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:10:46,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:10:46,810 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/sv-benchmarks/c/eca-rers2012/Problem10_label27.c[6867,6880] [2020-12-09 19:10:46,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:10:46,938 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:10:46,970 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/sv-benchmarks/c/eca-rers2012/Problem10_label27.c[6867,6880] [2020-12-09 19:10:47,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:10:47,033 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:10:47,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47 WrapperNode [2020-12-09 19:10:47,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:10:47,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:10:47,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:10:47,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:10:47,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:10:47,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:10:47,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:10:47,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:10:47,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... [2020-12-09 19:10:47,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:10:47,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:10:47,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:10:47,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:10:47,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/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 [2020-12-09 19:10:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 19:10:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:10:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:10:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:10:49,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:10:49,214 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 19:10:49,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:49 BoogieIcfgContainer [2020-12-09 19:10:49,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:10:49,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:10:49,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:10:49,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:10:49,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:10:46" (1/3) ... [2020-12-09 19:10:49,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ab17ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:49, skipping insertion in model container [2020-12-09 19:10:49,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:10:47" (2/3) ... [2020-12-09 19:10:49,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ab17ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:10:49, skipping insertion in model container [2020-12-09 19:10:49,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:49" (3/3) ... [2020-12-09 19:10:49,223 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label27.c [2020-12-09 19:10:49,232 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:10:49,234 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 19:10:49,241 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 19:10:49,258 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:10:49,258 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:10:49,258 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:10:49,258 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:10:49,258 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:10:49,258 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:10:49,259 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:10:49,259 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:10:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 19:10:49,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-09 19:10:49,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:10:49,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2020-12-09 19:10:49,281 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:10:49,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:10:49,286 INFO L82 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2020-12-09 19:10:49,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:10:49,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051340452] [2020-12-09 19:10:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 19:10:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:49,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:10:49,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:10:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:10:49,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:10:49,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051340452] [2020-12-09 19:10:49,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:10:49,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:10:49,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267325967] [2020-12-09 19:10:49,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:10:49,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:10:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:10:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:10:49,502 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 19:10:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:10:52,260 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-09 19:10:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:10:52,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-09 19:10:52,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:10:52,271 INFO L225 Difference]: With dead ends: 552 [2020-12-09 19:10:52,271 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 19:10:52,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:10:52,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 19:10:52,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 19:10:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 19:10:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2020-12-09 19:10:52,323 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 60 [2020-12-09 19:10:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:10:52,323 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2020-12-09 19:10:52,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:10:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2020-12-09 19:10:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-12-09 19:10:52,331 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:10:52,332 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 19:10:52,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 19:10:52,534 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:10:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:10:52,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1402137202, now seen corresponding path program 1 times [2020-12-09 19:10:52,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:10:52,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079706125] [2020-12-09 19:10:52,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 19:10:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:52,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:10:52,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:10:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:10:52,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:10:52,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079706125] [2020-12-09 19:10:52,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:10:52,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:10:52,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183947799] [2020-12-09 19:10:52,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:10:52,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:10:52,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:10:52,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:10:52,798 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand 3 states. [2020-12-09 19:10:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:10:55,231 INFO L93 Difference]: Finished difference Result 840 states and 1126 transitions. [2020-12-09 19:10:55,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:10:55,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2020-12-09 19:10:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:10:55,235 INFO L225 Difference]: With dead ends: 840 [2020-12-09 19:10:55,235 INFO L226 Difference]: Without dead ends: 560 [2020-12-09 19:10:55,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:10:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-09 19:10:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-09 19:10:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 19:10:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 715 transitions. [2020-12-09 19:10:55,257 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 715 transitions. Word has length 126 [2020-12-09 19:10:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:10:55,257 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 715 transitions. [2020-12-09 19:10:55,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:10:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 715 transitions. [2020-12-09 19:10:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-12-09 19:10:55,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:10:55,260 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 19:10:55,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 19:10:55,462 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:10:55,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:10:55,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1304777116, now seen corresponding path program 1 times [2020-12-09 19:10:55,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:10:55,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767113399] [2020-12-09 19:10:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 19:10:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:10:55,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:10:55,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:10:55,747 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:10:55,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:10:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:10:56,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767113399] [2020-12-09 19:10:56,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:10:56,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 19:10:56,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378291304] [2020-12-09 19:10:56,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:10:56,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:10:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:10:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:10:56,006 INFO L87 Difference]: Start difference. First operand 560 states and 715 transitions. Second operand 4 states. [2020-12-09 19:11:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:25,026 INFO L93 Difference]: Finished difference Result 1556 states and 2001 transitions. [2020-12-09 19:11:25,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:11:25,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2020-12-09 19:11:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:25,033 INFO L225 Difference]: With dead ends: 1556 [2020-12-09 19:11:25,033 INFO L226 Difference]: Without dead ends: 979 [2020-12-09 19:11:25,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:11:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2020-12-09 19:11:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 560. [2020-12-09 19:11:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 19:11:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 711 transitions. [2020-12-09 19:11:25,050 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 711 transitions. Word has length 135 [2020-12-09 19:11:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:25,050 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 711 transitions. [2020-12-09 19:11:25,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:11:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 711 transitions. [2020-12-09 19:11:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-12-09 19:11:25,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:25,056 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:11:25,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 19:11:25,258 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:25,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:25,260 INFO L82 PathProgramCache]: Analyzing trace with hash 702126325, now seen corresponding path program 1 times [2020-12-09 19:11:25,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:11:25,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755893413] [2020-12-09 19:11:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 19:11:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:25,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:11:25,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:11:25,507 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:11:25,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755893413] [2020-12-09 19:11:25,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:11:25,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:11:25,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625111745] [2020-12-09 19:11:25,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:11:25,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:11:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:11:25,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:11:25,509 INFO L87 Difference]: Start difference. First operand 560 states and 711 transitions. Second operand 3 states. [2020-12-09 19:11:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:28,289 INFO L93 Difference]: Finished difference Result 1396 states and 1822 transitions. [2020-12-09 19:11:28,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:11:28,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-12-09 19:11:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:28,293 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 19:11:28,293 INFO L226 Difference]: Without dead ends: 838 [2020-12-09 19:11:28,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:11:28,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-12-09 19:11:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-12-09 19:11:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 19:11:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1039 transitions. [2020-12-09 19:11:28,307 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1039 transitions. Word has length 194 [2020-12-09 19:11:28,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:28,307 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1039 transitions. [2020-12-09 19:11:28,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:11:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1039 transitions. [2020-12-09 19:11:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-09 19:11:28,309 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:28,310 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2020-12-09 19:11:28,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 19:11:28,511 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:28,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:28,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1108889624, now seen corresponding path program 1 times [2020-12-09 19:11:28,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:11:28,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760474831] [2020-12-09 19:11:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 19:11:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:28,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:11:28,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 115 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:28,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:29,095 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 115 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:29,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760474831] [2020-12-09 19:11:29,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1037582353] [2020-12-09 19:11:29,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:11:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:29,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 19:11:29,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 129 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:29,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 129 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:29,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570803124] [2020-12-09 19:11:29,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:29,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 19:11:29,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:30,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:11:30,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 19:11:30,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 3, 5, 5] total 12 [2020-12-09 19:11:30,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546817023] [2020-12-09 19:11:30,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 19:11:30,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:11:30,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 19:11:30,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 19:11:30,052 INFO L87 Difference]: Start difference. First operand 838 states and 1039 transitions. Second operand 5 states. [2020-12-09 19:11:33,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:33,483 INFO L93 Difference]: Finished difference Result 1959 states and 2485 transitions. [2020-12-09 19:11:33,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:11:33,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 212 [2020-12-09 19:11:33,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:33,488 INFO L225 Difference]: With dead ends: 1959 [2020-12-09 19:11:33,488 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 19:11:33,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 1044 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-09 19:11:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 19:11:33,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2020-12-09 19:11:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 19:11:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1336 transitions. [2020-12-09 19:11:33,505 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1336 transitions. Word has length 212 [2020-12-09 19:11:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:33,505 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1336 transitions. [2020-12-09 19:11:33,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 19:11:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1336 transitions. [2020-12-09 19:11:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-12-09 19:11:33,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:33,508 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2020-12-09 19:11:34,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:34,111 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:34,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1645432901, now seen corresponding path program 1 times [2020-12-09 19:11:34,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:11:34,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884321920] [2020-12-09 19:11:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 19:11:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:34,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:11:34,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2020-12-09 19:11:34,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:11:34,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884321920] [2020-12-09 19:11:34,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:11:34,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:11:34,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157477176] [2020-12-09 19:11:34,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:11:34,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:11:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:11:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:11:34,350 INFO L87 Difference]: Start difference. First operand 1116 states and 1336 transitions. Second operand 3 states. [2020-12-09 19:11:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:36,274 INFO L93 Difference]: Finished difference Result 2369 states and 2818 transitions. [2020-12-09 19:11:36,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:11:36,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2020-12-09 19:11:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:36,281 INFO L225 Difference]: With dead ends: 2369 [2020-12-09 19:11:36,281 INFO L226 Difference]: Without dead ends: 1255 [2020-12-09 19:11:36,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:11:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-12-09 19:11:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2020-12-09 19:11:36,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2020-12-09 19:11:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1479 transitions. [2020-12-09 19:11:36,299 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1479 transitions. Word has length 219 [2020-12-09 19:11:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:36,300 INFO L481 AbstractCegarLoop]: Abstraction has 1255 states and 1479 transitions. [2020-12-09 19:11:36,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:11:36,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1479 transitions. [2020-12-09 19:11:36,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2020-12-09 19:11:36,303 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:36,304 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:11:36,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-09 19:11:36,504 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:36,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1625685700, now seen corresponding path program 1 times [2020-12-09 19:11:36,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:11:36,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177189117] [2020-12-09 19:11:36,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 19:11:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:36,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:11:36,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 173 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:36,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:37,363 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 3 [2020-12-09 19:11:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 202 proven. 105 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:11:37,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177189117] [2020-12-09 19:11:37,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [921962723] [2020-12-09 19:11:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:11:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:37,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:11:37,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:37,999 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:11:38,000 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 19:11:38,000 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:11:38,004 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:11:38,007 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:11:38,010 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 19:11:38,012 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:11:38,015 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:11:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 260 proven. 47 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:11:38,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:38,491 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:11:38,492 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:11:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 292 proven. 15 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:11:38,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168557076] [2020-12-09 19:11:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:11:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:38,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 19:11:38,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 50 proven. 123 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2020-12-09 19:11:39,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:11:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 50 proven. 123 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2020-12-09 19:11:39,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:11:39,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 8, 8, 4, 4] total 20 [2020-12-09 19:11:39,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605666839] [2020-12-09 19:11:39,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-09 19:11:39,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:11:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-09 19:11:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-12-09 19:11:39,568 INFO L87 Difference]: Start difference. First operand 1255 states and 1479 transitions. Second operand 20 states. [2020-12-09 19:11:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:11:57,888 INFO L93 Difference]: Finished difference Result 3714 states and 4389 transitions. [2020-12-09 19:11:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 19:11:57,892 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 303 [2020-12-09 19:11:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:11:57,900 INFO L225 Difference]: With dead ends: 3714 [2020-12-09 19:11:57,900 INFO L226 Difference]: Without dead ends: 2367 [2020-12-09 19:11:57,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1827 GetRequests, 1799 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2020-12-09 19:11:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2020-12-09 19:11:57,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1255. [2020-12-09 19:11:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2020-12-09 19:11:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1521 transitions. [2020-12-09 19:11:57,922 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1521 transitions. Word has length 303 [2020-12-09 19:11:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:11:57,922 INFO L481 AbstractCegarLoop]: Abstraction has 1255 states and 1521 transitions. [2020-12-09 19:11:57,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-09 19:11:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1521 transitions. [2020-12-09 19:11:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2020-12-09 19:11:57,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:11:57,925 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2020-12-09 19:11:58,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt [2020-12-09 19:11:58,528 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:11:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:11:58,530 INFO L82 PathProgramCache]: Analyzing trace with hash -426143487, now seen corresponding path program 1 times [2020-12-09 19:11:58,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:11:58,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050249115] [2020-12-09 19:11:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-09 19:11:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:11:58,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:11:58,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:11:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:11:59,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:12:00,275 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 19:12:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:12:00,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050249115] [2020-12-09 19:12:00,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1259151028] [2020-12-09 19:12:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:12:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:12:00,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:12:00,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:12:01,339 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:12:01,339 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 19:12:01,340 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:12:01,342 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:12:01,344 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-12-09 19:12:01,347 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 19:12:01,348 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:12:01,350 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:12:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-09 19:12:01,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:12:01,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 19:12:01,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4] total 13 [2020-12-09 19:12:01,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658279144] [2020-12-09 19:12:01,543 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:12:01,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:12:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:12:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:12:01,543 INFO L87 Difference]: Start difference. First operand 1255 states and 1521 transitions. Second operand 7 states. [2020-12-09 19:12:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:12:04,762 INFO L93 Difference]: Finished difference Result 2693 states and 3360 transitions. [2020-12-09 19:12:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:12:04,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 308 [2020-12-09 19:12:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:12:04,767 INFO L225 Difference]: With dead ends: 2693 [2020-12-09 19:12:04,767 INFO L226 Difference]: Without dead ends: 1255 [2020-12-09 19:12:04,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 923 GetRequests, 911 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-09 19:12:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-12-09 19:12:04,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2020-12-09 19:12:04,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2020-12-09 19:12:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1510 transitions. [2020-12-09 19:12:04,783 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1510 transitions. Word has length 308 [2020-12-09 19:12:04,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:12:04,784 INFO L481 AbstractCegarLoop]: Abstraction has 1255 states and 1510 transitions. [2020-12-09 19:12:04,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:12:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1510 transitions. [2020-12-09 19:12:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2020-12-09 19:12:04,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:12:04,786 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 19:12:05,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt,13 mathsat -unsat_core_generation=3 [2020-12-09 19:12:05,189 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:12:05,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:12:05,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1754578338, now seen corresponding path program 1 times [2020-12-09 19:12:05,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:12:05,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956226126] [2020-12-09 19:12:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-09 19:12:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:12:05,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 19:12:05,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:12:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 173 proven. 177 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 19:12:05,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:12:06,140 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-09 19:12:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 19:12:06,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956226126] [2020-12-09 19:12:06,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 19:12:06,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 19:12:06,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424016594] [2020-12-09 19:12:06,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:12:06,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:12:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:12:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:12:06,368 INFO L87 Difference]: Start difference. First operand 1255 states and 1510 transitions. Second operand 4 states. [2020-12-09 19:13:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:13:01,527 INFO L93 Difference]: Finished difference Result 3342 states and 3967 transitions. [2020-12-09 19:13:01,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 19:13:01,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 360 [2020-12-09 19:13:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:13:01,543 INFO L225 Difference]: With dead ends: 3342 [2020-12-09 19:13:01,543 INFO L226 Difference]: Without dead ends: 2228 [2020-12-09 19:13:01,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 19:13:01,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2020-12-09 19:13:01,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1950. [2020-12-09 19:13:01,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2020-12-09 19:13:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2260 transitions. [2020-12-09 19:13:01,569 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2260 transitions. Word has length 360 [2020-12-09 19:13:01,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:13:01,570 INFO L481 AbstractCegarLoop]: Abstraction has 1950 states and 2260 transitions. [2020-12-09 19:13:01,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:13:01,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2260 transitions. [2020-12-09 19:13:01,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2020-12-09 19:13:01,573 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:13:01,574 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 19:13:01,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-09 19:13:01,774 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:13:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:13:01,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1011479746, now seen corresponding path program 1 times [2020-12-09 19:13:01,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:13:01,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644787792] [2020-12-09 19:13:01,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-09 19:13:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:13:02,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 19:13:02,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:13:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 150 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:13:02,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:13:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 356 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-09 19:13:03,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644787792] [2020-12-09 19:13:03,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1290750376] [2020-12-09 19:13:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:13:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:13:03,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:13:03,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:13:04,087 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:13:04,087 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-12-09 19:13:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-12-09 19:13:04,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:13:04,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 19:13:04,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 4] total 13 [2020-12-09 19:13:04,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798483038] [2020-12-09 19:13:04,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:13:04,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:13:04,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:13:04,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-09 19:13:04,290 INFO L87 Difference]: Start difference. First operand 1950 states and 2260 transitions. Second operand 7 states. [2020-12-09 19:13:07,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:13:07,911 INFO L93 Difference]: Finished difference Result 3813 states and 4430 transitions. [2020-12-09 19:13:07,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:13:07,912 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 373 [2020-12-09 19:13:07,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:13:07,913 INFO L225 Difference]: With dead ends: 3813 [2020-12-09 19:13:07,913 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 19:13:07,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1118 GetRequests, 1105 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-12-09 19:13:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 19:13:07,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 19:13:07,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 19:13:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 19:13:07,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 373 [2020-12-09 19:13:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:13:07,915 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 19:13:07,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:13:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 19:13:07,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 19:13:08,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3,17 cvc4 --incremental --print-success --lang smt [2020-12-09 19:13:08,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 19:13:08,434 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 70 [2020-12-09 19:13:10,681 WARN L197 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-12-09 19:13:13,156 WARN L197 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,160 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 19:13:13,161 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,162 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,163 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 19:13:13,164 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 19:13:13,165 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,166 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 19:13:13,167 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 19:13:13,168 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse5 (bvsdiv ~a1~0 (_ bv5 32)))) (let ((.cse0 (= (_ bv2 32) ~a10~0)) (.cse2 (= (_ bv9 32) ~a19~0)) (.cse4 (= (_ bv0 32) ~a10~0)) (.cse6 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul .cse5 (_ bv5 32)) (_ bv5 32)) (_ bv505228 32))))) (.cse1 (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32)))) (.cse8 (= (_ bv4 32) ~a10~0)) (.cse3 (= (_ bv0 32) ~a12~0)) (.cse7 (= (_ bv8 32) ~a19~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 (bvslt (_ bv218 32) (bvadd .cse5 (_ bv331501 32)))) (and .cse1 .cse2 .cse6 .cse3) (and .cse1 .cse6 (= (_ bv1 32) ~a10~0) .cse3) (and .cse0 .cse1 .cse3 .cse7) (and (not (bvsle ~a1~0 (_ bv4294967283 32))) .cse1 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and (= (_ bv6 32) ~a19~0) .cse1 .cse8 .cse6 .cse3) (and .cse1 .cse8 .cse3 .cse7)))) [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,169 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 19:13:13,170 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 19:13:13,171 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 19:13:13,172 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse5 (bvsdiv ~a1~0 (_ bv5 32)))) (let ((.cse0 (= (_ bv2 32) ~a10~0)) (.cse2 (= (_ bv9 32) ~a19~0)) (.cse4 (= (_ bv0 32) ~a10~0)) (.cse6 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul .cse5 (_ bv5 32)) (_ bv5 32)) (_ bv505228 32))))) (.cse1 (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32)))) (.cse8 (= (_ bv4 32) ~a10~0)) (.cse3 (= (_ bv0 32) ~a12~0)) (.cse7 (= (_ bv8 32) ~a19~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse4 .cse3 (bvslt (_ bv218 32) (bvadd .cse5 (_ bv331501 32)))) (and .cse1 .cse2 .cse6 .cse3) (and .cse1 .cse6 (= (_ bv1 32) ~a10~0) .cse3) (and .cse0 .cse1 .cse3 .cse7) (and (not (bvsle ~a1~0 (_ bv4294967283 32))) .cse1 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and (= (_ bv6 32) ~a19~0) .cse1 .cse8 .cse6 .cse3) (and .cse1 .cse8 .cse3 .cse7)))) [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,173 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 194) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 19:13:13,174 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 19:13:13,175 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 19:13:13,176 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 19:13:13,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:13:13 BoogieIcfgContainer [2020-12-09 19:13:13,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:13:13,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:13:13,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:13:13,193 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:13:13,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:10:49" (3/4) ... [2020-12-09 19:13:13,195 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 19:13:13,210 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 19:13:13,211 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 19:13:13,212 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:13:13,213 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:13:13,296 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_99dcda01-35aa-4562-b75d-37f0238d7f92/bin/utaipan/witness.graphml [2020-12-09 19:13:13,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:13:13,297 INFO L168 Benchmark]: Toolchain (without parser) took 146705.12 ms. Allocated memory was 62.9 MB in the beginning and 207.6 MB in the end (delta: 144.7 MB). Free memory was 42.9 MB in the beginning and 162.3 MB in the end (delta: -119.4 MB). Peak memory consumption was 139.5 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,297 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 62.9 MB. Free memory is still 46.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:13:13,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.33 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 42.7 MB in the beginning and 50.7 MB in the end (delta: -8.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.87 ms. Allocated memory is still 79.7 MB. Free memory was 50.7 MB in the beginning and 45.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,298 INFO L168 Benchmark]: Boogie Preprocessor took 57.12 ms. Allocated memory is still 79.7 MB. Free memory was 45.4 MB in the beginning and 40.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,299 INFO L168 Benchmark]: RCFGBuilder took 2067.77 ms. Allocated memory is still 79.7 MB. Free memory was 40.8 MB in the beginning and 36.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,299 INFO L168 Benchmark]: TraceAbstraction took 143975.00 ms. Allocated memory was 79.7 MB in the beginning and 207.6 MB in the end (delta: 127.9 MB). Free memory was 36.1 MB in the beginning and 60.5 MB in the end (delta: -24.5 MB). Peak memory consumption was 102.9 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,299 INFO L168 Benchmark]: Witness Printer took 103.48 ms. Allocated memory is still 207.6 MB. Free memory was 60.5 MB in the beginning and 162.3 MB in the end (delta: -101.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. [2020-12-09 19:13:13,301 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 62.9 MB. Free memory is still 46.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 441.33 ms. Allocated memory was 62.9 MB in the beginning and 79.7 MB in the end (delta: 16.8 MB). Free memory was 42.7 MB in the beginning and 50.7 MB in the end (delta: -8.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.87 ms. Allocated memory is still 79.7 MB. Free memory was 50.7 MB in the beginning and 45.4 MB in the end (delta: 5.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.12 ms. Allocated memory is still 79.7 MB. Free memory was 45.4 MB in the beginning and 40.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2067.77 ms. Allocated memory is still 79.7 MB. Free memory was 40.8 MB in the beginning and 36.6 MB in the end (delta: 4.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 143975.00 ms. Allocated memory was 79.7 MB in the beginning and 207.6 MB in the end (delta: 127.9 MB). Free memory was 36.1 MB in the beginning and 60.5 MB in the end (delta: -24.5 MB). Peak memory consumption was 102.9 MB. Max. memory is 16.1 GB. * Witness Printer took 103.48 ms. Allocated memory is still 207.6 MB. Free memory was 60.5 MB in the beginning and 162.3 MB in the end (delta: -101.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 194]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((((((2bv32 == a10 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 9bv32 == a19) && 0bv32 == a12) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 0bv32 == a10) && 0bv32 == a12) && ~bvslt32(218bv32, ~bvadd64(~bvsdiv32(a1, 5bv32), 331501bv32)))) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 9bv32 == a19) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 1bv32 == a10) && 0bv32 == a12)) || (((2bv32 == a10 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 0bv32 == a12) && 8bv32 == a19)) || ((!~bvsle32(a1, 4294967283bv32) && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 0bv32 == a12)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 9bv32 == a19) && 0bv32 == a10) && 0bv32 == a12)) || ((((6bv32 == a19 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 4bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 4bv32 == a10) && 0bv32 == a12) && 8bv32 == a19) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((2bv32 == a10 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 9bv32 == a19) && 0bv32 == a12) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 0bv32 == a10) && 0bv32 == a12) && ~bvslt32(218bv32, ~bvadd64(~bvsdiv32(a1, 5bv32), 331501bv32)))) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 9bv32 == a19) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 1bv32 == a10) && 0bv32 == a12)) || (((2bv32 == a10 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 0bv32 == a12) && 8bv32 == a19)) || ((!~bvsle32(a1, 4294967283bv32) && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 0bv32 == a12)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 9bv32 == a19) && 0bv32 == a10) && 0bv32 == a12)) || ((((6bv32 == a19 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 4bv32 == a10) && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32))) && 0bv32 == a12)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 4bv32 == a10) && 0bv32 == a12) && 8bv32 == a19) - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 139.0s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 122.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 912 SDtfs, 2514 SDslu, 291 SDs, 0 SdLazy, 11103 SolverSat, 1005 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 113.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6504 GetRequests, 6428 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1950occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 1809 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 59 NumberOfFragments, 337 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1842 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 552 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 4001 NumberOfCodeBlocks, 4001 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 6485 ConstructedInterpolants, 0 QuantifiedInterpolants, 10495194 SizeOfPredicates, 50 NumberOfNonLiveVariables, 4922 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 4890/6513 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...