./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.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_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/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 a82950ae3606f460774148ab092b973f3180dbf1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 18:44:36,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 18:44:36,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 18:44:36,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 18:44:36,088 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 18:44:36,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 18:44:36,090 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 18:44:36,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 18:44:36,094 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 18:44:36,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 18:44:36,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 18:44:36,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 18:44:36,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 18:44:36,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 18:44:36,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 18:44:36,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 18:44:36,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 18:44:36,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 18:44:36,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 18:44:36,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 18:44:36,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 18:44:36,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 18:44:36,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 18:44:36,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 18:44:36,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 18:44:36,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 18:44:36,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 18:44:36,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 18:44:36,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 18:44:36,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 18:44:36,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 18:44:36,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 18:44:36,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 18:44:36,115 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 18:44:36,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 18:44:36,116 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 18:44:36,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 18:44:36,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 18:44:36,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 18:44:36,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 18:44:36,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 18:44:36,119 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 18:44:36,135 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 18:44:36,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 18:44:36,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 18:44:36,136 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 18:44:36,136 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 18:44:36,136 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 18:44:36,136 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 18:44:36,136 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 18:44:36,136 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 18:44:36,136 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 18:44:36,137 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 18:44:36,137 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 18:44:36,137 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 18:44:36,137 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 18:44:36,137 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 18:44:36,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 18:44:36,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 18:44:36,139 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 18:44:36,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 18:44:36,139 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 18:44:36,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 18:44:36,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 18:44:36,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 18:44:36,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 18:44:36,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 18:44:36,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 18:44:36,140 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_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/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_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/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 -> a82950ae3606f460774148ab092b973f3180dbf1 [2020-12-09 18:44:36,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 18:44:36,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 18:44:36,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 18:44:36,351 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 18:44:36,351 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 18:44:36,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/../../sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2020-12-09 18:44:36,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/data/2c3358955/2c5a8ec521fc4941905a3cdc32d24855/FLAGfbf2d3b73 [2020-12-09 18:44:36,746 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 18:44:36,746 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c [2020-12-09 18:44:36,751 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/data/2c3358955/2c5a8ec521fc4941905a3cdc32d24855/FLAGfbf2d3b73 [2020-12-09 18:44:37,177 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/data/2c3358955/2c5a8ec521fc4941905a3cdc32d24855 [2020-12-09 18:44:37,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 18:44:37,180 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 18:44:37,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 18:44:37,181 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 18:44:37,184 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 18:44:37,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,185 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68163704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37, skipping insertion in model container [2020-12-09 18:44:37,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 18:44:37,201 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 18:44:37,292 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_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2020-12-09 18:44:37,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:44:37,309 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 18:44:37,317 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_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/sv-benchmarks/c/nla-digbench-scaling/hard-ll_valuebound1.c[538,551] [2020-12-09 18:44:37,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 18:44:37,331 INFO L208 MainTranslator]: Completed translation [2020-12-09 18:44:37,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37 WrapperNode [2020-12-09 18:44:37,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 18:44:37,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 18:44:37,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 18:44:37,333 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 18:44:37,338 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 18:44:37,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 18:44:37,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 18:44:37,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 18:44:37,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... [2020-12-09 18:44:37,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 18:44:37,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 18:44:37,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 18:44:37,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 18:44:37,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/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 18:44:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 18:44:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 18:44:37,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 18:44:37,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 18:44:37,710 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 18:44:37,710 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2020-12-09 18:44:37,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:44:37 BoogieIcfgContainer [2020-12-09 18:44:37,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 18:44:37,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 18:44:37,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 18:44:37,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 18:44:37,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:44:37" (1/3) ... [2020-12-09 18:44:37,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5da539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:44:37, skipping insertion in model container [2020-12-09 18:44:37,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:44:37" (2/3) ... [2020-12-09 18:44:37,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5da539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:44:37, skipping insertion in model container [2020-12-09 18:44:37,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:44:37" (3/3) ... [2020-12-09 18:44:37,718 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_valuebound1.c [2020-12-09 18:44:37,728 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 18:44:37,730 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-12-09 18:44:37,738 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-09 18:44:37,756 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 18:44:37,756 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 18:44:37,756 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 18:44:37,756 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 18:44:37,756 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 18:44:37,756 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 18:44:37,756 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 18:44:37,756 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 18:44:37,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-12-09 18:44:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-12-09 18:44:37,770 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:44:37,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-12-09 18:44:37,771 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:44:37,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:44:37,776 INFO L82 PathProgramCache]: Analyzing trace with hash 5602791, now seen corresponding path program 1 times [2020-12-09 18:44:37,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:44:37,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750445991] [2020-12-09 18:44:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:44:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:44:37,949 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 18:44:37,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750445991] [2020-12-09 18:44:37,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:44:37,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:44:37,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186046261] [2020-12-09 18:44:37,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:44:37,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:44:37,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:44:37,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:44:37,971 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-12-09 18:44:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:44:38,044 INFO L93 Difference]: Finished difference Result 83 states and 109 transitions. [2020-12-09 18:44:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:44:38,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-12-09 18:44:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:44:38,054 INFO L225 Difference]: With dead ends: 83 [2020-12-09 18:44:38,054 INFO L226 Difference]: Without dead ends: 47 [2020-12-09 18:44:38,057 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 18:44:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-12-09 18:44:38,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2020-12-09 18:44:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 18:44:38,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2020-12-09 18:44:38,088 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 4 [2020-12-09 18:44:38,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:44:38,088 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2020-12-09 18:44:38,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:44:38,088 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2020-12-09 18:44:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-12-09 18:44:38,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:44:38,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-12-09 18:44:38,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 18:44:38,089 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:44:38,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:44:38,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1089471050, now seen corresponding path program 1 times [2020-12-09 18:44:38,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:44:38,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305993556] [2020-12-09 18:44:38,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:44:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:44:38,138 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 18:44:38,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305993556] [2020-12-09 18:44:38,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:44:38,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 18:44:38,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244113900] [2020-12-09 18:44:38,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 18:44:38,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:44:38,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 18:44:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 18:44:38,141 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 4 states. [2020-12-09 18:44:38,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:44:38,193 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2020-12-09 18:44:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 18:44:38,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-12-09 18:44:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:44:38,195 INFO L225 Difference]: With dead ends: 47 [2020-12-09 18:44:38,195 INFO L226 Difference]: Without dead ends: 45 [2020-12-09 18:44:38,196 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 18:44:38,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-12-09 18:44:38,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2020-12-09 18:44:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-12-09 18:44:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-12-09 18:44:38,203 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 6 [2020-12-09 18:44:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:44:38,203 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-12-09 18:44:38,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 18:44:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-12-09 18:44:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-09 18:44:38,204 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:44:38,204 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:44:38,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 18:44:38,204 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:44:38,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:44:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash -990184627, now seen corresponding path program 1 times [2020-12-09 18:44:38,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:44:38,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007356751] [2020-12-09 18:44:38,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:44:38,221 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-09 18:44:38,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653731681] [2020-12-09 18:44:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/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 18:44:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:44:38,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 18:44:38,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:44:38,358 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 18:44:38,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:44:38,408 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 18:44:38,408 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:38,422 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 18:44:38,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007356751] [2020-12-09 18:44:38,422 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:44:38,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653731681] [2020-12-09 18:44:38,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:44:38,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-12-09 18:44:38,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175183921] [2020-12-09 18:44:38,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 18:44:38,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:44:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 18:44:38,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-09 18:44:38,425 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2020-12-09 18:44:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:44:38,597 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2020-12-09 18:44:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 18:44:38,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2020-12-09 18:44:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:44:38,599 INFO L225 Difference]: With dead ends: 73 [2020-12-09 18:44:38,599 INFO L226 Difference]: Without dead ends: 52 [2020-12-09 18:44:38,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2020-12-09 18:44:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-09 18:44:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2020-12-09 18:44:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-09 18:44:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2020-12-09 18:44:38,608 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 8 [2020-12-09 18:44:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:44:38,608 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2020-12-09 18:44:38,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 18:44:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2020-12-09 18:44:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 18:44:38,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:44:38,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:44:38,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-09 18:44:38,811 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:44:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:44:38,813 INFO L82 PathProgramCache]: Analyzing trace with hash -749898558, now seen corresponding path program 1 times [2020-12-09 18:44:38,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:44:38,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838600768] [2020-12-09 18:44:38,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:44:38,868 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-09 18:44:38,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1098174610] [2020-12-09 18:44:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:44:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:44:38,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 18:44:38,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:44:39,144 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 18:44:39,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:44:39,183 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 18:44:39,183 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:39,195 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 18:44:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838600768] [2020-12-09 18:44:39,196 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:44:39,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098174610] [2020-12-09 18:44:39,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-09 18:44:39,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [] total 8 [2020-12-09 18:44:39,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864663046] [2020-12-09 18:44:39,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-09 18:44:39,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:44:39,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-09 18:44:39,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-09 18:44:39,198 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2020-12-09 18:44:39,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:44:39,296 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2020-12-09 18:44:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 18:44:39,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-12-09 18:44:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:44:39,297 INFO L225 Difference]: With dead ends: 54 [2020-12-09 18:44:39,297 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 18:44:39,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2020-12-09 18:44:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 18:44:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2020-12-09 18:44:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-12-09 18:44:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-12-09 18:44:39,303 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 11 [2020-12-09 18:44:39,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:44:39,303 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-12-09 18:44:39,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-09 18:44:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-12-09 18:44:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 18:44:39,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:44:39,304 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:44:39,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:44:39,506 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:44:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:44:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1830930758, now seen corresponding path program 1 times [2020-12-09 18:44:39,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:44:39,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126053471] [2020-12-09 18:44:39,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:44:39,541 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-09 18:44:39,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424568998] [2020-12-09 18:44:39,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:44:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:44:39,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 32 conjunts are in the unsatisfiable core [2020-12-09 18:44:39,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:44:39,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:44:39,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:44:39,794 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 18:44:39,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:39,798 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 1] term [2020-12-09 18:44:39,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:39,801 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-12-09 18:44:39,801 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:39,805 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 1] term [2020-12-09 18:44:39,805 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:39,807 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-09 18:44:39,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 18:44:39,972 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-09 18:44:40,187 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2020-12-09 18:44:40,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:44:40,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126053471] [2020-12-09 18:44:40,279 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:44:40,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424568998] [2020-12-09 18:44:40,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1006125920] [2020-12-09 18:44:40,299 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 18:44:40,299 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:44:40,304 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:44:40,309 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:44:40,309 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:44:40,386 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:44:40,818 FATAL L? ?]: Ignoring exception! java.lang.NullPointerException at java.base/java.util.Arrays.stream(Arrays.java:5614) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.AbstractGeneralizedAffineTerm.div(AbstractGeneralizedAffineTerm.java:395) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.constructRhsIntegerQuotient(SolveForSubjectUtils.java:456) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.ExplicitLhsPolynomialRelation.divideByIntegerCoefficient(ExplicitLhsPolynomialRelation.java:224) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubjectWithoutTreatableDivMod(SolveForSubjectUtils.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:401) 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.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.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 18:44:40,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-09 18:44:40,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-12-09 18:44:40,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022596013] [2020-12-09 18:44:40,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 18:44:40,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:44:40,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 18:44:40,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-09 18:44:40,823 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2020-12-09 18:44:41,194 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 59 [2020-12-09 18:44:41,408 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-12-09 18:44:41,576 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2020-12-09 18:44:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:44:41,760 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2020-12-09 18:44:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 18:44:41,760 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-12-09 18:44:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:44:41,761 INFO L225 Difference]: With dead ends: 98 [2020-12-09 18:44:41,761 INFO L226 Difference]: Without dead ends: 67 [2020-12-09 18:44:41,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=233, Unknown=0, NotChecked=0, Total=342 [2020-12-09 18:44:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-12-09 18:44:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2020-12-09 18:44:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-09 18:44:41,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2020-12-09 18:44:41,771 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 23 [2020-12-09 18:44:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:44:41,771 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2020-12-09 18:44:41,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 18:44:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2020-12-09 18:44:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 18:44:41,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:44:41,772 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:44:41,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:44:41,974 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:44:41,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:44:41,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1411975191, now seen corresponding path program 1 times [2020-12-09 18:44:41,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:44:41,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076914732] [2020-12-09 18:44:41,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:44:42,008 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-09 18:44:42,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203975464] [2020-12-09 18:44:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:44:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:44:42,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 39 conjunts are in the unsatisfiable core [2020-12-09 18:44:42,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:44:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:44:42,252 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:44:46,498 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_ULTIMATE.start_main_~B~0 4294967296))) (or (not (= c_ULTIMATE.start_main_~d~0 (* c_ULTIMATE.start_main_~p~0 .cse0))) (let ((.cse6 (div c_ULTIMATE.start_main_~d~0 2)) (.cse1 (= (mod c_ULTIMATE.start_main_~d~0 2) 0))) (let ((.cse8 (= (mod c_ULTIMATE.start_main_~p~0 2) 0)) (.cse5 (and (not .cse1) (< c_ULTIMATE.start_main_~d~0 0))) (.cse7 (* (div c_ULTIMATE.start_main_~p~0 2) .cse0)) (.cse4 (+ .cse6 1)) (.cse2 (<= 0 c_ULTIMATE.start_main_~d~0))) (and (or (let ((.cse3 (+ .cse7 .cse0))) (and (or .cse1 .cse2 (= .cse3 .cse4)) (or .cse5 (= .cse6 .cse3)))) .cse8 (<= 0 c_ULTIMATE.start_main_~p~0)) (or (and (not .cse8) (< c_ULTIMATE.start_main_~p~0 0)) (and (or .cse5 (= .cse7 .cse6)) (or .cse1 (= .cse7 .cse4) .cse2)))))))) is different from true [2020-12-09 18:47:10,743 WARN L197 SmtUtils]: Spent 2.28 m on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2020-12-09 18:47:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-12-09 18:47:10,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076914732] [2020-12-09 18:47:10,792 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:47:10,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203975464] [2020-12-09 18:47:10,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1108496002] [2020-12-09 18:47:10,794 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2020-12-09 18:47:10,794 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:47:10,794 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:47:10,794 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:47:10,794 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:47:10,850 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:47:11,178 FATAL L? ?]: Ignoring exception! java.lang.NullPointerException at java.base/java.util.Arrays.stream(Arrays.java:5614) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.AbstractGeneralizedAffineTerm.div(AbstractGeneralizedAffineTerm.java:395) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.constructRhsIntegerQuotient(SolveForSubjectUtils.java:456) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.ExplicitLhsPolynomialRelation.divideByIntegerCoefficient(ExplicitLhsPolynomialRelation.java:224) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubjectWithoutTreatableDivMod(SolveForSubjectUtils.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:401) 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.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.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 18:47:11,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-09 18:47:11,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-12-09 18:47:11,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242722266] [2020-12-09 18:47:11,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-09 18:47:11,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:47:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-09 18:47:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=147, Unknown=5, NotChecked=26, Total=240 [2020-12-09 18:47:11,179 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 16 states. [2020-12-09 18:47:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:47:11,505 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2020-12-09 18:47:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 18:47:11,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-12-09 18:47:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:47:11,506 INFO L225 Difference]: With dead ends: 50 [2020-12-09 18:47:11,506 INFO L226 Difference]: Without dead ends: 29 [2020-12-09 18:47:11,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 148.7s TimeCoverageRelationStatistics Valid=106, Invalid=235, Unknown=5, NotChecked=34, Total=380 [2020-12-09 18:47:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-12-09 18:47:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-12-09 18:47:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-12-09 18:47:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2020-12-09 18:47:11,511 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 25 [2020-12-09 18:47:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:47:11,511 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2020-12-09 18:47:11,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-09 18:47:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2020-12-09 18:47:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-09 18:47:11,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 18:47:11,512 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 18:47:11,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:47:11,712 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 18:47:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 18:47:11,713 INFO L82 PathProgramCache]: Analyzing trace with hash 761753162, now seen corresponding path program 1 times [2020-12-09 18:47:11,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 18:47:11,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726130630] [2020-12-09 18:47:11,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 18:47:11,720 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-12-09 18:47:11,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2008499127] [2020-12-09 18:47:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 18:47:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 18:47:11,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-09 18:47:11,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 18:47:12,800 WARN L197 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2020-12-09 18:47:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:47:13,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 18:47:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 18:47:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726130630] [2020-12-09 18:47:13,651 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-12-09 18:47:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008499127] [2020-12-09 18:47:13,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [668516588] [2020-12-09 18:47:13,653 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2020-12-09 18:47:13,653 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 18:47:13,653 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 18:47:13,653 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 18:47:13,654 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 18:47:13,669 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-12-09 18:47:13,940 FATAL L? ?]: Ignoring exception! java.lang.NullPointerException at java.base/java.util.Arrays.stream(Arrays.java:5614) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.AbstractGeneralizedAffineTerm.div(AbstractGeneralizedAffineTerm.java:395) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.constructRhsIntegerQuotient(SolveForSubjectUtils.java:456) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.ExplicitLhsPolynomialRelation.divideByIntegerCoefficient(ExplicitLhsPolynomialRelation.java:224) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubjectWithoutTreatableDivMod(SolveForSubjectUtils.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:451) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:401) 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.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 18:47:13,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-09 18:47:13,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2020-12-09 18:47:13,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116929383] [2020-12-09 18:47:13,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-09 18:47:13,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 18:47:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-09 18:47:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2020-12-09 18:47:13,942 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 17 states. [2020-12-09 18:47:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 18:47:14,512 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2020-12-09 18:47:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 18:47:14,512 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2020-12-09 18:47:14,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 18:47:14,512 INFO L225 Difference]: With dead ends: 29 [2020-12-09 18:47:14,512 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 18:47:14,513 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=161, Invalid=391, Unknown=0, NotChecked=0, Total=552 [2020-12-09 18:47:14,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 18:47:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 18:47:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 18:47:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 18:47:14,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2020-12-09 18:47:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 18:47:14,513 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 18:47:14,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-09 18:47:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 18:47:14,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 18:47:14,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2020-12-09 18:47:14,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 18:47:14,954 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2020-12-09 18:47:15,183 WARN L197 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 42 [2020-12-09 18:47:15,329 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2020-12-09 18:47:15,470 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2020-12-09 18:47:15,632 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2020-12-09 18:47:15,761 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 30 [2020-12-09 18:47:16,005 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 42 [2020-12-09 18:47:16,007 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,007 INFO L258 CegarLoopResult]: At program point L36-2(lines 36 44) the Hoare annotation is: (let ((.cse1 (mod ULTIMATE.start_main_~B~0 4294967296)) (.cse5 (mod ULTIMATE.start_main_~A~0 4294967296))) (let ((.cse0 (<= .cse5 1)) (.cse2 (<= 1 .cse1)) (.cse3 (= ULTIMATE.start_main_~r~0 .cse5)) (.cse4 (= ULTIMATE.start_main_~q~0 0))) (or (and .cse0 (<= .cse1 1) (= ULTIMATE.start_main_~d~0 .cse1) .cse2 .cse3 (= ULTIMATE.start_main_~p~0 1) .cse4) (and .cse0 (= ULTIMATE.start_main_~d~0 (* .cse1 2)) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) .cse2 .cse3 (= ULTIMATE.start_main_~p~0 2) .cse4 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0))))) [2020-12-09 18:47:16,007 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point L54-2(lines 22 63) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point L46-1(lines 46 58) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point L15(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L258 CegarLoopResult]: At program point L15-2(lines 14 20) the Hoare annotation is: (let ((.cse2 (mod ULTIMATE.start_main_~B~0 4294967296))) (let ((.cse0 (<= (mod ULTIMATE.start_main_~A~0 4294967296) 1)) (.cse1 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~r~0 (* (div ULTIMATE.start_main_~A~0 4294967296) 4294967296)))) (.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= 1 .cse2)) (.cse5 (= ULTIMATE.start_main_~q~0 0)) (.cse6 (* ULTIMATE.start_main_~d~0 (- 1)))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~d~0 .cse2) .cse3 .cse4 (= ULTIMATE.start_main_~p~0 1) .cse5 (<= (div ULTIMATE.start_main_~d~0 (- 4294967296)) (div (+ .cse6 1) 4294967296))) (and .cse0 .cse1 (= ULTIMATE.start_main_~d~0 (* .cse2 2)) .cse3 .cse4 (= ULTIMATE.start_main_~p~0 2) .cse5 (<= (div .cse6 (- 2)) ULTIMATE.start_main_~r~0))))) [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point L15-3(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L258 CegarLoopResult]: At program point L15-5(lines 14 20) the Hoare annotation is: (let ((.cse2 (mod ULTIMATE.start_main_~B~0 4294967296))) (let ((.cse0 (<= (mod ULTIMATE.start_main_~A~0 4294967296) 1)) (.cse1 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~r~0 (* (div ULTIMATE.start_main_~A~0 4294967296) 4294967296)))) (.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= 1 .cse2)) (.cse5 (= ULTIMATE.start_main_~q~0 0)) (.cse6 (* ULTIMATE.start_main_~d~0 (- 1)))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~d~0 .cse2) .cse3 .cse4 (= ULTIMATE.start_main_~p~0 1) .cse5 (<= (div ULTIMATE.start_main_~d~0 (- 4294967296)) (div (+ .cse6 1) 4294967296))) (and .cse0 .cse1 (= ULTIMATE.start_main_~d~0 (* .cse2 2)) .cse3 .cse4 (= ULTIMATE.start_main_~p~0 2) .cse5 (<= (div .cse6 (- 2)) ULTIMATE.start_main_~r~0))))) [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point L15-6(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L258 CegarLoopResult]: At program point L15-8(line 40) the Hoare annotation is: (let ((.cse2 (mod ULTIMATE.start_main_~B~0 4294967296))) (let ((.cse0 (<= (mod ULTIMATE.start_main_~A~0 4294967296) 1)) (.cse1 (= ULTIMATE.start_main_~A~0 (+ ULTIMATE.start_main_~r~0 (* (div ULTIMATE.start_main_~A~0 4294967296) 4294967296)))) (.cse3 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse4 (<= 1 .cse2)) (.cse5 (= ULTIMATE.start_main_~q~0 0)) (.cse6 (* ULTIMATE.start_main_~d~0 (- 1)))) (or (and .cse0 .cse1 (= ULTIMATE.start_main_~d~0 .cse2) .cse3 .cse4 (= ULTIMATE.start_main_~p~0 1) .cse5 (<= (div ULTIMATE.start_main_~d~0 (- 4294967296)) (div (+ .cse6 1) 4294967296))) (and .cse0 .cse1 (= ULTIMATE.start_main_~d~0 (* .cse2 2)) .cse3 .cse4 (= ULTIMATE.start_main_~p~0 2) .cse5 (<= (div .cse6 (- 2)) ULTIMATE.start_main_~r~0))))) [2020-12-09 18:47:16,008 INFO L262 CegarLoopResult]: For program point L15-9(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,008 INFO L258 CegarLoopResult]: At program point L15-11(lines 14 20) the Hoare annotation is: (let ((.cse1 (mod ULTIMATE.start_main_~B~0 4294967296)) (.cse7 (mod ULTIMATE.start_main_~A~0 4294967296))) (let ((.cse4 (= ULTIMATE.start_main_~r~0 .cse7)) (.cse6 (= ULTIMATE.start_main_~q~0 0)) (.cse0 (<= .cse1 1)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= 1 .cse1)) (.cse5 (= ULTIMATE.start_main_~p~0 1))) (or (and .cse0 (= ULTIMATE.start_main_~d~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= .cse7 1) (= ULTIMATE.start_main_~d~0 (* .cse1 2)) .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~p~0 2) .cse6 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and (= ULTIMATE.start_main_~q~0 1) .cse0 .cse2 .cse3 .cse5 (= .cse7 (+ ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~r~0)) (= (+ ULTIMATE.start_main_~r~0 .cse1) .cse7) (<= ULTIMATE.start_main_~d~0 .cse7) (< ULTIMATE.start_main_~r~0 (+ (div ULTIMATE.start_main_~d~0 2) 1)))))) [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L15-12(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L258 CegarLoopResult]: At program point L15-14(line 50) the Hoare annotation is: (let ((.cse1 (mod ULTIMATE.start_main_~B~0 4294967296)) (.cse7 (mod ULTIMATE.start_main_~A~0 4294967296))) (let ((.cse4 (= ULTIMATE.start_main_~r~0 .cse7)) (.cse6 (= ULTIMATE.start_main_~q~0 0)) (.cse0 (<= .cse1 1)) (.cse2 (= 1 ULTIMATE.start___VERIFIER_assert_~cond)) (.cse3 (<= 1 .cse1)) (.cse5 (= ULTIMATE.start_main_~p~0 1))) (or (and .cse0 (= ULTIMATE.start_main_~d~0 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6) (and (<= .cse7 1) (= ULTIMATE.start_main_~d~0 (* .cse1 2)) .cse2 .cse3 .cse4 (= ULTIMATE.start_main_~p~0 2) .cse6 (<= (div (* ULTIMATE.start_main_~d~0 (- 1)) (- 2)) ULTIMATE.start_main_~r~0)) (and (= ULTIMATE.start_main_~q~0 1) .cse0 .cse2 .cse3 .cse5 (= .cse7 (+ ULTIMATE.start_main_~d~0 ULTIMATE.start_main_~r~0)) (= (+ ULTIMATE.start_main_~r~0 .cse1) .cse7) (<= ULTIMATE.start_main_~d~0 .cse7) (< ULTIMATE.start_main_~r~0 (+ (div ULTIMATE.start_main_~d~0 2) 1)))))) [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L15-15(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L258 CegarLoopResult]: At program point L15-17(lines 14 20) the Hoare annotation is: (let ((.cse2 (mod ULTIMATE.start_main_~B~0 4294967296))) (let ((.cse1 (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))) (.cse0 (<= .cse2 1)) (.cse3 (<= 1 .cse2)) (.cse4 (= ULTIMATE.start_main_~p~0 1))) (or (and (< ULTIMATE.start_main_~r~0 4294967296) .cse0 .cse1 (= ULTIMATE.start_main_~d~0 (* ULTIMATE.start_main_~p~0 .cse2)) (= (mod ULTIMATE.start_main_~A~0 4294967296) (+ ULTIMATE.start_main_~r~0 (* ULTIMATE.start_main_~q~0 .cse2))) .cse3 .cse4 (<= 0 ULTIMATE.start_main_~r~0)) (and .cse1 .cse0 (= ULTIMATE.start_main_~d~0 .cse2) .cse3 .cse4 (= ULTIMATE.start_main_~q~0 0))))) [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L15-18(lines 15 18) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L258 CegarLoopResult]: At program point L15-20(lines 14 20) the Hoare annotation is: (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16-1(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16-2(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16-3(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16-4(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16-5(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,009 INFO L262 CegarLoopResult]: For program point L16-6(lines 16 17) no Hoare annotation was computed. [2020-12-09 18:47:16,010 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 18:47:16,010 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2020-12-09 18:47:16,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:47:16 BoogieIcfgContainer [2020-12-09 18:47:16,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 18:47:16,031 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 18:47:16,031 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 18:47:16,031 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 18:47:16,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:44:37" (3/4) ... [2020-12-09 18:47:16,034 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 18:47:16,043 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2020-12-09 18:47:16,043 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-09 18:47:16,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-09 18:47:16,044 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 18:47:16,082 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2bdc759c-7b3e-49cc-9117-a88e9fe9263e/bin/utaipan/witness.graphml [2020-12-09 18:47:16,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 18:47:16,083 INFO L168 Benchmark]: Toolchain (without parser) took 158902.83 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 47.4 MB in the beginning and 94.8 MB in the end (delta: -47.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:47:16,083 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 88.1 MB. Free memory was 63.5 MB in the beginning and 63.4 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:47:16,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 150.91 ms. Allocated memory is still 88.1 MB. Free memory was 47.2 MB in the beginning and 59.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2020-12-09 18:47:16,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.62 ms. Allocated memory is still 88.1 MB. Free memory was 59.5 MB in the beginning and 57.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:47:16,084 INFO L168 Benchmark]: Boogie Preprocessor took 16.71 ms. Allocated memory is still 88.1 MB. Free memory was 57.7 MB in the beginning and 56.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 18:47:16,085 INFO L168 Benchmark]: RCFGBuilder took 337.17 ms. Allocated memory is still 88.1 MB. Free memory was 56.5 MB in the beginning and 45.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 18:47:16,085 INFO L168 Benchmark]: TraceAbstraction took 158317.64 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 44.7 MB in the beginning and 98.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:47:16,085 INFO L168 Benchmark]: Witness Printer took 51.30 ms. Allocated memory is still 130.0 MB. Free memory was 98.0 MB in the beginning and 94.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 18:47:16,087 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.17 ms. Allocated memory is still 88.1 MB. Free memory was 63.5 MB in the beginning and 63.4 MB in the end (delta: 115.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 150.91 ms. Allocated memory is still 88.1 MB. Free memory was 47.2 MB in the beginning and 59.5 MB in the end (delta: -12.4 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 24.62 ms. Allocated memory is still 88.1 MB. Free memory was 59.5 MB in the beginning and 57.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 16.71 ms. Allocated memory is still 88.1 MB. Free memory was 57.7 MB in the beginning and 56.5 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 337.17 ms. Allocated memory is still 88.1 MB. Free memory was 56.5 MB in the beginning and 45.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 158317.64 ms. Allocated memory was 88.1 MB in the beginning and 130.0 MB in the end (delta: 41.9 MB). Free memory was 44.7 MB in the beginning and 98.0 MB in the end (delta: -53.3 MB). Peak memory consumption was 60.1 MB. Max. memory is 16.1 GB. * Witness Printer took 51.30 ms. Allocated memory is still 130.0 MB. Free memory was 98.0 MB in the beginning and 94.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: 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 7 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((A % 4294967296 <= 1 && A == r + A / 4294967296 * 4294967296) && d == B % 4294967296) && 1 == cond) && 1 <= B % 4294967296) && p == 1) && q == 0) && d / -4294967296 <= (d * -1 + 1) / 4294967296) || (((((((A % 4294967296 <= 1 && A == r + A / 4294967296 * 4294967296) && d == B % 4294967296 * 2) && 1 == cond) && 1 <= B % 4294967296) && p == 2) && q == 0) && d * -1 / -2 <= r) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: !(0 == cond) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((B % 4294967296 <= 1 && d == B % 4294967296) && 1 == cond) && 1 <= B % 4294967296) && r == A % 4294967296) && p == 1) && q == 0) || (((((((A % 4294967296 <= 1 && d == B % 4294967296 * 2) && 1 == cond) && 1 <= B % 4294967296) && r == A % 4294967296) && p == 2) && q == 0) && d * -1 / -2 <= r)) || ((((((((q == 1 && B % 4294967296 <= 1) && 1 == cond) && 1 <= B % 4294967296) && p == 1) && A % 4294967296 == d + r) && r + B % 4294967296 == A % 4294967296) && d <= A % 4294967296) && r < d / 2 + 1) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((A % 4294967296 <= 1 && A == r + A / 4294967296 * 4294967296) && d == B % 4294967296) && 1 == cond) && 1 <= B % 4294967296) && p == 1) && q == 0) && d / -4294967296 <= (d * -1 + 1) / 4294967296) || (((((((A % 4294967296 <= 1 && A == r + A / 4294967296 * 4294967296) && d == B % 4294967296 * 2) && 1 == cond) && 1 <= B % 4294967296) && p == 2) && q == 0) && d * -1 / -2 <= r) - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((A % 4294967296 <= 1 && B % 4294967296 <= 1) && d == B % 4294967296) && 1 <= B % 4294967296) && r == A % 4294967296) && p == 1) && q == 0) || (((((((A % 4294967296 <= 1 && d == B % 4294967296 * 2) && 1 == cond) && 1 <= B % 4294967296) && r == A % 4294967296) && p == 2) && q == 0) && d * -1 / -2 <= r) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((A % 4294967296 <= 1 && A == r + A / 4294967296 * 4294967296) && d == B % 4294967296) && 1 == cond) && 1 <= B % 4294967296) && p == 1) && q == 0) && d / -4294967296 <= (d * -1 + 1) / 4294967296) || (((((((A % 4294967296 <= 1 && A == r + A / 4294967296 * 4294967296) && d == B % 4294967296 * 2) && 1 == cond) && 1 <= B % 4294967296) && p == 2) && q == 0) && d * -1 / -2 <= r) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((r < 4294967296 && B % 4294967296 <= 1) && !(0 == cond)) && d == p * (B % 4294967296)) && A % 4294967296 == r + q * (B % 4294967296)) && 1 <= B % 4294967296) && p == 1) && 0 <= r) || (((((!(0 == cond) && B % 4294967296 <= 1) && d == B % 4294967296) && 1 <= B % 4294967296) && p == 1) && q == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: (((((((B % 4294967296 <= 1 && d == B % 4294967296) && 1 == cond) && 1 <= B % 4294967296) && r == A % 4294967296) && p == 1) && q == 0) || (((((((A % 4294967296 <= 1 && d == B % 4294967296 * 2) && 1 == cond) && 1 <= B % 4294967296) && r == A % 4294967296) && p == 2) && q == 0) && d * -1 / -2 <= r)) || ((((((((q == 1 && B % 4294967296 <= 1) && 1 == cond) && 1 <= B % 4294967296) && p == 1) && A % 4294967296 == d + r) && r + B % 4294967296 == A % 4294967296) && d <= A % 4294967296) && r < d / 2 + 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 156.9s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 101 SDtfs, 375 SDslu, 201 SDs, 0 SdLazy, 531 SolverSat, 283 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 219 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 152.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 26 NumberOfFragments, 648 HoareAnnotationTreeSize, 8 FomulaSimplifications, 946 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 1180 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 151.8s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 170116 SizeOfPredicates, 55 NumberOfNonLiveVariables, 464 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 7/64 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...