./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 9a3e0b52eabe0a038e4774a376f7ed1eb95ce84c8d3569b2d9d7df15f27e8bd7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 19:08:44,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 19:08:44,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 19:08:44,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 19:08:44,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 19:08:44,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 19:08:44,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 19:08:44,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 19:08:44,412 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 19:08:44,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 19:08:44,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 19:08:44,416 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 19:08:44,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 19:08:44,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 19:08:44,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 19:08:44,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 19:08:44,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 19:08:44,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 19:08:44,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 19:08:44,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 19:08:44,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 19:08:44,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 19:08:44,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 19:08:44,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 19:08:44,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 19:08:44,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 19:08:44,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 19:08:44,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 19:08:44,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 19:08:44,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 19:08:44,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 19:08:44,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 19:08:44,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 19:08:44,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 19:08:44,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 19:08:44,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 19:08:44,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 19:08:44,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 19:08:44,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 19:08:44,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 19:08:44,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 19:08:44,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 19:08:44,473 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 19:08:44,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 19:08:44,475 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 19:08:44,475 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 19:08:44,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 19:08:44,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 19:08:44,476 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 19:08:44,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 19:08:44,476 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 19:08:44,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 19:08:44,477 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 19:08:44,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 19:08:44,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 19:08:44,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 19:08:44,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 19:08:44,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 19:08:44,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 19:08:44,478 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 19:08:44,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 19:08:44,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 19:08:44,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 19:08:44,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 19:08:44,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 19:08:44,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 19:08:44,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:08:44,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 19:08:44,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 19:08:44,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 19:08:44,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 19:08:44,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 19:08:44,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 19:08:44,480 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 19:08:44,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 19:08:44,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 19:08:44,481 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 9a3e0b52eabe0a038e4774a376f7ed1eb95ce84c8d3569b2d9d7df15f27e8bd7 [2021-12-17 19:08:44,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 19:08:44,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 19:08:44,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 19:08:44,682 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 19:08:44,683 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 19:08:44,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_2_3.i [2021-12-17 19:08:44,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acc2c457/1037e363fa36430e8d8cb40cea030b0c/FLAG454a0ba13 [2021-12-17 19:08:45,060 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 19:08:45,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i [2021-12-17 19:08:45,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acc2c457/1037e363fa36430e8d8cb40cea030b0c/FLAG454a0ba13 [2021-12-17 19:08:45,470 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7acc2c457/1037e363fa36430e8d8cb40cea030b0c [2021-12-17 19:08:45,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 19:08:45,473 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 19:08:45,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 19:08:45,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 19:08:45,481 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 19:08:45,481 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae0daae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45, skipping insertion in model container [2021-12-17 19:08:45,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 19:08:45,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 19:08:45,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[1226,1239] [2021-12-17 19:08:45,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[2807,2820] [2021-12-17 19:08:45,623 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:08:45,628 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 19:08:45,635 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[1226,1239] [2021-12-17 19:08:45,641 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_3.i[2807,2820] [2021-12-17 19:08:45,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:08:45,650 INFO L208 MainTranslator]: Completed translation [2021-12-17 19:08:45,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45 WrapperNode [2021-12-17 19:08:45,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 19:08:45,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 19:08:45,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 19:08:45,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 19:08:45,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,672 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2021-12-17 19:08:45,673 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 19:08:45,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 19:08:45,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 19:08:45,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 19:08:45,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 19:08:45,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 19:08:45,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 19:08:45,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 19:08:45,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (1/1) ... [2021-12-17 19:08:45,697 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:08:45,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:08:45,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 19:08:45,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 19:08:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 19:08:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2021-12-17 19:08:45,739 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2021-12-17 19:08:45,739 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-12-17 19:08:45,740 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-12-17 19:08:45,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 19:08:45,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 19:08:45,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 19:08:45,786 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 19:08:45,788 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 19:08:45,951 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 19:08:45,957 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 19:08:45,957 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 19:08:45,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:08:45 BoogieIcfgContainer [2021-12-17 19:08:45,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 19:08:45,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 19:08:45,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 19:08:45,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 19:08:45,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:08:45" (1/3) ... [2021-12-17 19:08:45,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f50ed17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:08:45, skipping insertion in model container [2021-12-17 19:08:45,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:08:45" (2/3) ... [2021-12-17 19:08:45,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f50ed17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:08:45, skipping insertion in model container [2021-12-17 19:08:45,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:08:45" (3/3) ... [2021-12-17 19:08:45,965 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_3.i [2021-12-17 19:08:45,969 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 19:08:45,969 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 19:08:45,997 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 19:08:46,001 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 19:08:46,001 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 19:08:46,022 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) [2021-12-17 19:08:46,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:08:46,025 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:08:46,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:08:46,026 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:08:46,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:08:46,033 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2021-12-17 19:08:46,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:08:46,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393414651] [2021-12-17 19:08:46,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:46,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:08:46,090 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:08:46,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [123271335] [2021-12-17 19:08:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:46,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:08:46,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:08:46,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:08:46,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 19:08:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:08:46,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 19:08:46,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:08:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:08:46,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:08:46,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:08:46,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393414651] [2021-12-17 19:08:46,189 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:08:46,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123271335] [2021-12-17 19:08:46,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123271335] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:08:46,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:08:46,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 19:08:46,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252428665] [2021-12-17 19:08:46,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:08:46,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 19:08:46,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:08:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 19:08:46,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 19:08:46,214 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) [2021-12-17 19:08:46,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:08:46,227 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2021-12-17 19:08:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 19:08:46,240 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 [2021-12-17 19:08:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:08:46,245 INFO L225 Difference]: With dead ends: 66 [2021-12-17 19:08:46,245 INFO L226 Difference]: Without dead ends: 29 [2021-12-17 19:08:46,248 INFO L932 BasicCegarLoop]: 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 [2021-12-17 19:08:46,252 INFO L933 BasicCegarLoop]: 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 [2021-12-17 19:08:46,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:08:46,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-17 19:08:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-17 19:08:46,288 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) [2021-12-17 19:08:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-12-17 19:08:46,291 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2021-12-17 19:08:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:08:46,291 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-12-17 19:08:46,292 INFO L471 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) [2021-12-17 19:08:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-12-17 19:08:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:08:46,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:08:46,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:08:46,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 19:08:46,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-17 19:08:46,502 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:08:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:08:46,503 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2021-12-17 19:08:46,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:08:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231853820] [2021-12-17 19:08:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:46,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:08:46,512 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:08:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1287681708] [2021-12-17 19:08:46,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:46,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:08:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:08:46,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:08:46,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 19:08:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:08:46,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 19:08:46,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:08:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:08:46,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:08:46,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:08:46,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231853820] [2021-12-17 19:08:46,618 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:08:46,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287681708] [2021-12-17 19:08:46,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287681708] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:08:46,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:08:46,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 19:08:46,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374335908] [2021-12-17 19:08:46,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:08:46,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:08:46,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:08:46,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:08:46,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 19:08:46,624 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) [2021-12-17 19:08:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:08:46,643 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2021-12-17 19:08:46,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:08:46,644 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 [2021-12-17 19:08:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:08:46,644 INFO L225 Difference]: With dead ends: 36 [2021-12-17 19:08:46,645 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 19:08:46,645 INFO L932 BasicCegarLoop]: 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 [2021-12-17 19:08:46,647 INFO L933 BasicCegarLoop]: 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 [2021-12-17 19:08:46,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:08:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 19:08:46,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-12-17 19:08:46,654 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) [2021-12-17 19:08:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2021-12-17 19:08:46,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2021-12-17 19:08:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:08:46,655 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2021-12-17 19:08:46,656 INFO L471 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) [2021-12-17 19:08:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2021-12-17 19:08:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 19:08:46,657 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:08:46,657 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:08:46,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 19:08:46,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-17 19:08:46,876 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:08:46,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:08:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2021-12-17 19:08:46,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:08:46,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291298580] [2021-12-17 19:08:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:46,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:08:46,883 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:08:46,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055894675] [2021-12-17 19:08:46,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:46,884 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:08:46,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:08:46,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:08:46,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 19:08:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:08:46,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 19:08:46,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:08:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:08:46,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:08:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:08:47,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:08:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291298580] [2021-12-17 19:08:47,003 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:08:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055894675] [2021-12-17 19:08:47,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055894675] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:08:47,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:08:47,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-17 19:08:47,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930244125] [2021-12-17 19:08:47,004 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:08:47,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:08:47,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:08:47,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:08:47,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:08:47,005 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-17 19:08:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:08:47,042 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2021-12-17 19:08:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:08:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 [2021-12-17 19:08:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:08:47,044 INFO L225 Difference]: With dead ends: 36 [2021-12-17 19:08:47,044 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 19:08:47,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-17 19:08:47,045 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:08:47,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:08:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 19:08:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-12-17 19:08:47,048 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) [2021-12-17 19:08:47,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2021-12-17 19:08:47,048 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2021-12-17 19:08:47,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:08:47,049 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2021-12-17 19:08:47,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-17 19:08:47,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2021-12-17 19:08:47,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 19:08:47,049 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:08:47,049 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:08:47,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 19:08:47,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:08:47,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:08:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:08:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2021-12-17 19:08:47,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:08:47,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595852250] [2021-12-17 19:08:47,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:08:47,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:08:47,270 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:08:47,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805828724] [2021-12-17 19:08:47,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 19:08:47,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:08:47,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:08:47,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:08:47,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 19:08:52,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 19:08:52,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:08:52,129 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-17 19:08:52,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:09:44,591 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:09:55,050 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:10:13,309 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256))) (and (not (= 0 .cse0)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256)) (= |c_ULTIMATE.start_gcd_test_#res#1| .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from false [2021-12-17 19:11:32,887 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main1_~y~0#1| Int) (|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |ULTIMATE.start_main1_~y~0#1|) 256))) (and (< 0 |ULTIMATE.start_main1_~y~0#1|) (not (= 0 .cse0)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (= 0 (mod (mod |ULTIMATE.start_main1_~y~0#1| .cse0) 256)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |ULTIMATE.start_main1_~y~0#1|))))) (<= 0 |c_ULTIMATE.start___VERIFIER_assert_~cond#1|)) is different from false [2021-12-17 19:11:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 19:11:38,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:11:57,767 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse3 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse4 (mod .cse9 256))) (and (or (let ((.cse0 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse4 (- 256))) 256)))) (.cse2 (= .cse4 .cse5))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse2))) (<= .cse4 127)) (or (< 127 .cse4) (let ((.cse6 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256)))) (.cse7 (= 0 .cse4)) (.cse8 (= .cse4 |c_ULTIMATE.start_main1_~y~0#1|))) (and (or .cse3 .cse6 .cse7 .cse8) (or .cse6 .cse7 .cse1 .cse8))))))) (or (= 0 .cse9) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse17 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (let ((.cse12 (or .cse3 (= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256))) (= 0 .cse17))) (.cse10 (< 127 .cse17)) (.cse13 (<= .cse17 127)) (.cse14 (or .cse3 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse17 (- 256))) 256))) (= .cse17 .cse5))) (.cse15 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse9) 256))) (and (or (let ((.cse11 (or (= .cse15 .cse5) .cse1 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse15 (- 256))) 256)))))) (and (or .cse10 (and .cse11 .cse12)) (or .cse13 (and .cse14 .cse11)))) (<= .cse15 127)) (or (let ((.cse16 (or (= 0 .cse15) (= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) .cse1 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256)))))) (and (or (and .cse16 .cse12) .cse10) (or .cse13 (and .cse14 .cse16)))) (< 127 .cse15)))))))) is different from true [2021-12-17 19:12:16,805 WARN L227 SmtUtils]: Spent 12.43s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:13:30,108 WARN L227 SmtUtils]: Spent 23.77s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:13:38,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-17 19:13:38,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:13:38,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595852250] [2021-12-17 19:13:38,792 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:13:38,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805828724] [2021-12-17 19:13:38,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805828724] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:13:38,792 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:13:38,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2021-12-17 19:13:38,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339147783] [2021-12-17 19:13:38,793 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:13:38,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-17 19:13:38,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:13:38,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-17 19:13:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=143, Unknown=14, NotChecked=140, Total=342 [2021-12-17 19:13:38,794 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2021-12-17 19:14:33,846 WARN L227 SmtUtils]: Spent 50.25s on a formula simplification. DAG size of input: 44 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:14:36,111 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (and (or (let ((.cse4 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse2 (mod (+ .cse4 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (let ((.cse0 (mod (+ .cse2 .cse3) 256))) (and (or (= 0 .cse0) (< 127 .cse0) (= .cse0 |c_ULTIMATE.start_main1_~y~0#1|)) (or (= .cse0 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse0 (- 256))) 256))) (<= .cse0 127)))) (= 0 .cse2) (<= .cse4 127))) (or (< 127 .cse4) (let ((.cse5 (mod (mod .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (and (or (< 127 .cse5) (= 0 .cse5) (= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256)))) (or (<= .cse5 127) (= .cse5 .cse1))))))) .cse6 .cse7) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (or (= 0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|)) .cse6) (or (let ((.cse9 (mod (* |c_ULTIMATE.start_main1_~x~0#1| 255) 256))) (and (let ((.cse8 (mod (mod .cse9 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256))) (< 127 .cse9) (= 0 .cse8))) (let ((.cse10 (mod (+ .cse9 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (<= .cse9 127) (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse10) 256) (- 256))) 256))) (= 0 .cse10))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 0) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|)))) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or .cse7 (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse11) .cse6 (let ((.cse12 (mod (+ .cse3 .cse11) 256))) (and (or (= .cse12 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse12 (- 256))) 256))) (<= .cse12 127)) (or (= 0 .cse12) (= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (< 127 .cse12))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse13 (mod .cse11 256))) (and (or (< 127 .cse13) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256))) (= 0 .cse13) (= .cse13 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse13 (- 256))) 256))) (<= .cse13 127) (= .cse13 .cse1)))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|))) is different from false [2021-12-17 19:14:38,116 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse6 (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (.cse3 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) (.cse1 (+ |c_ULTIMATE.start_main1_~y~0#1| 256))) (and (or (let ((.cse4 (mod (* |c_ULTIMATE.start_gcd_test_~a#1| 255) 256))) (and (let ((.cse2 (mod (+ .cse4 (- 256)) |c_ULTIMATE.start_gcd_test_~b#1|))) (or (let ((.cse0 (mod (+ .cse2 .cse3) 256))) (and (or (= 0 .cse0) (< 127 .cse0) (= .cse0 |c_ULTIMATE.start_main1_~y~0#1|)) (or (= .cse0 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse0 (- 256))) 256))) (<= .cse0 127)))) (= 0 .cse2) (<= .cse4 127))) (or (< 127 .cse4) (let ((.cse5 (mod (mod .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (and (or (< 127 .cse5) (= 0 .cse5) (= .cse5 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256)))) (or (<= .cse5 127) (= .cse5 .cse1))))))) .cse6 .cse7) (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (or (= 0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|)) .cse6) (or (let ((.cse9 (mod (* |c_ULTIMATE.start_main1_~x~0#1| 255) 256))) (and (let ((.cse8 (mod (mod .cse9 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse8) 256))) (< 127 .cse9) (= 0 .cse8))) (let ((.cse10 (mod (+ .cse9 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (<= .cse9 127) (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse10) 256) (- 256))) 256))) (= 0 .cse10))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 0) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod |c_ULTIMATE.start_main1_~x~0#1| |c_ULTIMATE.start_main1_~y~0#1|)))) (<= |c_ULTIMATE.start_gcd_test_~a#1| 127) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (<= |c_ULTIMATE.start_main1_~x~0#1| 127) (or .cse7 (let ((.cse11 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse11) .cse6 (let ((.cse12 (mod (+ .cse3 .cse11) 256))) (and (or (= .cse12 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse12 (- 256))) 256))) (<= .cse12 127)) (or (= 0 .cse12) (= .cse12 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (< 127 .cse12))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse13 (mod .cse11 256))) (and (or (< 127 .cse13) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse13) 256))) (= 0 .cse13) (= .cse13 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse13 (- 256))) 256))) (<= .cse13 127) (= .cse13 .cse1)))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2021-12-17 19:14:40,121 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (or (< |c_ULTIMATE.start_gcd_test_~b#1| 0) (let ((.cse2 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse1 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (= .cse1 .cse2) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse1 (- 256))) 256))) (<= .cse1 127)) (or (= 0 .cse1) (= .cse1 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256))) (< 127 .cse1))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse3 (mod .cse0 256))) (and (or (< 127 .cse3) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (= 0 .cse3) (= .cse3 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse3 (- 256))) 256))) (<= .cse3 127) (= .cse3 .cse2)))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (let ((.cse4 (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256))) (or (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse4) (< 127 .cse4)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse4) (<= .cse4 127)))) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|))))) is different from false [2021-12-17 19:14:42,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (+ |c_ULTIMATE.start_main1_~y~0#1| 256)) (.cse3 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse9 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse4 (mod .cse9 256))) (and (or (let ((.cse0 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse4 (- 256))) 256)))) (.cse2 (= .cse4 .cse5))) (and (or .cse0 .cse1 .cse2) (or .cse0 .cse3 .cse2))) (<= .cse4 127)) (or (< 127 .cse4) (let ((.cse6 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse4) 256)))) (.cse7 (= 0 .cse4)) (.cse8 (= .cse4 |c_ULTIMATE.start_main1_~y~0#1|))) (and (or .cse3 .cse6 .cse7 .cse8) (or .cse6 .cse7 .cse1 .cse8))))))) (or (= 0 .cse9) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse17 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (let ((.cse12 (or .cse3 (= .cse17 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse17) 256))) (= 0 .cse17))) (.cse10 (< 127 .cse17)) (.cse13 (<= .cse17 127)) (.cse14 (or .cse3 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse17 (- 256))) 256))) (= .cse17 .cse5))) (.cse15 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse9) 256))) (and (or (let ((.cse11 (or (= .cse15 .cse5) .cse1 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse15 (- 256))) 256)))))) (and (or .cse10 (and .cse11 .cse12)) (or .cse13 (and .cse14 .cse11)))) (<= .cse15 127)) (or (let ((.cse16 (or (= 0 .cse15) (= .cse15 |c_ULTIMATE.start_main1_~y~0#1|) .cse1 (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15) 256)))))) (and (or (and .cse16 .cse12) .cse10) (or .cse13 (and .cse14 .cse16)))) (< 127 .cse15)))))) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (let ((.cse18 (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256))) (or (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) .cse18) (< 127 .cse18)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| .cse18) (<= .cse18 127)))) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))))) is different from false [2021-12-17 19:15:23,406 WARN L227 SmtUtils]: Spent 35.36s on a formula simplification. DAG size of input: 43 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:15:25,410 WARN L838 $PredicateComparison]: unable to prove that (and (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (or (= |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|) (< 127 |c_ULTIMATE.start_gcd_test_~a#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (< (+ |c_ULTIMATE.start_gcd_test_~a#1| 128) 0)) (<= |c_ULTIMATE.start_main1_~y~0#1| 127) (exists ((|v_ULTIMATE.start_gcd_test_~a#1_12| Int)) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_12| 255) 256) |c_ULTIMATE.start_main1_~y~0#1|) 256)) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_12| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_12| 0) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_12| |c_ULTIMATE.start_main1_~y~0#1|)))) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |c_ULTIMATE.start_main1_~y~0#1| |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:15:27,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 19:15:27,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:15:27,437 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2021-12-17 19:15:27,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 19:15:27,437 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 [2021-12-17 19:15:27,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:15:27,438 INFO L225 Difference]: With dead ends: 40 [2021-12-17 19:15:27,438 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 19:15:27,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 192.4s TimeCoverageRelationStatistics Valid=64, Invalid=191, Unknown=21, NotChecked=324, Total=600 [2021-12-17 19:15:27,439 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-17 19:15:27,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 352 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 55 Unchecked, 2.8s Time] [2021-12-17 19:15:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 19:15:27,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2021-12-17 19:15:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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) [2021-12-17 19:15:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-12-17 19:15:27,442 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 13 [2021-12-17 19:15:27,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:15:27,442 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-12-17 19:15:27,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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) [2021-12-17 19:15:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-12-17 19:15:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 19:15:27,442 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:15:27,442 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:15:27,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 19:15:27,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:15:27,650 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:15:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:15:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash 403427572, now seen corresponding path program 1 times [2021-12-17 19:15:27,650 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:15:27,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370396436] [2021-12-17 19:15:27,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:15:27,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:15:27,655 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:15:27,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272487849] [2021-12-17 19:15:27,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:15:27,656 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:15:27,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:15:27,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:15:27,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 19:15:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:15:27,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-17 19:15:27,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:15:27,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:15:27,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:16:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 19:16:36,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:16:36,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370396436] [2021-12-17 19:16:36,106 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:16:36,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272487849] [2021-12-17 19:16:36,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272487849] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:16:36,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:16:36,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2021-12-17 19:16:36,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464869997] [2021-12-17 19:16:36,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:16:36,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 19:16:36,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:16:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 19:16:36,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-17 19:16:36,107 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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) [2021-12-17 19:16:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:16:36,456 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2021-12-17 19:16:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-17 19:16:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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 [2021-12-17 19:16:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:16:36,458 INFO L225 Difference]: With dead ends: 41 [2021-12-17 19:16:36,458 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 19:16:36,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-12-17 19:16:36,458 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-17 19:16:36,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 203 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 9 Unchecked, 0.3s Time] [2021-12-17 19:16:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 19:16:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-17 19:16:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 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) [2021-12-17 19:16:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2021-12-17 19:16:36,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 13 [2021-12-17 19:16:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:16:36,463 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2021-12-17 19:16:36,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 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) [2021-12-17 19:16:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2021-12-17 19:16:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 19:16:36,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:16:36,464 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:16:36,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-17 19:16:36,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:16:36,679 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:16:36,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:16:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2021-12-17 19:16:36,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:16:36,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937165960] [2021-12-17 19:16:36,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:16:36,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:16:36,684 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:16:36,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514409942] [2021-12-17 19:16:36,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 19:16:36,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:16:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:16:36,686 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 19:16:36,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 19:16:54,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 19:16:54,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:16:54,010 WARN L261 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-17 19:16:54,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:18:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-17 19:18:36,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:20:38,432 WARN L227 SmtUtils]: Spent 1.72m on a formula simplification. DAG size of input: 85 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 19:22:06,536 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse13 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse12 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse1 (<= .cse12 127)) (.cse3 (let ((.cse15 (+ .cse12 (- 256)))) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15))) (or .cse13 (not (= 0 (mod (mod .cse15 (+ (mod (+ .cse16 .cse12) 256) (- 256))) 256))) (= 0 .cse16))))) (.cse4 (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12))) (or .cse13 (not (= 0 (mod (mod .cse12 (+ (mod (+ (* .cse12 255) .cse14) 256) (- 256))) 256))) (= 0 .cse14) (= 0 .cse12)))) (.cse5 (< 127 .cse12)) (.cse9 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse2 (let ((.cse7 (+ .cse9 (- 256)))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256))) (or (= 0 .cse6) (not (= 0 (mod (mod .cse7 .cse6) 256))) .cse8))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse2 .cse4) .cse5))) (<= .cse9 127)) (or (let ((.cse10 (let ((.cse11 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (or (= 0 .cse9) (= 0 .cse11) (not (= 0 (mod (mod .cse9 .cse11) 256))) .cse8)))) (and (or .cse1 (and .cse10 .cse3)) (or (and .cse4 .cse10) .cse5))) (< 127 .cse9)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse20 (mod .cse0 256))) (and (or (let ((.cse18 (+ .cse20 (- 256)))) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18))) (and (let ((.cse17 (mod .cse19 256))) (or .cse8 (= 0 .cse17) (not (= 0 (mod (mod .cse18 .cse17) 256))))) (or .cse13 (= 0 .cse19) (not (= 0 (mod (mod .cse18 (+ (mod (+ .cse20 .cse19) 256) (- 256))) 256))))))) (<= .cse20 127)) (or (< 127 .cse20) (let ((.cse22 (= 0 .cse20)) (.cse21 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20))) (and (or (= 0 .cse21) .cse13 .cse22 (not (= 0 (mod (mod .cse20 (+ (mod (+ (* .cse20 255) .cse21) 256) (- 256))) 256)))) (let ((.cse23 (mod .cse21 256))) (or (= 0 .cse23) (not (= 0 (mod (mod .cse20 .cse23) 256))) .cse22 .cse8)))))))))) is different from false [2021-12-17 19:22:08,544 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse13 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse12 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse1 (<= .cse12 127)) (.cse3 (let ((.cse15 (+ .cse12 (- 256)))) (let ((.cse16 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse15))) (or .cse13 (not (= 0 (mod (mod .cse15 (+ (mod (+ .cse16 .cse12) 256) (- 256))) 256))) (= 0 .cse16))))) (.cse4 (let ((.cse14 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12))) (or .cse13 (not (= 0 (mod (mod .cse12 (+ (mod (+ (* .cse12 255) .cse14) 256) (- 256))) 256))) (= 0 .cse14) (= 0 .cse12)))) (.cse5 (< 127 .cse12)) (.cse9 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse2 (let ((.cse7 (+ .cse9 (- 256)))) (let ((.cse6 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256))) (or (= 0 .cse6) (not (= 0 (mod (mod .cse7 .cse6) 256))) .cse8))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse2 .cse4) .cse5))) (<= .cse9 127)) (or (let ((.cse10 (let ((.cse11 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (or (= 0 .cse9) (= 0 .cse11) (not (= 0 (mod (mod .cse9 .cse11) 256))) .cse8)))) (and (or .cse1 (and .cse10 .cse3)) (or (and .cse4 .cse10) .cse5))) (< 127 .cse9)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse20 (mod .cse0 256))) (and (or (let ((.cse18 (+ .cse20 (- 256)))) (let ((.cse19 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse18))) (and (let ((.cse17 (mod .cse19 256))) (or .cse8 (= 0 .cse17) (not (= 0 (mod (mod .cse18 .cse17) 256))))) (or .cse13 (= 0 .cse19) (not (= 0 (mod (mod .cse18 (+ (mod (+ .cse20 .cse19) 256) (- 256))) 256))))))) (<= .cse20 127)) (or (< 127 .cse20) (let ((.cse22 (= 0 .cse20)) (.cse21 (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse20))) (and (or (= 0 .cse21) .cse13 .cse22 (not (= 0 (mod (mod .cse20 (+ (mod (+ (* .cse20 255) .cse21) 256) (- 256))) 256)))) (let ((.cse23 (mod .cse21 256))) (or (= 0 .cse23) (not (= 0 (mod (mod .cse20 .cse23) 256))) .cse22 .cse8)))))))))) is different from true [2021-12-17 19:22:26,662 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse1 (mod .cse4 256))) (and (let ((.cse2 (+ .cse1 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (= 0 .cse0) (<= .cse1 127) (not (= 0 (mod (mod .cse2 .cse0) 256)))))) (let ((.cse3 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256))) (or (= 0 .cse3) (< 127 .cse1) (not (= 0 (mod (mod .cse1 .cse3) 256))) (= 0 .cse1)))))) (or (= 0 .cse4) (let ((.cse7 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (and (let ((.cse6 (+ .cse7 (- 256)))) (let ((.cse5 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse6) 256))) (or (= 0 .cse5) (not (= 0 (mod (mod .cse6 .cse5) 256))) (<= .cse7 127)))) (let ((.cse8 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256))) (or (= 0 .cse7) (= 0 .cse8) (not (= 0 (mod (mod .cse7 .cse8) 256))) (< 127 .cse7))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from false [2021-12-17 19:22:28,667 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse1 (mod .cse4 256))) (and (let ((.cse2 (+ .cse1 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (= 0 .cse0) (<= .cse1 127) (not (= 0 (mod (mod .cse2 .cse0) 256)))))) (let ((.cse3 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256))) (or (= 0 .cse3) (< 127 .cse1) (not (= 0 (mod (mod .cse1 .cse3) 256))) (= 0 .cse1)))))) (or (= 0 .cse4) (let ((.cse7 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (and (let ((.cse6 (+ .cse7 (- 256)))) (let ((.cse5 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse6) 256))) (or (= 0 .cse5) (not (= 0 (mod (mod .cse6 .cse5) 256))) (<= .cse7 127)))) (let ((.cse8 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse7) 256))) (or (= 0 .cse7) (= 0 .cse8) (not (= 0 (mod (mod .cse7 .cse8) 256))) (< 127 .cse7))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)))) (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2021-12-17 19:23:13,044 WARN L227 SmtUtils]: Spent 13.46s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15