./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/gcd_1+newton_2_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f 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_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/gcd_1+newton_2_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8 --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc4c84af925d120ea9b9db9aa78160f13c1157e642c02b4448c62c56bbe753dd --- 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-e04fb08 [2022-11-16 12:08:12,308 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:08:12,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:08:12,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:08:12,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:08:12,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:08:12,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:08:12,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:08:12,355 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:08:12,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:08:12,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:08:12,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:08:12,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:08:12,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:08:12,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:08:12,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:08:12,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:08:12,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:08:12,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:08:12,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:08:12,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:08:12,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:08:12,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:08:12,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:08:12,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:08:12,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:08:12,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:08:12,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:08:12,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:08:12,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:08:12,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:08:12,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:08:12,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:08:12,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:08:12,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:08:12,408 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:08:12,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:08:12,409 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:08:12,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:08:12,410 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:08:12,411 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:08:12,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 12:08:12,448 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:08:12,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:08:12,449 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:08:12,449 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:08:12,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:08:12,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:08:12,450 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:08:12,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:08:12,451 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:08:12,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:08:12,452 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:08:12,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:08:12,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:08:12,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:08:12,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:08:12,453 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:08:12,453 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:08:12,453 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:08:12,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:08:12,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:08:12,454 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:08:12,454 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:08:12,454 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:08:12,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:08:12,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:08:12,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:08:12,455 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:08:12,455 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:08:12,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:08:12,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:08:12,456 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:08:12,456 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:08:12,456 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:08:12,456 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_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/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_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8 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 -> Automizer 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 -> dc4c84af925d120ea9b9db9aa78160f13c1157e642c02b4448c62c56bbe753dd [2022-11-16 12:08:12,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:08:12,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:08:12,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:08:12,823 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:08:12,826 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:08:12,827 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/combinations/gcd_1+newton_2_1.i [2022-11-16 12:08:12,933 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/data/285025a4c/c5827ee8b2e143ce93db004da69da208/FLAGace679fe1 [2022-11-16 12:08:13,570 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:08:13,571 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i [2022-11-16 12:08:13,580 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/data/285025a4c/c5827ee8b2e143ce93db004da69da208/FLAGace679fe1 [2022-11-16 12:08:13,919 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/data/285025a4c/c5827ee8b2e143ce93db004da69da208 [2022-11-16 12:08:13,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:08:13,924 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:08:13,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:08:13,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:08:13,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:08:13,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:13" (1/1) ... [2022-11-16 12:08:13,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce122aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:13, skipping insertion in model container [2022-11-16 12:08:13,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:13" (1/1) ... [2022-11-16 12:08:13,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:08:13,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:08:14,150 WARN L229 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_1472a9ab-da22-46de-b781-bdfdfcef8677/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[1226,1239] [2022-11-16 12:08:14,201 WARN L229 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_1472a9ab-da22-46de-b781-bdfdfcef8677/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[2807,2820] [2022-11-16 12:08:14,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:08:14,220 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:08:14,248 WARN L229 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_1472a9ab-da22-46de-b781-bdfdfcef8677/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[1226,1239] [2022-11-16 12:08:14,259 WARN L229 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_1472a9ab-da22-46de-b781-bdfdfcef8677/sv-benchmarks/c/combinations/gcd_1+newton_2_1.i[2807,2820] [2022-11-16 12:08:14,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:08:14,274 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:08:14,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14 WrapperNode [2022-11-16 12:08:14,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:08:14,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:08:14,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:08:14,275 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:08:14,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,310 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 85 [2022-11-16 12:08:14,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:08:14,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:08:14,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:08:14,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:08:14,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,333 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:08:14,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:08:14,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:08:14,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:08:14,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (1/1) ... [2022-11-16 12:08:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:08:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:08:14,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:08:14,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:08:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:08:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-11-16 12:08:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-11-16 12:08:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-11-16 12:08:14,401 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-11-16 12:08:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:08:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:08:14,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:08:14,474 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:08:14,476 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:08:14,734 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:08:14,739 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:08:14,740 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 12:08:14,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:14 BoogieIcfgContainer [2022-11-16 12:08:14,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:08:14,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:08:14,744 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:08:14,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:08:14,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:08:13" (1/3) ... [2022-11-16 12:08:14,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:14, skipping insertion in model container [2022-11-16 12:08:14,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:14" (2/3) ... [2022-11-16 12:08:14,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ebc332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:14, skipping insertion in model container [2022-11-16 12:08:14,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:14" (3/3) ... [2022-11-16 12:08:14,750 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_1.i [2022-11-16 12:08:14,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:08:14,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 12:08:14,883 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:08:14,898 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=PETRI_NET, 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;@26ee617e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:08:14,898 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-16 12:08:14,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 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-11-16 12:08:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:08:14,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:08:14,914 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:08:14,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:08:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:08:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-11-16 12:08:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:08:14,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306511856] [2022-11-16 12:08:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:14,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:08:15,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:08:15,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260714344] [2022-11-16 12:08:15,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:08:15,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:08:15,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 12:08:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:08:15,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 12:08:15,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:15,235 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-16 12:08:15,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:08:15,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:08:15,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306511856] [2022-11-16 12:08:15,237 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:08:15,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260714344] [2022-11-16 12:08:15,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260714344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:08:15,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:08:15,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:08:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297264508] [2022-11-16 12:08:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:08:15,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 12:08:15,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:08:15,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 12:08:15,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:08:15,288 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-16 12:08:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:08:15,332 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-11-16 12:08:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 12:08:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 11 [2022-11-16 12:08:15,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:08:15,349 INFO L225 Difference]: With dead ends: 66 [2022-11-16 12:08:15,349 INFO L226 Difference]: Without dead ends: 29 [2022-11-16 12:08:15,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 12:08:15,367 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:08:15,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:08:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-16 12:08:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-16 12:08:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-11-16 12:08:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-16 12:08:15,422 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-11-16 12:08:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:08:15,423 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-16 12:08:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-16 12:08:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-16 12:08:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 12:08:15,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:08:15,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:08:15,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:15,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:15,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:08:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:08:15,643 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-11-16 12:08:15,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:08:15,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824437211] [2022-11-16 12:08:15,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:15,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:08:15,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:08:15,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2132487232] [2022-11-16 12:08:15,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:15,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:15,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:08:15,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:08:15,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 12:08:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:08:15,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 12:08:15,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:15,832 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-16 12:08:15,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 12:08:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:08:15,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824437211] [2022-11-16 12:08:15,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:08:15,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132487232] [2022-11-16 12:08:15,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132487232] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:08:15,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:08:15,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:08:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074519631] [2022-11-16 12:08:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:08:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:08:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:08:15,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:08:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:08:15,837 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-16 12:08:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:08:15,852 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-11-16 12:08:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:08:15,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 11 [2022-11-16 12:08:15,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:08:15,854 INFO L225 Difference]: With dead ends: 36 [2022-11-16 12:08:15,854 INFO L226 Difference]: Without dead ends: 30 [2022-11-16 12:08:15,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-16 12:08:15,856 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:08:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:08:15,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-16 12:08:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-16 12:08:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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-11-16 12:08:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-11-16 12:08:15,863 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-11-16 12:08:15,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:08:15,863 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-11-16 12:08:15,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-16 12:08:15,864 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-11-16 12:08:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 12:08:15,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:08:15,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:08:15,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:16,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:16,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:08:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:08:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-11-16 12:08:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:08:16,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879000771] [2022-11-16 12:08:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:08:16,086 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:08:16,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [750425196] [2022-11-16 12:08:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:16,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:16,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:08:16,095 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:08:16,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 12:08:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:08:16,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-16 12:08:16,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:16,211 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-16 12:08:16,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:08:16,242 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-16 12:08:16,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:08:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879000771] [2022-11-16 12:08:16,243 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:08:16,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750425196] [2022-11-16 12:08:16,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750425196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:08:16,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:08:16,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-16 12:08:16,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575380697] [2022-11-16 12:08:16,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:08:16,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:08:16,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:08:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:08:16,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:08:16,246 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-16 12:08:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:08:16,323 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-16 12:08:16,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:08:16,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 12 [2022-11-16 12:08:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:08:16,324 INFO L225 Difference]: With dead ends: 36 [2022-11-16 12:08:16,325 INFO L226 Difference]: Without dead ends: 31 [2022-11-16 12:08:16,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:08:16,326 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:08:16,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:08:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-16 12:08:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-16 12:08:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 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-11-16 12:08:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-11-16 12:08:16,333 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-11-16 12:08:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:08:16,333 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-11-16 12:08:16,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-16 12:08:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-11-16 12:08:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-16 12:08:16,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:08:16,335 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:08:16,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 12:08:16,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:16,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:08:16,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:08:16,542 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-11-16 12:08:16,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:08:16,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435668821] [2022-11-16 12:08:16,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:08:16,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:08:16,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:08:16,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966226183] [2022-11-16 12:08:16,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 12:08:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:08:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:08:16,568 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:08:16,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 12:08:26,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 12:08:26,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:08:26,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-16 12:08:26,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:08:41,772 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:09:22,963 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 12:09:39,821 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256) 0) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 12:10:00,608 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (= .cse0 |c_ULTIMATE.start_gcd_test_#res#1|) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-16 12:10:20,955 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from false [2022-11-16 12:10:22,959 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256))) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| .cse0) 256) 0) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (not (= .cse0 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) is different from true [2022-11-16 12:10:39,839 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-16 12:10:39,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:14:40,731 WARN L233 SmtUtils]: Spent 2.97m on a formula simplification that was a NOOP. DAG size: 114 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:16:03,553 WARN L233 SmtUtils]: Spent 55.72s on a formula simplification. DAG size of input: 67 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:16:27,748 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:16:44,469 WARN L855 $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 ((.cse1 (<= .cse2 127))) (and (let ((.cse0 (mod (+ .cse2 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (- 256) (mod (+ .cse0 (* |c_ULTIMATE.start_main1_~y~0#1| 255)) 256))) 256) 0)) .cse1 (= .cse0 0))) (let ((.cse3 (mod (mod .cse2 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not .cse1) (not (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse3) 256) 0)) (= .cse3 0)))))) (not (< 0 |c_ULTIMATE.start_main1_~y~0#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from true [2022-11-16 12:17:33,881 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main1_~y~0#1_6| Int) (|v_ULTIMATE.start_main1_~x~0#1_5| Int)) (let ((.cse0 (mod (mod (mod (* 255 |v_ULTIMATE.start_main1_~x~0#1_5|) 256) |v_ULTIMATE.start_main1_~y~0#1_6|) 256))) (or (= .cse0 0) (not (= 0 (mod |v_ULTIMATE.start_main1_~x~0#1_5| |v_ULTIMATE.start_main1_~y~0#1_6|))) (<= 0 |v_ULTIMATE.start_main1_~x~0#1_5|) (not (= (mod (mod |v_ULTIMATE.start_main1_~y~0#1_6| .cse0) 256) 0)) (< (+ 128 |v_ULTIMATE.start_main1_~x~0#1_5|) 0) (<= |v_ULTIMATE.start_main1_~y~0#1_6| 0)))) is different from true [2022-11-16 12:17:53,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:17:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:53,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435668821] [2022-11-16 12:17:53,265 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-16 12:17:53,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966226183] [2022-11-16 12:17:53,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966226183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 12:17:53,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:17:53,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2022-11-16 12:17:53,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853086627] [2022-11-16 12:17:53,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:17:53,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 12:17:53,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:53,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 12:17:53,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=119, Unknown=18, NotChecked=162, Total=342 [2022-11-16 12:17:53,268 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-16 12:18:58,802 WARN L233 SmtUtils]: Spent 56.36s on a formula simplification. DAG size of input: 45 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:19:53,604 WARN L233 SmtUtils]: Spent 44.88s on a formula simplification. DAG size of input: 52 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:19:55,647 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-11-16 12:19:58,417 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-11-16 12:22:15,118 WARN L233 SmtUtils]: Spent 2.08m on a formula simplification. DAG size of input: 142 DAG size of output: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:22:17,135 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse30 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse31 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse31) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from false [2022-11-16 12:22:19,142 WARN L855 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_gcd_test_~b#1| 127) (or (let ((.cse27 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse28 (mod (+ .cse27 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse29 (mod (+ .cse27 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (let ((.cse9 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse13 (<= .cse29 127)) (.cse23 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse28) 256) 0))) (.cse8 (not .cse18)) (.cse25 (= .cse28 0)) (.cse2 (<= .cse28 127)) (.cse17 (mod .cse27 256))) (let ((.cse19 (<= .cse17 127)) (.cse12 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse29)) 256) 0))) (.cse3 (not .cse2)) (.cse15 (or .cse23 .cse8 .cse25)) (.cse6 (= .cse29 0)) (.cse7 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse29) 256) 0))) (.cse10 (not .cse13)) (.cse14 (not .cse9)) (.cse16 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse28)) 256) 0)))) (and (or (let ((.cse5 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse17)) 256) 0)) .cse18))) (let ((.cse1 (or .cse14 (and (or .cse16 .cse8) .cse5))) (.cse4 (or .cse14 (and .cse5 .cse15)))) (and (or (let ((.cse0 (or (and .cse5 (or .cse6 .cse7 .cse8)) .cse9))) (and (or (and .cse0 .cse1) .cse2) (or .cse3 (and .cse4 .cse0)))) .cse10) (or (let ((.cse11 (or .cse9 (and (or .cse12 .cse8) .cse5)))) (and (or (and .cse1 .cse11) .cse2) (or (and .cse4 .cse11) .cse3))) .cse13)))) .cse19) (or (not .cse19) (let ((.cse22 (or .cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256) 0)) (= .cse17 0))) (.cse24 (= .cse27 0))) (let ((.cse21 (or .cse14 (and .cse22 (or .cse24 .cse16 .cse8))))) (and (or (let ((.cse20 (or (and (or .cse24 .cse12 .cse8) .cse22) .cse9))) (and (or .cse2 (and .cse20 .cse21)) (or (and (or .cse14 (and .cse22 (or .cse23 .cse24 .cse8 .cse25))) .cse20) .cse3))) .cse13) (or (let ((.cse26 (or .cse9 (and .cse22 (or .cse24 .cse6 .cse7 .cse8))))) (and (or .cse3 (and (or .cse14 (and .cse22 .cse15)) .cse26)) (or (and .cse26 .cse21) .cse2))) .cse10)))))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (< 0 |c_ULTIMATE.start_gcd_test_~b#1|) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse30 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse30 127) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse30) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse31 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (not (<= .cse31 127)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~b#1|) 0) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse31) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) is different from true [2022-11-16 12:22:21,164 WARN L833 $PredicateComparison]: unable to prove that (and (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_gcd_test_~a#1| 127) (or (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (and (<= .cse0 127) (= (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_gcd_test_~a#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse2 (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256))) (let ((.cse1 (mod (+ (- 256) .cse2) |c_ULTIMATE.start_gcd_test_~a#1|))) (and (= .cse1 0) (not (<= .cse2 127)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod .cse1 256)) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0)))))) (< 0 |c_ULTIMATE.start_gcd_test_~a#1|)) is different from false [2022-11-16 12:22:23,576 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (<= 0 (+ 128 |c_ULTIMATE.start_main1_~x~0#1|)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from true [2022-11-16 12:22:25,583 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_gcd_test_~b#1| 0)) (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int) (|v_ULTIMATE.start_gcd_test_~a#1_14| Int)) (and (< 0 |v_ULTIMATE.start_gcd_test_~a#1_14|) (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_12|)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |v_ULTIMATE.start_gcd_test_~a#1_14|) 0) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_14| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_12|) 256) |v_ULTIMATE.start_gcd_test_~a#1_14|) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0))) (not (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false [2022-11-16 12:22:31,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from false [2022-11-16 12:22:33,718 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (not (<= |c_ULTIMATE.start_gcd_test_~a#1| 127)) (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)))) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from true [2022-11-16 12:22:36,719 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from false [2022-11-16 12:22:38,730 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse29 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (< |c_ULTIMATE.start_gcd_test_~a#1| 0)) (.cse19 (mod .cse29 256))) (let ((.cse0 (= .cse19 0)) (.cse32 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse11 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse10 (not .cse20)) (.cse1 (= |c_ULTIMATE.start_gcd_test_~b#1| 0))) (and (or (not (<= 0 (+ |c_ULTIMATE.start_gcd_test_~b#1| 128))) (not .cse0) (not (<= |c_ULTIMATE.start_gcd_test_~b#1| 127)) .cse1) (or (let ((.cse30 (mod (+ .cse29 |c_ULTIMATE.start_gcd_test_~b#1|) 256)) (.cse31 (mod (+ .cse29 .cse32) 256))) (let ((.cse15 (<= .cse31 127)) (.cse25 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse30) 256) 0))) (.cse27 (= .cse30 0)) (.cse4 (<= .cse30 127))) (let ((.cse21 (<= .cse19 127)) (.cse14 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse31)) 256) 0))) (.cse5 (not .cse4)) (.cse17 (or .cse25 .cse10 .cse27)) (.cse8 (= .cse31 0)) (.cse9 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse31) 256) 0))) (.cse12 (not .cse15)) (.cse16 (not .cse11)) (.cse18 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse30)) 256) 0)))) (and (or (let ((.cse7 (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) .cse19)) 256) 0)) .cse20))) (let ((.cse3 (or .cse16 (and (or .cse18 .cse10) .cse7))) (.cse6 (or .cse16 (and .cse7 .cse17)))) (and (or (let ((.cse2 (or (and .cse7 (or .cse8 .cse9 .cse10)) .cse11))) (and (or (and .cse2 .cse3) .cse4) (or .cse5 (and .cse6 .cse2)))) .cse12) (or (let ((.cse13 (or .cse11 (and (or .cse14 .cse10) .cse7)))) (and (or (and .cse3 .cse13) .cse4) (or (and .cse6 .cse13) .cse5))) .cse15)))) .cse21) (or (not .cse21) (let ((.cse24 (or .cse20 (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse19) 256) 0)) .cse0)) (.cse26 (= .cse29 0))) (let ((.cse23 (or .cse16 (and .cse24 (or .cse26 .cse18 .cse10))))) (and (or (let ((.cse22 (or (and (or .cse26 .cse14 .cse10) .cse24) .cse11))) (and (or .cse4 (and .cse22 .cse23)) (or (and (or .cse16 (and .cse24 (or .cse25 .cse26 .cse10 .cse27))) .cse22) .cse5))) .cse15) (or (let ((.cse28 (or .cse11 (and .cse24 (or .cse26 .cse8 .cse9 .cse10))))) (and (or .cse5 (and (or .cse16 (and .cse24 .cse17)) .cse28)) (or (and .cse28 .cse23) .cse4))) .cse12))))))))) .cse1) (or (let ((.cse35 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (let ((.cse33 (<= .cse35 127))) (and (let ((.cse34 (mod (mod .cse35 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not .cse33) (= 0 .cse34) (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse34) 256) 0)))) (let ((.cse36 (mod (+ .cse35 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (not (= (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ (- 256) (mod (+ .cse36 .cse32) 256))) 256) 0)) .cse33 (= .cse36 0)))))) .cse11 .cse10 .cse1))))) is different from true [2022-11-16 12:22:38,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:38,740 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-16 12:22:38,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 12:22:38,744 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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 13 [2022-11-16 12:22:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:38,745 INFO L225 Difference]: With dead ends: 44 [2022-11-16 12:22:38,745 INFO L226 Difference]: Without dead ends: 37 [2022-11-16 12:22:38,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 585.0s TimeCoverageRelationStatistics Valid=78, Invalid=204, Unknown=38, NotChecked=492, Total=812 [2022-11-16 12:22:38,749 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 15 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:38,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 222 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 33 Invalid, 2 Unknown, 174 Unchecked, 5.9s Time] [2022-11-16 12:22:38,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-16 12:22:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-11-16 12:22:38,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-11-16 12:22:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-16 12:22:38,759 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 13 [2022-11-16 12:22:38,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:38,759 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-16 12:22:38,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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-16 12:22:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-16 12:22:38,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 12:22:38,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:38,760 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:22:38,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-16 12:22:38,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:38,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 12:22:38,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:38,968 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2022-11-16 12:22:38,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:38,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477569147] [2022-11-16 12:22:38,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:38,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:38,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-16 12:22:38,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625635993] [2022-11-16 12:22:38,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 12:22:38,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:22:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:22:38,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:22:39,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1472a9ab-da22-46de-b781-bdfdfcef8677/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 12:22:55,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 12:22:55,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 12:22:55,025 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-16 12:22:55,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:23:16,379 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification. DAG size of input: 38 DAG size of output: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 12:23:30,111 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_19| Int)) (and (<= 0 (+ 128 |v_ULTIMATE.start_gcd_test_~a#1_19|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* 255 |v_ULTIMATE.start_gcd_test_~a#1_19|) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (= (mod |v_ULTIMATE.start_gcd_test_~a#1_19| |c_ULTIMATE.start_main1_~y~0#1|) 0) (< |v_ULTIMATE.start_gcd_test_~a#1_19| 0))) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (= (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256) |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (not (= |c_ULTIMATE.start_gcd_test_~a#1| 0))) is different from false