./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_2_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_2_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh --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 0125703895252bbc87284f9ee87e686d5271b5cf813038cb613c1b0c2ad30cb5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:36:55,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:36:55,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:36:55,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:36:55,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:36:55,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:36:55,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:36:55,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:36:55,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:36:55,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:36:55,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:36:55,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:36:55,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:36:55,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:36:55,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:36:55,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:36:55,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:36:55,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:36:55,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:36:55,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:36:55,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:36:55,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:36:55,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:36:55,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:36:55,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:36:55,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:36:55,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:36:55,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:36:55,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:36:55,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:36:55,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:36:55,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:36:55,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:36:55,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:36:55,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:36:55,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:36:55,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:36:55,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:36:55,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:36:55,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:36:55,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:36:55,365 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:36:55,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:36:55,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:36:55,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:36:55,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:36:55,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:36:55,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:36:55,389 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:36:55,389 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:36:55,389 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:36:55,389 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:36:55,389 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:36:55,389 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:36:55,390 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:36:55,390 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:36:55,390 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:36:55,390 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:36:55,390 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:36:55,391 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:36:55,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:36:55,391 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:36:55,392 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:36:55,393 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:36:55,393 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:36:55,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:36:55,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:36:55,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:36:55,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:36:55,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:36:55,394 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:36:55,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/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_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh 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 -> 0125703895252bbc87284f9ee87e686d5271b5cf813038cb613c1b0c2ad30cb5 [2022-12-14 07:36:55,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:36:55,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:36:55,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:36:55,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:36:55,617 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:36:55,618 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/combinations/gcd_1+newton_2_2.i [2022-12-14 07:36:58,275 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:36:58,449 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:36:58,450 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/sv-benchmarks/c/combinations/gcd_1+newton_2_2.i [2022-12-14 07:36:58,456 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/data/cab656d83/50121bc6f1224c7888b807cdaa1265d5/FLAG2e0c32124 [2022-12-14 07:36:58,468 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/data/cab656d83/50121bc6f1224c7888b807cdaa1265d5 [2022-12-14 07:36:58,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:36:58,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:36:58,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:36:58,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:36:58,476 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:36:58,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3846cba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58, skipping insertion in model container [2022-12-14 07:36:58,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:36:58,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:36:58,621 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/sv-benchmarks/c/combinations/gcd_1+newton_2_2.i[1226,1239] [2022-12-14 07:36:58,639 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/sv-benchmarks/c/combinations/gcd_1+newton_2_2.i[2807,2820] [2022-12-14 07:36:58,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:36:58,648 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:36:58,659 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/sv-benchmarks/c/combinations/gcd_1+newton_2_2.i[1226,1239] [2022-12-14 07:36:58,666 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/sv-benchmarks/c/combinations/gcd_1+newton_2_2.i[2807,2820] [2022-12-14 07:36:58,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:36:58,678 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:36:58,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58 WrapperNode [2022-12-14 07:36:58,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:36:58,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:36:58,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:36:58,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:36:58,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,709 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-12-14 07:36:58,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:36:58,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:36:58,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:36:58,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:36:58,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:36:58,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:36:58,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:36:58,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:36:58,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (1/1) ... [2022-12-14 07:36:58,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:36:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:36:58,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:36:58,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:36:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:36:58,787 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-12-14 07:36:58,788 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-12-14 07:36:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-12-14 07:36:58,788 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-12-14 07:36:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:36:58,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:36:58,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:36:58,852 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:36:58,853 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:36:58,992 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:36:59,035 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:36:59,035 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 07:36:59,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:59 BoogieIcfgContainer [2022-12-14 07:36:59,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:36:59,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:36:59,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:36:59,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:36:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:36:58" (1/3) ... [2022-12-14 07:36:59,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b6a0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:36:59, skipping insertion in model container [2022-12-14 07:36:59,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:36:58" (2/3) ... [2022-12-14 07:36:59,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b6a0e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:36:59, skipping insertion in model container [2022-12-14 07:36:59,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:36:59" (3/3) ... [2022-12-14 07:36:59,044 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_2.i [2022-12-14 07:36:59,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:36:59,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-14 07:36:59,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:36:59,099 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3270b37c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:36:59,099 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-14 07:36:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 07:36:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 07:36:59,110 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:36:59,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 07:36:59,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:36:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:36:59,115 INFO L85 PathProgramCache]: Analyzing trace with hash -592026431, now seen corresponding path program 1 times [2022-12-14 07:36:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:36:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171284796] [2022-12-14 07:36:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:36:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:36:59,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 07:36:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [935927629] [2022-12-14 07:36:59,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:36:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:36:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:36:59,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:36:59,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:36:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:36:59,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:36:59,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:36:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:36:59,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:36:59,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:36:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171284796] [2022-12-14 07:36:59,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 07:36:59,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935927629] [2022-12-14 07:36:59,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935927629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:36:59,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:36:59,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:36:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057188560] [2022-12-14 07:36:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:36:59,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:36:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:36:59,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:36:59,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:36:59,382 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.4375) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:36:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:36:59,420 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-12-14 07:36:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:36:59,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 07:36:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:36:59,427 INFO L225 Difference]: With dead ends: 34 [2022-12-14 07:36:59,427 INFO L226 Difference]: Without dead ends: 21 [2022-12-14 07:36:59,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:36:59,431 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:36:59,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:36:59,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-14 07:36:59,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-14 07:36:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 07:36:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-12-14 07:36:59,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 6 [2022-12-14 07:36:59,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:36:59,456 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-12-14 07:36:59,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:36:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-12-14 07:36:59,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:36:59,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:36:59,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:36:59,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:36:59,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:36:59,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:36:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:36:59,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1175005777, now seen corresponding path program 1 times [2022-12-14 07:36:59,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:36:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345047825] [2022-12-14 07:36:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:36:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:36:59,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 07:36:59,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272561890] [2022-12-14 07:36:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:36:59,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:36:59,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:36:59,702 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:36:59,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:36:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:36:59,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 07:36:59,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:36:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:36:59,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:36:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:36:59,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:36:59,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345047825] [2022-12-14 07:36:59,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 07:36:59,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272561890] [2022-12-14 07:36:59,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272561890] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:36:59,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [496806715] [2022-12-14 07:36:59,930 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 07:36:59,930 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:36:59,933 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:36:59,938 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:36:59,939 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:37:00,114 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:37:00,373 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '167#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#res#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (<= 0 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_gcd_test_#in~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 07:37:00,374 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:37:00,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:37:00,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-12-14 07:37:00,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532901435] [2022-12-14 07:37:00,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 07:37:00,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:37:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:37:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:37:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-14 07:37:00,376 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:37:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:37:00,421 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-12-14 07:37:00,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:37:00,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 07:37:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:37:00,422 INFO L225 Difference]: With dead ends: 25 [2022-12-14 07:37:00,422 INFO L226 Difference]: Without dead ends: 22 [2022-12-14 07:37:00,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-14 07:37:00,424 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:37:00,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 57 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:37:00,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-12-14 07:37:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-12-14 07:37:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 07:37:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-12-14 07:37:00,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 7 [2022-12-14 07:37:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:37:00,430 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-12-14 07:37:00,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:37:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-12-14 07:37:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:37:00,431 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:37:00,431 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-14 07:37:00,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:37:00,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:37:00,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:37:00,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:37:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2067496319, now seen corresponding path program 2 times [2022-12-14 07:37:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:37:00,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813921077] [2022-12-14 07:37:00,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:37:00,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:37:00,663 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 07:37:00,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316348007] [2022-12-14 07:37:00,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 07:37:00,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:37:00,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:37:00,668 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:37:00,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:37:11,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 07:37:11,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:37:11,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-14 07:37:11,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:37:36,716 WARN L233 SmtUtils]: Spent 12.00s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:38:11,052 WARN L837 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= 0 .cse0)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0))))) is different from false [2022-12-14 07:38:42,771 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |ULTIMATE.start_main1_~y~0#1|) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256) 0) (not (= .cse0 0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) is different from false [2022-12-14 07:39:01,244 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |ULTIMATE.start_main1_~y~0#1|) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256) 0) (not (= .cse0 0))))) is different from false [2022-12-14 07:39:03,247 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |ULTIMATE.start_main1_~y~0#1|) 0) (< 0 |ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (= (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256) 0) (not (= .cse0 0))))) is different from true [2022-12-14 07:39:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 07:39:03,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:39:57,965 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse32 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse19 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse33 (mod (+ .cse32 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse34 (mod (+ .cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse18 (mod .cse32 256)) (.cse5 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse9 (<= .cse34 127)) (.cse0 (<= .cse33 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse33) 256) 0))) (.cse27 (= .cse33 0)) (.cse28 (= |c_ULTIMATE.start_main1_~y~0#1| .cse33)) (.cse29 (= .cse34 0)) (.cse30 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0))) (.cse13 (not .cse19)) (.cse31 (= |c_ULTIMATE.start_main1_~y~0#1| .cse34)) (.cse20 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (let ((.cse11 (= .cse34 .cse20)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse34)) 256) 0))) (.cse6 (or .cse29 .cse30 .cse13 .cse31)) (.cse17 (or .cse25 .cse13 .cse27 .cse28)) (.cse3 (not .cse0)) (.cse8 (not .cse9)) (.cse14 (not .cse5)) (.cse15 (= .cse33 .cse20)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse33)) 256) 0))) (.cse21 (<= .cse18 127))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse18)) 256) 0)) .cse19 (= .cse18 .cse20)))) (let ((.cse4 (or .cse14 (and .cse17 .cse7))) (.cse1 (or .cse14 (and .cse7 (or .cse15 .cse16 .cse13))))) (and (or (let ((.cse2 (or .cse5 (and .cse6 .cse7)))) (and (or .cse0 (and .cse1 .cse2)) (or .cse3 (and .cse4 .cse2)))) .cse8) (or .cse9 (let ((.cse10 (or (and .cse7 (or .cse11 .cse12 .cse13)) .cse5))) (and (or .cse3 (and .cse10 .cse4)) (or .cse0 (and .cse10 .cse1)))))))) .cse21) (or (let ((.cse24 (or .cse19 (= |c_ULTIMATE.start_main1_~y~0#1| .cse18) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18) 256) 0)) (= .cse18 0))) (.cse26 (= .cse32 0))) (let ((.cse22 (or .cse14 (and .cse24 (or .cse26 .cse15 .cse16 .cse13))))) (and (or .cse9 (let ((.cse23 (or (and .cse24 (or .cse26 .cse11 .cse12 .cse13)) .cse5))) (and (or (and .cse22 .cse23) .cse0) (or (and (or .cse14 (and .cse24 (or .cse25 .cse26 .cse13 .cse27 .cse28))) .cse23) .cse3)))) (or (and (or (and (or (and .cse6 .cse24) .cse5) (or .cse14 (and .cse24 .cse17))) .cse3) (or .cse0 (and (or (and .cse24 (or .cse26 .cse29 .cse30 .cse13 .cse31)) .cse5) .cse22))) .cse8)))) (not .cse21))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-12-14 07:41:40,944 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification. DAG size of input: 45 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:42:27,610 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_12| Int) (|v_ULTIMATE.start_main1_~x~0#1_7| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_7|) 256) |v_ULTIMATE.start_main1_~y~0#1_12|) 256))) (or (not (= 0 (mod (mod |v_ULTIMATE.start_main1_~y~0#1_12| .cse0) 256))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_7|) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_7|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_12| 0) (not (= (mod |v_ULTIMATE.start_main1_~x~0#1_7| |v_ULTIMATE.start_main1_~y~0#1_12|) 0)) (= .cse0 0)))) is different from true [2022-12-14 07:42:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 07:42:27,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:42:27,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813921077] [2022-12-14 07:42:27,611 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 07:42:27,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316348007] [2022-12-14 07:42:27,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316348007] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:42:27,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1676810870] [2022-12-14 07:42:27,613 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-12-14 07:42:27,614 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:42:27,614 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:42:27,614 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:42:27,614 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:42:29,703 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:42:45,473 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '295#(and (= |ULTIMATE.start_gcd_test_~b#1| 0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| (ite (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_main1_~y~0#1|) 1 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#res#1| 128)) (<= |ULTIMATE.start_gcd_test_#in~a#1| 127) (<= |ULTIMATE.start_main1_~x~0#1| 127) (<= |ULTIMATE.start_gcd_test_#in~b#1| 127) (<= 0 |ULTIMATE.start_main1_~y~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (<= 0 |ULTIMATE.start_gcd_test_#in~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= 0 (+ |ULTIMATE.start_main1_~x~0#1| 128)) (<= |ULTIMATE.start_gcd_test_#res#1| 127) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (= |ULTIMATE.start_main1_~g~0#1| |ULTIMATE.start_gcd_test_#res#1|) (= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_#res#1|) (<= |ULTIMATE.start_main1_~y~0#1| 127) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 07:42:45,473 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:42:45,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 07:42:45,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2022-12-14 07:42:45,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201422668] [2022-12-14 07:42:45,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 07:42:45,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 07:42:45,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:42:45,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 07:42:45,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=139, Unknown=16, NotChecked=140, Total=342 [2022-12-14 07:42:45,474 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:42:47,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-12-14 07:43:46,670 WARN L233 SmtUtils]: Spent 47.66s on a formula simplification. DAG size of input: 46 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:43:48,686 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) .cse0 (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse3 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= .cse3 127))) (and (let ((.cse1 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse2 (= .cse1 0))) (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse2) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256) 0)) (= .cse4 0)))))) (not .cse0) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse5 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (<= .cse5 127)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse5)))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse6 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= .cse6 127) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse6))))) (or (let ((.cse39 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse41 (mod (+ .cse39 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse25 (mod .cse39 256)) (.cse12 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse16 (<= .cse41 127)) (.cse7 (<= .cse40 127)) (.cse32 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 256) 0))) (.cse34 (= .cse40 0)) (.cse35 (= |c_ULTIMATE.start_main1_~y~0#1| .cse40)) (.cse36 (= .cse41 0)) (.cse37 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse41) 256) 0))) (.cse20 (not .cse26)) (.cse38 (= |c_ULTIMATE.start_main1_~y~0#1| .cse41)) (.cse27 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (let ((.cse18 (= .cse41 .cse27)) (.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse41)) 256) 0))) (.cse13 (or .cse36 .cse37 .cse20 .cse38)) (.cse24 (or .cse32 .cse20 .cse34 .cse35)) (.cse10 (not .cse7)) (.cse15 (not .cse16)) (.cse21 (not .cse12)) (.cse22 (= .cse40 .cse27)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse40)) 256) 0))) (.cse28 (<= .cse25 127))) (and (or (let ((.cse14 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse25)) 256) 0)) .cse26 (= .cse25 .cse27)))) (let ((.cse11 (or .cse21 (and .cse24 .cse14))) (.cse8 (or .cse21 (and .cse14 (or .cse22 .cse23 .cse20))))) (and (or (let ((.cse9 (or .cse12 (and .cse13 .cse14)))) (and (or .cse7 (and .cse8 .cse9)) (or .cse10 (and .cse11 .cse9)))) .cse15) (or .cse16 (let ((.cse17 (or (and .cse14 (or .cse18 .cse19 .cse20)) .cse12))) (and (or .cse10 (and .cse17 .cse11)) (or .cse7 (and .cse17 .cse8)))))))) .cse28) (or (let ((.cse31 (or .cse26 (= |c_ULTIMATE.start_main1_~y~0#1| .cse25) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 0)) (= .cse25 0))) (.cse33 (= .cse39 0))) (let ((.cse29 (or .cse21 (and .cse31 (or .cse33 .cse22 .cse23 .cse20))))) (and (or .cse16 (let ((.cse30 (or (and .cse31 (or .cse33 .cse18 .cse19 .cse20)) .cse12))) (and (or (and .cse29 .cse30) .cse7) (or (and (or .cse21 (and .cse31 (or .cse32 .cse33 .cse20 .cse34 .cse35))) .cse30) .cse10)))) (or (and (or (and (or (and .cse13 .cse31) .cse12) (or .cse21 (and .cse31 .cse24))) .cse10) (or .cse7 (and (or (and .cse31 (or .cse33 .cse36 .cse37 .cse20 .cse38)) .cse12) .cse29))) .cse15)))) (not .cse28))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)))) is different from false [2022-12-14 07:43:50,691 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 |c_ULTIMATE.start_main1_~y~0#1|))) (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) .cse0 (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse3 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse2 (<= .cse3 127))) (and (let ((.cse1 (mod (+ .cse3 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse2 (= .cse1 0))) (let ((.cse4 (mod (mod .cse3 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse2) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256) 0)) (= .cse4 0)))))) (not .cse0) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) (or (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse5 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (<= .cse5 127)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse5)))) (and (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (= (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse6 (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (<= .cse6 127) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse6))))) (or (let ((.cse39 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse26 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse40 (mod (+ .cse39 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse41 (mod (+ .cse39 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse25 (mod .cse39 256)) (.cse12 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse16 (<= .cse41 127)) (.cse7 (<= .cse40 127)) (.cse32 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse40) 256) 0))) (.cse34 (= .cse40 0)) (.cse35 (= |c_ULTIMATE.start_main1_~y~0#1| .cse40)) (.cse36 (= .cse41 0)) (.cse37 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse41) 256) 0))) (.cse20 (not .cse26)) (.cse38 (= |c_ULTIMATE.start_main1_~y~0#1| .cse41)) (.cse27 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (let ((.cse18 (= .cse41 .cse27)) (.cse19 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse41)) 256) 0))) (.cse13 (or .cse36 .cse37 .cse20 .cse38)) (.cse24 (or .cse32 .cse20 .cse34 .cse35)) (.cse10 (not .cse7)) (.cse15 (not .cse16)) (.cse21 (not .cse12)) (.cse22 (= .cse40 .cse27)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse40)) 256) 0))) (.cse28 (<= .cse25 127))) (and (or (let ((.cse14 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse25)) 256) 0)) .cse26 (= .cse25 .cse27)))) (let ((.cse11 (or .cse21 (and .cse24 .cse14))) (.cse8 (or .cse21 (and .cse14 (or .cse22 .cse23 .cse20))))) (and (or (let ((.cse9 (or .cse12 (and .cse13 .cse14)))) (and (or .cse7 (and .cse8 .cse9)) (or .cse10 (and .cse11 .cse9)))) .cse15) (or .cse16 (let ((.cse17 (or (and .cse14 (or .cse18 .cse19 .cse20)) .cse12))) (and (or .cse10 (and .cse17 .cse11)) (or .cse7 (and .cse17 .cse8)))))))) .cse28) (or (let ((.cse31 (or .cse26 (= |c_ULTIMATE.start_main1_~y~0#1| .cse25) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse25) 256) 0)) (= .cse25 0))) (.cse33 (= .cse39 0))) (let ((.cse29 (or .cse21 (and .cse31 (or .cse33 .cse22 .cse23 .cse20))))) (and (or .cse16 (let ((.cse30 (or (and .cse31 (or .cse33 .cse18 .cse19 .cse20)) .cse12))) (and (or (and .cse29 .cse30) .cse7) (or (and (or .cse21 (and .cse31 (or .cse32 .cse33 .cse20 .cse34 .cse35))) .cse30) .cse10)))) (or (and (or (and (or (and .cse13 .cse31) .cse12) (or .cse21 (and .cse31 .cse24))) .cse10) (or .cse7 (and (or (and .cse31 (or .cse33 .cse36 .cse37 .cse20 .cse38)) .cse12) .cse29))) .cse15)))) (not .cse28))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)))) is different from true [2022-12-14 07:44:18,679 WARN L233 SmtUtils]: Spent 23.24s on a formula simplification. DAG size of input: 37 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 07:44:20,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:22,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:24,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:26,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:28,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:30,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:32,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2022-12-14 07:44:35,000 WARN L837 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= 0 .cse0)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0)))) (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128))))) is different from false [2022-12-14 07:44:37,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 07:44:38,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Real, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-12-14 07:44:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:44:38,198 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-12-14 07:44:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:44:38,198 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 07:44:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:44:38,199 INFO L225 Difference]: With dead ends: 26 [2022-12-14 07:44:38,199 INFO L226 Difference]: Without dead ends: 23 [2022-12-14 07:44:38,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 220.2s TimeCoverageRelationStatistics Valid=60, Invalid=182, Unknown=26, NotChecked=238, Total=506 [2022-12-14 07:44:38,200 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 19.5s IncrementalHoareTripleChecker+Time [2022-12-14 07:44:38,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 9 Unknown, 77 Unchecked, 19.5s Time] [2022-12-14 07:44:38,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-14 07:44:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-14 07:44:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-14 07:44:38,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-12-14 07:44:38,205 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 8 [2022-12-14 07:44:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:44:38,205 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-12-14 07:44:38,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:44:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-12-14 07:44:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:44:38,205 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:44:38,205 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-12-14 07:44:38,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:44:38,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:44:38,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:44:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:44:38,408 INFO L85 PathProgramCache]: Analyzing trace with hash 330067951, now seen corresponding path program 3 times [2022-12-14 07:44:38,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:44:38,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103791338] [2022-12-14 07:44:38,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:44:38,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:44:38,426 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 07:44:38,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332816744] [2022-12-14 07:44:38,426 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 07:44:38,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:44:38,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:44:38,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:44:38,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3ba06095-da82-4624-8075-00b724562553/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:44:45,425 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 07:44:45,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 07:44:45,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-14 07:44:45,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:46:16,573 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 256)) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (not (= .cse0 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= .cse0 |c_ULTIMATE.start_gcd_test_~a#1|)))) is different from false [2022-12-14 07:46:57,777 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (not (= .cse0 0)) (= (mod (mod .cse0 .cse1) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= .cse1 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) is different from false [2022-12-14 07:47:22,541 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (let ((.cse0 (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| .cse0) 256))) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod .cse0 .cse1) 256) 0) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (not (= .cse0 0)) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (not (= .cse1 0)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|))))) is different from false [2022-12-14 07:47:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-12-14 07:47:48,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:50:57,777 WARN L233 SmtUtils]: Spent 2.43m on a formula simplification that was a NOOP. DAG size: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)