./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/gcd_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/bitvector/gcd_2.c -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 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 11:02:03,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:02:03,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:02:03,712 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:02:03,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:02:03,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:02:03,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:02:03,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:02:03,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:02:03,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:02:03,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:02:03,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:02:03,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:02:03,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:02:03,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:02:03,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:02:03,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:02:03,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:02:03,742 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:02:03,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:02:03,751 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:02:03,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:02:03,752 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:02:03,753 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:02:03,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:02:03,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:02:03,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:02:03,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:02:03,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:02:03,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:02:03,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:02:03,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:02:03,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:02:03,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:02:03,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:02:03,763 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:02:03,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:02:03,764 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:02:03,764 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:02:03,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:02:03,765 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:02:03,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:02:03,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 11:02:03,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:02:03,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:02:03,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:02:03,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:02:03,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 11:02:03,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 11:02:03,803 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:02:03,803 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:02:03,803 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:02:03,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:02:03,804 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 11:02:03,805 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:02:03,806 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:02:03,806 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:02:03,806 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 11:02:03,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:02:03,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:02:03,807 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 11:02:03,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:02:03,807 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:02:03,807 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 11:02:03,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 11:02:03,808 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:02:03,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 11:02:03,808 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:02:03,808 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 11:02:03,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 11:02:03,808 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 -> 7da096d64cf3390a2bb7c442378ab6f697dfdf0fd9d4078975ad6171409858bb [2022-07-22 11:02:04,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:02:04,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:02:04,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:02:04,045 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:02:04,046 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:02:04,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_2.c [2022-07-22 11:02:04,118 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a803f94c/ea18c35fe64d4c6981b3e7bacf5d5d2c/FLAGae2b34c43 [2022-07-22 11:02:04,563 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:02:04,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_2.c [2022-07-22 11:02:04,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a803f94c/ea18c35fe64d4c6981b3e7bacf5d5d2c/FLAGae2b34c43 [2022-07-22 11:02:04,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a803f94c/ea18c35fe64d4c6981b3e7bacf5d5d2c [2022-07-22 11:02:04,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:02:04,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 11:02:04,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:02:04,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:02:04,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:02:04,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5ca6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04, skipping insertion in model container [2022-07-22 11:02:04,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:02:04,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:02:04,748 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/bitvector/gcd_2.c[664,677] [2022-07-22 11:02:04,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:02:04,767 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:02:04,776 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/bitvector/gcd_2.c[664,677] [2022-07-22 11:02:04,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:02:04,797 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:02:04,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04 WrapperNode [2022-07-22 11:02:04,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:02:04,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:02:04,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:02:04,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:02:04,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,810 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,826 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2022-07-22 11:02:04,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:02:04,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:02:04,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:02:04,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:02:04,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,860 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:02:04,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:02:04,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:02:04,861 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:02:04,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (1/1) ... [2022-07-22 11:02:04,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 11:02:04,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:02:04,903 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) [2022-07-22 11:02:04,908 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 [2022-07-22 11:02:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:02:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:02:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:02:04,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:02:05,029 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:02:05,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:02:05,157 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:02:05,161 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:02:05,175 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 11:02:05,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:02:05 BoogieIcfgContainer [2022-07-22 11:02:05,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:02:05,178 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 11:02:05,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 11:02:05,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 11:02:05,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 11:02:04" (1/3) ... [2022-07-22 11:02:05,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff4114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:02:05, skipping insertion in model container [2022-07-22 11:02:05,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:02:04" (2/3) ... [2022-07-22 11:02:05,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fff4114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 11:02:05, skipping insertion in model container [2022-07-22 11:02:05,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:02:05" (3/3) ... [2022-07-22 11:02:05,183 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_2.c [2022-07-22 11:02:05,192 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 11:02:05,200 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 11:02:05,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 11:02:05,268 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c9c8c5d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@25f7a289 [2022-07-22 11:02:05,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 11:02:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 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) [2022-07-22 11:02:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 11:02:05,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:05,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:05,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:05,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:05,286 INFO L85 PathProgramCache]: Analyzing trace with hash 777289588, now seen corresponding path program 1 times [2022-07-22 11:02:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:05,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450980744] [2022-07-22 11:02:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:02:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:02:05,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:02:05,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450980744] [2022-07-22 11:02:05,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450980744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:02:05,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:02:05,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:02:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217169728] [2022-07-22 11:02:05,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:02:05,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:02:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:02:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:02:05,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:02:05,490 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 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) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:02:05,548 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-07-22 11:02:05,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 11:02:05,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-22 11:02:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:02:05,555 INFO L225 Difference]: With dead ends: 48 [2022-07-22 11:02:05,555 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 11:02:05,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:02:05,559 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 26 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:02:05,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:02:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 11:02:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 11. [2022-07-22 11:02:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) [2022-07-22 11:02:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-07-22 11:02:05,579 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2022-07-22 11:02:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:02:05,580 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-07-22 11:02:05,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-07-22 11:02:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 11:02:05,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:05,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:05,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 11:02:05,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:05,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1742670346, now seen corresponding path program 1 times [2022-07-22 11:02:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:05,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453353223] [2022-07-22 11:02:05,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:02:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:02:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:02:05,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453353223] [2022-07-22 11:02:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453353223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:02:05,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:02:05,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 11:02:05,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152020947] [2022-07-22 11:02:05,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:02:05,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 11:02:05,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:02:05,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 11:02:05,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 11:02:05,614 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:02:05,628 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-07-22 11:02:05,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 11:02:05,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2022-07-22 11:02:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:02:05,629 INFO L225 Difference]: With dead ends: 18 [2022-07-22 11:02:05,629 INFO L226 Difference]: Without dead ends: 12 [2022-07-22 11:02:05,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 11:02:05,630 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:02:05,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 22 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:02:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-07-22 11:02:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-22 11:02:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-07-22 11:02:05,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2022-07-22 11:02:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:02:05,634 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-22 11:02:05,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-07-22 11:02:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 11:02:05,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:05,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:05,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 11:02:05,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:05,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash -881880042, now seen corresponding path program 1 times [2022-07-22 11:02:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:05,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840808521] [2022-07-22 11:02:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:05,646 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 11:02:05,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842057396] [2022-07-22 11:02:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:02:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:02:05,664 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) [2022-07-22 11:02:05,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 11:02:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:02:05,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 11:02:05,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:02:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:02:05,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:02:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:02:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:02:05,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840808521] [2022-07-22 11:02:05,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 11:02:05,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842057396] [2022-07-22 11:02:05,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842057396] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:02:05,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:02:05,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-22 11:02:05,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391133337] [2022-07-22 11:02:05,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:02:05,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 11:02:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:02:05,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 11:02:05,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 11:02:05,891 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:02:05,951 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-07-22 11:02:05,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 11:02:05,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 11:02:05,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:02:05,953 INFO L225 Difference]: With dead ends: 19 [2022-07-22 11:02:05,953 INFO L226 Difference]: Without dead ends: 13 [2022-07-22 11:02:05,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-07-22 11:02:05,954 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:02:05,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 33 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 11:02:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-22 11:02:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-22 11:02:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-07-22 11:02:05,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-07-22 11:02:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:02:05,957 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-22 11:02:05,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:02:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-07-22 11:02:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 11:02:05,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:02:05,958 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:02:05,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-22 11:02:06,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:02:06,172 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:02:06,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:02:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 32815606, now seen corresponding path program 2 times [2022-07-22 11:02:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:02:06,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322800388] [2022-07-22 11:02:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:02:06,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:02:06,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 11:02:06,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293130153] [2022-07-22 11:02:06,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 11:02:06,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:02:06,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:02:06,195 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) [2022-07-22 11:02:06,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 11:02:06,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 11:02:06,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:02:06,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-22 11:02:06,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:03:51,930 WARN L233 SmtUtils]: Spent 1.71m on a formula simplification. DAG size of input: 73 DAG size of output: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:04:51,228 WARN L233 SmtUtils]: Spent 14.04s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:04:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 11:04:52,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 11:05:04,836 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 0 |c_ULTIMATE.start_main_~y~0#1|)) (let ((.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse3 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse30) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse30 |c_ULTIMATE.start_main_~y~0#1|) (<= (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse30 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (or (not (<= (mod (+ .cse28 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse29) 256) 0)) (<= .cse29 |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|)))) (.cse0 (not .cse6))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse1 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse1 127)) (<= (mod (+ .cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (<= (mod .cse2 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse1) 256) 0))))))) (or .cse0 .cse3) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse4 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse5 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse5 127)) (<= (mod .cse4 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse5) 256) 0))))))) (or .cse6 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (or (not (<= (mod (+ .cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse8) 256) 0)) (<= .cse8 |c_ULTIMATE.start_main_~y~0#1|) (not (<= .cse8 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse10 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse9 127)) (<= .cse9 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse9) 256) 0)) (not (<= (mod .cse10 256) 127)) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse10 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and .cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse12 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (<= .cse13 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse13 127)) (not (<= (mod .cse12 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse13) 256) 0)))))))))) (or .cse3 .cse6) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse15 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse14 |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse15 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse16 127)) (<= .cse16 |c_ULTIMATE.start_main_~y~0#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod .cse17 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse16) 256) 0))))))) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ .cse19 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse18 127)) (<= .cse18 |c_ULTIMATE.start_main_~y~0#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse19 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18) 256) 0)) (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= .cse20 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse20 127)) (<= (mod (+ .cse21 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= (mod .cse21 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse20) 256) 0)) (= .cse21 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse23 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse22) 256) 0)) (<= .cse22 |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse23 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))))) (or (and .cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse25 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse24 127)) (<= .cse24 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse24) 256) 0)) (not (<= (mod .cse25 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse6) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse26 256))) (or (not (<= (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse27) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse27 |c_ULTIMATE.start_main_~y~0#1|) (not (<= .cse27 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))))))) is different from true [2022-07-22 11:05:44,108 WARN L233 SmtUtils]: Spent 30.72s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 11:05:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-22 11:05:45,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:05:45,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322800388] [2022-07-22 11:05:45,719 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-22 11:05:45,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293130153] [2022-07-22 11:05:45,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293130153] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 11:05:45,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 11:05:45,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2022-07-22 11:05:45,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539636004] [2022-07-22 11:05:45,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 11:05:45,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 11:05:45,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 11:05:45,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 11:05:45,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=179, Unknown=19, NotChecked=28, Total=272 [2022-07-22 11:05:45,721 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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) [2022-07-22 11:05:47,767 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (< |c_ULTIMATE.start_gcd_test_~b#1| 0))) (let ((.cse0 (not .cse6))) (and .cse0 (or (not (< 0 |c_ULTIMATE.start_main_~y~0#1|)) (let ((.cse3 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse31 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse30 (mod .cse31 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse30) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse30 |c_ULTIMATE.start_main_~y~0#1|) (<= (mod (+ .cse31 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse30 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse31 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (.cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse28 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse29 (mod .cse28 256))) (or (not (<= (mod (+ .cse28 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse29) 256) 0)) (<= .cse29 |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse28 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (<= .cse29 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))))) (and (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse2 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse1 (mod (+ .cse2 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse1 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse1 127)) (<= (mod (+ .cse2 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (<= (mod .cse2 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse1) 256) 0))))))) (or .cse0 .cse3) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse4 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse5 (mod (+ .cse4 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse4 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse5 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse5 127)) (<= (mod .cse4 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse5) 256) 0))))))) (or .cse6 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse7 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse8 (mod .cse7 256))) (or (not (<= (mod (+ .cse7 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse8) 256) 0)) (<= .cse8 |c_ULTIMATE.start_main_~y~0#1|) (not (<= .cse8 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse7 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse10 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse9 (mod (+ .cse10 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse9 127)) (<= .cse9 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse9) 256) 0)) (not (<= (mod .cse10 256) 127)) (<= (mod (+ .cse10 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127) (= .cse10 0))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|))))) (or .cse0 (and .cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse12 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse13 (mod (+ .cse12 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (not (<= (mod (+ .cse12 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (<= .cse13 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse13 127)) (not (<= (mod .cse12 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse13) 256) 0)))))))))) (or .cse3 .cse6) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse15 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse14 (mod .cse15 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse14) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse14 |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse15 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse15 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse14 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0)))))) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse17 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse16 (mod (+ .cse17 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse16 127)) (<= .cse16 |c_ULTIMATE.start_main_~y~0#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse17 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod .cse17 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse16) 256) 0))))))) (or .cse6 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse19 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse18 (mod (+ .cse19 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse18 127)) (<= .cse18 |c_ULTIMATE.start_main_~y~0#1|) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (<= (mod .cse19 256) 127) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse18) 256) 0)) (<= (mod (+ .cse19 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)))))) (or .cse0 (and (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse21 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse20 (mod (+ .cse21 |c_ULTIMATE.start_gcd_test_~b#1|) 256))) (or (<= .cse20 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= .cse20 127)) (<= (mod (+ .cse21 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= (mod .cse21 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse20) 256) 0)) (= .cse21 0))))))) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse23 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse22 (mod .cse23 256))) (or (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse22) 256) 0)) (<= .cse22 |c_ULTIMATE.start_main_~y~0#1|) (not (<= (mod (+ .cse23 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (<= (mod (+ .cse23 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127) (not (<= .cse22 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0))))))))) (or (and .cse11 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int)) (or (forall ((|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse25 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse24 (mod (+ .cse25 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256))) (or (not (<= .cse24 127)) (<= .cse24 |c_ULTIMATE.start_main_~y~0#1|) (not (< |ULTIMATE.start_gcd_test_~a#1| 0)) (not (<= (mod (+ .cse25 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse24) 256) 0)) (not (<= (mod .cse25 256) 127)))))) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|)))) .cse6) (or .cse0 (forall ((|v_ULTIMATE.start_gcd_test_~a#1_15| Int) (|ULTIMATE.start_gcd_test_~a#1| Int)) (let ((.cse26 (mod |ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (let ((.cse27 (mod .cse26 256))) (or (not (<= (mod (+ .cse26 (* |c_ULTIMATE.start_gcd_test_~b#1| 255)) 256) 127)) (not (= (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_15| .cse27) 256) 0)) (< |v_ULTIMATE.start_gcd_test_~a#1_15| |c_ULTIMATE.start_gcd_test_~b#1|) (<= .cse27 |c_ULTIMATE.start_main_~y~0#1|) (not (<= .cse27 127)) (< |ULTIMATE.start_gcd_test_~a#1| 0) (<= (mod (+ .cse26 |c_ULTIMATE.start_gcd_test_~b#1|) 256) 127))))))))) (= |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_gcd_test_~b#1|) (<= |c_ULTIMATE.start_main_~y~0#1| 127)))) is different from true [2022-07-22 11:05:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 11:05:57,696 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-07-22 11:05:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 11:05:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 12 [2022-07-22 11:05:57,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 11:05:57,697 INFO L225 Difference]: With dead ends: 20 [2022-07-22 11:05:57,697 INFO L226 Difference]: Without dead ends: 14 [2022-07-22 11:05:57,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 217.1s TimeCoverageRelationStatistics Valid=53, Invalid=207, Unknown=20, NotChecked=62, Total=342 [2022-07-22 11:05:57,698 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 11:05:57,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 46 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-22 11:05:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-22 11:05:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-22 11:05:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:05:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-22 11:05:57,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2022-07-22 11:05:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 11:05:57,700 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-22 11:05:57,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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) [2022-07-22 11:05:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-22 11:05:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 11:05:57,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 11:05:57,700 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:05:57,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 11:05:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-22 11:05:57,911 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 11:05:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:05:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1676390378, now seen corresponding path program 3 times [2022-07-22 11:05:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:05:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946804426] [2022-07-22 11:05:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:05:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:05:57,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-22 11:05:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497886034] [2022-07-22 11:05:57,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 11:05:57,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 11:05:57,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:05:57,931 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) [2022-07-22 11:05:57,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 11:05:58,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-22 11:05:58,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 11:05:58,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-22 11:05:58,029 INFO L286 TraceCheckSpWp]: Computing forward predicates...