./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW --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 29d96db4a6009ca50700370626b51b87675af883de25c8c867b510f89e0e2698 --- 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-4e7fbc6 [2022-11-23 13:49:46,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:49:46,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:49:46,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:49:46,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:49:46,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:49:46,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:49:46,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:49:46,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:49:46,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:49:46,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:49:46,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:49:46,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:49:46,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:49:46,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:49:46,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:49:46,171 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:49:46,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:49:46,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:49:46,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:49:46,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:49:46,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:49:46,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:49:46,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:49:46,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:49:46,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:49:46,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:49:46,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:49:46,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:49:46,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:49:46,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:49:46,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:49:46,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:49:46,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:49:46,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:49:46,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:49:46,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:49:46,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:49:46,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:49:46,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:49:46,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:49:46,214 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:49:46,252 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:49:46,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:49:46,252 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:49:46,252 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:49:46,253 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:49:46,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:49:46,253 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:49:46,253 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:49:46,254 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:49:46,254 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:49:46,254 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:49:46,258 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:49:46,258 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:49:46,258 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:49:46,258 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:49:46,259 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:49:46,259 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:49:46,259 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:49:46,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:49:46,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:49:46,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:49:46,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:49:46,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:49:46,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:49:46,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:49:46,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:49:46,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:49:46,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:49:46,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:49:46,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:49:46,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:49:46,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:49:46,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:49:46,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:49:46,264 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:49:46,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:49:46,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:49:46,265 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:49:46,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:49:46,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:49:46,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:49:46,266 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_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/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_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW 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 -> 29d96db4a6009ca50700370626b51b87675af883de25c8c867b510f89e0e2698 [2022-11-23 13:49:46,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:49:46,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:49:46,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:49:46,601 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:49:46,602 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:49:46,603 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/combinations/gcd_1+newton_3_2.i [2022-11-23 13:49:49,613 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:49:49,816 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:49:49,816 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i [2022-11-23 13:49:49,823 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/data/62eaa55d5/6da930b087b54b6180452080b1f6285a/FLAG525d49ca6 [2022-11-23 13:49:49,838 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/data/62eaa55d5/6da930b087b54b6180452080b1f6285a [2022-11-23 13:49:49,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:49:49,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:49:49,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:49:49,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:49:49,851 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:49:49,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:49:49" (1/1) ... [2022-11-23 13:49:49,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f74826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:49, skipping insertion in model container [2022-11-23 13:49:49,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:49:49" (1/1) ... [2022-11-23 13:49:49,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:49:49,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:49:50,116 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_17e7d9ce-d572-4f23-a620-ace7402011f7/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[1226,1239] [2022-11-23 13:49:50,179 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_17e7d9ce-d572-4f23-a620-ace7402011f7/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[2828,2841] [2022-11-23 13:49:50,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:49:50,196 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:49:50,220 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_17e7d9ce-d572-4f23-a620-ace7402011f7/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[1226,1239] [2022-11-23 13:49:50,244 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_17e7d9ce-d572-4f23-a620-ace7402011f7/sv-benchmarks/c/combinations/gcd_1+newton_3_2.i[2828,2841] [2022-11-23 13:49:50,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:49:50,259 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:49:50,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50 WrapperNode [2022-11-23 13:49:50,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:49:50,261 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:49:50,261 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:49:50,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:49:50,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,304 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 90 [2022-11-23 13:49:50,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:49:50,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:49:50,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:49:50,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:49:50,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,343 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,358 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:49:50,359 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:49:50,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:49:50,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:49:50,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (1/1) ... [2022-11-23 13:49:50,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:49:50,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:50,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:49:50,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:49:50,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:49:50,445 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-23 13:49:50,445 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-23 13:49:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-23 13:49:50,446 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-23 13:49:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:49:50,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:49:50,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:49:50,521 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:49:50,524 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:49:50,791 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:49:50,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:49:50,937 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 13:49:50,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:49:50 BoogieIcfgContainer [2022-11-23 13:49:50,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:49:50,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:49:50,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:49:50,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:49:50,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:49:49" (1/3) ... [2022-11-23 13:49:50,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d55439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:49:50, skipping insertion in model container [2022-11-23 13:49:50,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:49:50" (2/3) ... [2022-11-23 13:49:50,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d55439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:49:50, skipping insertion in model container [2022-11-23 13:49:50,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:49:50" (3/3) ... [2022-11-23 13:49:50,961 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_2.i [2022-11-23 13:49:50,984 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:49:50,984 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 13:49:51,051 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:49:51,058 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;@1c9819f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:49:51,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-23 13:49:51,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 13:49:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-23 13:49:51,073 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:51,074 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-23 13:49:51,074 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:49:51,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:51,082 INFO L85 PathProgramCache]: Analyzing trace with hash -391407110, now seen corresponding path program 1 times [2022-11-23 13:49:51,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:49:51,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033290245] [2022-11-23 13:49:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:49:51,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 13:49:51,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1278213221] [2022-11-23 13:49:51,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:51,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:51,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:51,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:51,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:49:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:51,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 13:49:51,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:51,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 13:49:51,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:49:51,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033290245] [2022-11-23 13:49:51,415 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 13:49:51,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278213221] [2022-11-23 13:49:51,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278213221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:49:51,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:49:51,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:49:51,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611005432] [2022-11-23 13:49:51,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:49:51,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:49:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:49:51,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:49:51,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:49:51,454 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-11-23 13:49:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:51,506 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-11-23 13:49:51,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:49:51,508 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-11-23 13:49:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:51,515 INFO L225 Difference]: With dead ends: 37 [2022-11-23 13:49:51,516 INFO L226 Difference]: Without dead ends: 24 [2022-11-23 13:49:51,518 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-11-23 13:49:51,522 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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-11-23 13:49:51,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:49:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-23 13:49:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-23 13:49:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 13:49:51,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-23 13:49:51,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 6 [2022-11-23 13:49:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:51,557 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-23 13:49:51,557 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-11-23 13:49:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-23 13:49:51,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-23 13:49:51,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:51,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:51,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:51,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:51,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:49:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:51,766 INFO L85 PathProgramCache]: Analyzing trace with hash 749024068, now seen corresponding path program 1 times [2022-11-23 13:49:51,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:49:51,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776902092] [2022-11-23 13:49:51,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:51,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:49:51,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 13:49:51,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871053100] [2022-11-23 13:49:51,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:51,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:51,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:51,786 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:51,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:49:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:49:51,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-23 13:49:51,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:49:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:52,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:49:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:49:52,077 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:49:52,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776902092] [2022-11-23 13:49:52,079 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 13:49:52,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871053100] [2022-11-23 13:49:52,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871053100] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:49:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1584692775] [2022-11-23 13:49:52,108 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-23 13:49:52,108 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:49:52,112 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:49:52,120 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:49:52,121 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:49:52,466 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:49:52,858 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(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-11-23 13:49:52,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 13:49:52,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:49:52,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-23 13:49:52,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913767231] [2022-11-23 13:49:52,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:49:52,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 13:49:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:49:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 13:49:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:49:52,863 INFO L87 Difference]: Start difference. First operand 24 states and 28 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-11-23 13:49:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:49:52,955 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-11-23 13:49:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 13:49:52,956 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-11-23 13:49:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:49:52,957 INFO L225 Difference]: With dead ends: 28 [2022-11-23 13:49:52,957 INFO L226 Difference]: Without dead ends: 25 [2022-11-23 13:49:52,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:49:52,961 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:49:52,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 96 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 13:49:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-23 13:49:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-23 13:49:52,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 13:49:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-11-23 13:49:52,979 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 7 [2022-11-23 13:49:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:49:52,980 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-11-23 13:49:52,981 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-11-23 13:49:52,981 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-11-23 13:49:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-23 13:49:52,982 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:49:52,982 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-23 13:49:52,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 13:49:53,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:53,188 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:49:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:49:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1742652218, now seen corresponding path program 2 times [2022-11-23 13:49:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:49:53,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490937695] [2022-11-23 13:49:53,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:49:53,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:49:53,208 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 13:49:53,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126976012] [2022-11-23 13:49:53,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:49:53,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:49:53,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:49:53,212 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:49:53,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:50:04,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:50:04,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:50:04,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-23 13:50:04,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:50:44,616 WARN L233 SmtUtils]: Spent 10.40s on a formula simplification. DAG size of input: 47 DAG size of output: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:51:07,302 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-11-23 13:51:38,401 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-11-23 13:51:57,263 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-11-23 13:51:59,267 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-11-23 13:51:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 13:51:59,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:06,058 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-11-23 13:53:45,911 WARN L859 $PredicateComparison]: unable to prove that (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse3 (<= .cse2 127))) (and (or (let ((.cse1 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse0 (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)))) (and (or .cse0 (= .cse1 0)) (or .cse0 (<= (mod .cse1 256) 127))))) .cse3) (let ((.cse4 (mod (mod .cse2 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse3) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256) 0)) (= .cse4 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0))) is different from true [2022-11-23 13:54:38,315 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-11-23 13:54:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-23 13:54:38,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490937695] [2022-11-23 13:54:38,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-23 13:54:38,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126976012] [2022-11-23 13:54:38,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126976012] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:54:38,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1251021904] [2022-11-23 13:54:38,318 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-23 13:54:38,319 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 13:54:38,319 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 13:54:38,319 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 13:54:38,319 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 13:54:38,408 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 13:54:40,295 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '318#(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-11-23 13:54:40,295 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 13:54:40,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:54:40,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2022-11-23 13:54:40,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014602397] [2022-11-23 13:54:40,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-23 13:54:40,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:54:40,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:54:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=125, Unknown=8, NotChecked=162, Total=342 [2022-11-23 13:54:40,298 INFO L87 Difference]: Start difference. First operand 25 states and 29 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-11-23 13:54:42,343 WARN L859 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (not (= (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|) 0)) (let ((.cse2 (mod (* 255 |c_ULTIMATE.start_main1_~x~0#1|) 256))) (let ((.cse3 (<= .cse2 127))) (and (or (let ((.cse1 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (let ((.cse0 (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse1 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)))) (and (or .cse0 (= .cse1 0)) (or .cse0 (<= (mod .cse1 256) 127))))) .cse3) (let ((.cse4 (mod (mod .cse2 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse3) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse4) 256) 0)) (= .cse4 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (not (< |c_ULTIMATE.start_main1_~x~0#1| 0)))) is different from true [2022-11-23 13:56:37,378 WARN L233 SmtUtils]: Spent 1.77m on a formula simplification. DAG size of input: 152 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:56:39,384 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-11-23 13:56:41,389 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int)) (let ((.cse0 (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)) (<= .cse0 127) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |c_ULTIMATE.start_main1_~y~0#1|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse0 |c_ULTIMATE.start_main1_~y~0#1|) 256))))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|) 256) 0)) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| 0) (= |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|))) is different from false [2022-11-23 13:56:43,402 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-11-23 13:56:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:43,418 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-23 13:56:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 13:56:43,419 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-11-23 13:56:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:43,420 INFO L225 Difference]: With dead ends: 29 [2022-11-23 13:56:43,420 INFO L226 Difference]: Without dead ends: 26 [2022-11-23 13:56:43,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 156.6s TimeCoverageRelationStatistics Valid=58, Invalid=146, Unknown=14, NotChecked=288, Total=506 [2022-11-23 13:56:43,422 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:43,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 89 Unchecked, 2.0s Time] [2022-11-23 13:56:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-23 13:56:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-23 13:56:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-23 13:56:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-23 13:56:43,429 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2022-11-23 13:56:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:43,429 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-23 13:56:43,430 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-11-23 13:56:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-23 13:56:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 13:56:43,430 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:43,431 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:43,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:56:43,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:43,640 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 13:56:43,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1814613500, now seen corresponding path program 3 times [2022-11-23 13:56:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:43,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842422455] [2022-11-23 13:56:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:43,654 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-23 13:56:43,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260390212] [2022-11-23 13:56:43,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:56:43,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:43,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:56:43,656 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:56:43,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17e7d9ce-d572-4f23-a620-ace7402011f7/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:56:51,224 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:56:51,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:56:51,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-23 13:56:51,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:10,892 WARN L233 SmtUtils]: Spent 5.15s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:57:23,906 WARN L233 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 43 DAG size of output: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 13:58:18,561 WARN L837 $PredicateComparison]: unable to prove that (and (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0)) (exists ((|ULTIMATE.start_gcd_test_#in~a#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_33| Int)) (and (< |ULTIMATE.start_gcd_test_#in~a#1| 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_33| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (= (mod |ULTIMATE.start_gcd_test_#in~a#1| |v_ULTIMATE.start_gcd_test_~a#1_33|) 0) (<= 0 (+ |ULTIMATE.start_gcd_test_#in~a#1| 128)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_33|) (= (mod (mod (mod (* 255 |ULTIMATE.start_gcd_test_#in~a#1|) 256) |v_ULTIMATE.start_gcd_test_~a#1_33|) 256) |c_ULTIMATE.start_gcd_test_~a#1|)))) is different from false [2022-11-23 13:58:59,078 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-11-23 13:59:23,650 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-11-23 13:59:25,652 WARN L859 $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 true [2022-11-23 13:59:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-23 13:59:49,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:00:40,224 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse23 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse31 (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse15 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse32 (mod (+ .cse23 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse24 (mod .cse23 256)) (.cse2 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse12 (<= .cse32 127)) (.cse7 (= .cse32 0)) (.cse8 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse32) 256) 0))) (.cse9 (not .cse15)) (.cse5 (<= .cse31 127))) (let ((.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse32)) 256) 0))) (.cse4 (not .cse5)) (.cse1 (or .cse7 .cse8 .cse9)) (.cse11 (not .cse12)) (.cse22 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 0))) (.cse21 (not .cse2)) (.cse19 (= .cse31 0)) (.cse20 (not (= (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 0))) (.cse25 (<= .cse24 127))) (and (or (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse24)) (.cse17 (= .cse24 0))) (let ((.cse18 (or (not (= .cse16 0)) .cse15 .cse17)) (.cse6 (= .cse23 0))) (let ((.cse10 (or .cse21 (and .cse18 (or .cse6 .cse9 .cse22)))) (.cse3 (or (and .cse18 (or .cse6 .cse9 .cse19 .cse20)) .cse21)) (.cse0 (or .cse15 (not (= (mod .cse16 256) 0)) .cse17))) (and (or (and (or (and (or (and .cse0 .cse1) .cse2) .cse3) .cse4) (or .cse5 (and (or .cse2 (and .cse0 (or .cse6 .cse7 .cse8 .cse9))) .cse10))) .cse11) (or .cse12 (let ((.cse13 (or (and (or .cse6 .cse14 .cse9) .cse0) .cse2))) (and (or (and .cse13 .cse10) .cse5) (or (and .cse13 .cse3) .cse4)))))))) (not .cse25)) (or (let ((.cse29 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse24)) 256) 0)) .cse15))) (let ((.cse26 (or .cse21 (and (or .cse9 .cse19 .cse20) .cse29))) (.cse28 (or .cse21 (and .cse29 (or .cse9 .cse22))))) (and (or (let ((.cse27 (or .cse2 (and (or .cse14 .cse9) .cse29)))) (and (or .cse4 (and .cse26 .cse27)) (or (and .cse28 .cse27) .cse5))) .cse12) (or (let ((.cse30 (or (and .cse29 .cse1) .cse2))) (and (or (and .cse26 .cse30) .cse4) (or (and .cse30 .cse28) .cse5))) .cse11)))) .cse25)))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2022-11-23 14:04:24,633 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse47 (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse49 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse45 (mod (+ .cse22 .cse49) 256)) (.cse43 (+ (- 256) .cse47))) (let ((.cse44 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse43)) (.cse14 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse41 (+ (- 256) .cse45)) (.cse46 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse45) 256)) (.cse37 (* .cse22 255)) (.cse48 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse47))) (let ((.cse23 (mod .cse22 256)) (.cse2 (<= .cse47 127)) (.cse28 (not (= (mod (mod .cse47 (+ (mod (+ .cse37 .cse49 .cse48) 256) (- 256))) 256) 0))) (.cse29 (= .cse48 0)) (.cse30 (= .cse47 0)) (.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse34 (= .cse46 0)) (.cse35 (= .cse45 0)) (.cse36 (not (= (mod (mod .cse45 .cse46) 256) 0))) (.cse10 (<= .cse45 127)) (.cse42 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse41) 256)) (.cse5 (not .cse14)) (.cse32 (= .cse44 0)) (.cse33 (not (= (mod .cse43 (+ (- 256) (mod (+ .cse22 .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) 0)))) (let ((.cse21 (or .cse5 .cse32 .cse33)) (.cse6 (= .cse42 0)) (.cse7 (not (= 0 (mod .cse41 .cse42)))) (.cse13 (not .cse10)) (.cse12 (or .cse34 .cse35 .cse36 .cse5)) (.cse18 (not .cse9)) (.cse20 (or .cse28 .cse29 .cse5 .cse30)) (.cse4 (not .cse2)) (.cse24 (<= .cse23 127))) (and (or (let ((.cse16 (+ (- 256) .cse23))) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16))) (let ((.cse19 (or .cse14 (not (= (mod .cse16 (+ (- 256) (mod (+ .cse22 .cse17) 256))) 0)) (= .cse17 0)))) (let ((.cse1 (or .cse18 (and .cse19 .cse21))) (.cse3 (or .cse18 (and .cse19 .cse20))) (.cse8 (let ((.cse15 (mod .cse17 256))) (or .cse14 (= .cse15 0) (not (= (mod .cse16 .cse15) 0)))))) (and (or (let ((.cse0 (or (and (or .cse5 .cse6 .cse7) .cse8) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or (and .cse3 .cse0) .cse4))) .cse10) (or (let ((.cse11 (or (and .cse12 .cse8) .cse9))) (and (or (and .cse11 .cse1) .cse2) (or .cse4 (and .cse3 .cse11)))) .cse13)))))) .cse24) (or (let ((.cse39 (= .cse23 0)) (.cse38 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse23))) (let ((.cse27 (= .cse22 0)) (.cse31 (let ((.cse40 (mod .cse38 256))) (or (not (= (mod (mod .cse23 .cse40) 256) 0)) .cse14 (= .cse40 0) .cse39))) (.cse25 (or (not (= (mod (mod .cse23 (+ (mod (+ .cse37 .cse38) 256) (- 256))) 256) 0)) .cse14 (= .cse38 0) .cse39))) (and (or (let ((.cse26 (or (and (or .cse27 .cse5 .cse6 .cse7) .cse31) .cse9))) (and (or .cse2 (and (or .cse18 (and .cse25 .cse21)) .cse26)) (or (and .cse26 (or .cse18 (and .cse25 (or .cse27 .cse28 .cse29 .cse5 .cse30)))) .cse4))) .cse10) (or .cse13 (and (or (and (or (and (or .cse27 .cse5 .cse32 .cse33) .cse25) .cse18) (or (and .cse31 (or .cse34 .cse27 .cse35 .cse36 .cse5)) .cse9)) .cse2) (or (and (or .cse9 (and .cse31 .cse12)) (or .cse18 (and .cse25 .cse20))) .cse4)))))) (not .cse24))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2022-11-23 14:04:26,639 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse22 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse47 (mod (+ .cse22 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse49 (* |c_ULTIMATE.start_gcd_test_~b#1| 255))) (let ((.cse45 (mod (+ .cse22 .cse49) 256)) (.cse43 (+ (- 256) .cse47))) (let ((.cse44 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse43)) (.cse14 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse41 (+ (- 256) .cse45)) (.cse46 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse45) 256)) (.cse37 (* .cse22 255)) (.cse48 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse47))) (let ((.cse23 (mod .cse22 256)) (.cse2 (<= .cse47 127)) (.cse28 (not (= (mod (mod .cse47 (+ (mod (+ .cse37 .cse49 .cse48) 256) (- 256))) 256) 0))) (.cse29 (= .cse48 0)) (.cse30 (= .cse47 0)) (.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse34 (= .cse46 0)) (.cse35 (= .cse45 0)) (.cse36 (not (= (mod (mod .cse45 .cse46) 256) 0))) (.cse10 (<= .cse45 127)) (.cse42 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse41) 256)) (.cse5 (not .cse14)) (.cse32 (= .cse44 0)) (.cse33 (not (= (mod .cse43 (+ (- 256) (mod (+ .cse22 .cse44 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) 0)))) (let ((.cse21 (or .cse5 .cse32 .cse33)) (.cse6 (= .cse42 0)) (.cse7 (not (= 0 (mod .cse41 .cse42)))) (.cse13 (not .cse10)) (.cse12 (or .cse34 .cse35 .cse36 .cse5)) (.cse18 (not .cse9)) (.cse20 (or .cse28 .cse29 .cse5 .cse30)) (.cse4 (not .cse2)) (.cse24 (<= .cse23 127))) (and (or (let ((.cse16 (+ (- 256) .cse23))) (let ((.cse17 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16))) (let ((.cse19 (or .cse14 (not (= (mod .cse16 (+ (- 256) (mod (+ .cse22 .cse17) 256))) 0)) (= .cse17 0)))) (let ((.cse1 (or .cse18 (and .cse19 .cse21))) (.cse3 (or .cse18 (and .cse19 .cse20))) (.cse8 (let ((.cse15 (mod .cse17 256))) (or .cse14 (= .cse15 0) (not (= (mod .cse16 .cse15) 0)))))) (and (or (let ((.cse0 (or (and (or .cse5 .cse6 .cse7) .cse8) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or (and .cse3 .cse0) .cse4))) .cse10) (or (let ((.cse11 (or (and .cse12 .cse8) .cse9))) (and (or (and .cse11 .cse1) .cse2) (or .cse4 (and .cse3 .cse11)))) .cse13)))))) .cse24) (or (let ((.cse39 (= .cse23 0)) (.cse38 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse23))) (let ((.cse27 (= .cse22 0)) (.cse31 (let ((.cse40 (mod .cse38 256))) (or (not (= (mod (mod .cse23 .cse40) 256) 0)) .cse14 (= .cse40 0) .cse39))) (.cse25 (or (not (= (mod (mod .cse23 (+ (mod (+ .cse37 .cse38) 256) (- 256))) 256) 0)) .cse14 (= .cse38 0) .cse39))) (and (or (let ((.cse26 (or (and (or .cse27 .cse5 .cse6 .cse7) .cse31) .cse9))) (and (or .cse2 (and (or .cse18 (and .cse25 .cse21)) .cse26)) (or (and .cse26 (or .cse18 (and .cse25 (or .cse27 .cse28 .cse29 .cse5 .cse30)))) .cse4))) .cse10) (or .cse13 (and (or (and (or (and (or .cse27 .cse5 .cse32 .cse33) .cse25) .cse18) (or (and .cse31 (or .cse34 .cse27 .cse35 .cse36 .cse5)) .cse9)) .cse2) (or (and (or .cse9 (and .cse31 .cse12)) (or .cse18 (and .cse25 .cse20))) .cse4)))))) (not .cse24))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true