./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_1+newton_3_8.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_3_8.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 fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 19:23:29,868 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 19:23:29,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 19:23:29,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 19:23:29,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 19:23:29,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 19:23:29,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 19:23:29,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 19:23:29,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 19:23:29,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 19:23:29,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 19:23:29,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 19:23:29,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 19:23:29,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 19:23:29,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 19:23:29,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 19:23:29,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 19:23:29,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 19:23:29,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 19:23:29,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 19:23:29,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 19:23:29,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 19:23:29,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 19:23:29,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 19:23:29,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 19:23:29,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 19:23:29,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 19:23:29,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 19:23:29,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 19:23:29,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 19:23:29,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 19:23:29,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 19:23:29,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 19:23:29,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 19:23:29,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 19:23:29,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 19:23:29,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 19:23:29,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 19:23:29,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 19:23:29,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 19:23:29,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 19:23:29,947 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:23:29,974 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 19:23:29,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 19:23:29,975 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 19:23:29,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 19:23:29,976 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 19:23:29,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 19:23:29,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 19:23:29,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 19:23:29,977 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 19:23:29,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 19:23:29,977 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 19:23:29,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 19:23:29,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 19:23:29,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 19:23:29,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 19:23:29,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 19:23:29,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 19:23:29,979 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 19:23:29,979 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 19:23:29,979 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 19:23:29,979 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 19:23:29,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 19:23:29,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 19:23:29,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 19:23:29,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:23:29,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 19:23:29,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 19:23:29,981 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 19:23:29,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 19:23:29,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 19:23:29,981 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 19:23:29,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 19:23:29,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 19:23:29,982 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 19:23:29,982 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 -> fb60664eb219cfca617a3a97a655d40aa192b004d90693207c446e4cc68b6381 [2021-12-17 19:23:30,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 19:23:30,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 19:23:30,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 19:23:30,233 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 19:23:30,233 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 19:23:30,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2021-12-17 19:23:30,287 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f906dd27/ed158aff5ead40f9ac9de1d31764e62a/FLAG75e356b47 [2021-12-17 19:23:30,669 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 19:23:30,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_3_8.i [2021-12-17 19:23:30,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f906dd27/ed158aff5ead40f9ac9de1d31764e62a/FLAG75e356b47 [2021-12-17 19:23:30,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f906dd27/ed158aff5ead40f9ac9de1d31764e62a [2021-12-17 19:23:30,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 19:23:30,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 19:23:30,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 19:23:30,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 19:23:30,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 19:23:30,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42cb2c56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30, skipping insertion in model container [2021-12-17 19:23:30,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 19:23:30,709 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 19:23:30,801 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_3_8.i[1226,1239] [2021-12-17 19:23:30,817 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_3_8.i[2828,2841] [2021-12-17 19:23:30,818 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:23:30,823 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 19:23:30,831 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_3_8.i[1226,1239] [2021-12-17 19:23:30,840 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_3_8.i[2828,2841] [2021-12-17 19:23:30,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 19:23:30,850 INFO L208 MainTranslator]: Completed translation [2021-12-17 19:23:30,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30 WrapperNode [2021-12-17 19:23:30,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 19:23:30,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 19:23:30,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 19:23:30,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 19:23:30,858 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:23:30" (1/1) ... [2021-12-17 19:23:30,864 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:23:30" (1/1) ... [2021-12-17 19:23:30,889 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2021-12-17 19:23:30,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 19:23:30,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 19:23:30,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 19:23:30,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 19:23:30,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 19:23:30,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 19:23:30,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 19:23:30,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 19:23:30,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (1/1) ... [2021-12-17 19:23:30,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 19:23:30,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:23:30,949 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:23:30,958 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:23:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 19:23:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2021-12-17 19:23:30,978 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2021-12-17 19:23:30,978 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-12-17 19:23:30,978 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-12-17 19:23:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 19:23:30,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 19:23:30,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 19:23:31,052 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 19:23:31,053 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 19:23:31,175 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 19:23:31,180 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 19:23:31,180 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 19:23:31,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:23:31 BoogieIcfgContainer [2021-12-17 19:23:31,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 19:23:31,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 19:23:31,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 19:23:31,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 19:23:31,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 07:23:30" (1/3) ... [2021-12-17 19:23:31,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e93b2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:23:31, skipping insertion in model container [2021-12-17 19:23:31,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 07:23:30" (2/3) ... [2021-12-17 19:23:31,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e93b2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 07:23:31, skipping insertion in model container [2021-12-17 19:23:31,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 07:23:31" (3/3) ... [2021-12-17 19:23:31,205 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_3_8.i [2021-12-17 19:23:31,213 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 19:23:31,213 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 19:23:31,254 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 19:23:31,258 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:23:31,258 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 19:23:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:23:31,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:23:31,271 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:23:31,272 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:23:31,272 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:23:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:23:31,277 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2021-12-17 19:23:31,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:23:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469684457] [2021-12-17 19:23:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:31,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:23:31,374 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:23:31,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016313608] [2021-12-17 19:23:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:31,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:23:31,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:23:31,381 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:23:31,381 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:23:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:23:31,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 19:23:31,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:23:31,479 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:23:31,479 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:23:31,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:23:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469684457] [2021-12-17 19:23:31,480 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:23:31,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016313608] [2021-12-17 19:23:31,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016313608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:23:31,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:23:31,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 19:23:31,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613938466] [2021-12-17 19:23:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:23:31,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 19:23:31,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:23:31,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 19:23:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 19:23:31,534 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 31 states have internal predecessors, (40), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 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:23:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:23:31,553 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2021-12-17 19:23:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 19:23:31,556 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:23:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:23:31,561 INFO L225 Difference]: With dead ends: 72 [2021-12-17 19:23:31,561 INFO L226 Difference]: Without dead ends: 32 [2021-12-17 19:23:31,564 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:23:31,568 INFO L933 BasicCegarLoop]: 48 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, 48 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:23:31,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:23:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-12-17 19:23:31,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-17 19:23:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:23:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2021-12-17 19:23:31,594 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2021-12-17 19:23:31,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:23:31,594 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2021-12-17 19:23:31,595 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:23:31,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2021-12-17 19:23:31,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 19:23:31,596 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:23:31,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:23:31,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 19:23:31,796 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:23:31,797 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:23:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:23:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2021-12-17 19:23:31,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:23:31,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296304322] [2021-12-17 19:23:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:31,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:23:31,805 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:23:31,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [614055282] [2021-12-17 19:23:31,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:31,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:23:31,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:23:31,806 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:23:31,808 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:23:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:23:31,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 19:23:31,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:23:31,898 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:23:31,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 19:23:31,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:23:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296304322] [2021-12-17 19:23:31,899 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:23:31,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614055282] [2021-12-17 19:23:31,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614055282] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 19:23:31,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 19:23:31,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 19:23:31,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645518996] [2021-12-17 19:23:31,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 19:23:31,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 19:23:31,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:23:31,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 19:23:31,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 19:23:31,902 INFO L87 Difference]: Start difference. First operand 32 states and 38 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:23:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:23:31,911 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2021-12-17 19:23:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 19:23:31,912 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:23:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:23:31,913 INFO L225 Difference]: With dead ends: 39 [2021-12-17 19:23:31,913 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 19:23:31,913 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:23:31,914 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 66 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:23:31,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:23:31,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 19:23:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-17 19:23:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:23:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-12-17 19:23:31,920 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2021-12-17 19:23:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:23:31,920 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-12-17 19:23:31,920 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:23:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-12-17 19:23:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 19:23:31,921 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:23:31,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:23:31,954 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:23:32,137 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:23:32,138 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:23:32,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:23:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2021-12-17 19:23:32,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:23:32,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476529190] [2021-12-17 19:23:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:32,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:23:32,145 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:23:32,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [349292336] [2021-12-17 19:23:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:32,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:23:32,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:23:32,151 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:23:32,152 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:23:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:23:32,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-17 19:23:32,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:23:32,242 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:23:32,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:23:32,302 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:23:32,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:23:32,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476529190] [2021-12-17 19:23:32,304 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:23:32,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349292336] [2021-12-17 19:23:32,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349292336] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:23:32,305 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:23:32,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-17 19:23:32,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661201344] [2021-12-17 19:23:32,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:23:32,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 19:23:32,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:23:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 19:23:32,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 19:23:32,307 INFO L87 Difference]: Start difference. First operand 33 states and 38 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:23:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:23:32,360 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-17 19:23:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:23:32,361 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:23:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:23:32,362 INFO L225 Difference]: With dead ends: 39 [2021-12-17 19:23:32,363 INFO L226 Difference]: Without dead ends: 34 [2021-12-17 19:23:32,363 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:23:32,365 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 153 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:23:32,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 153 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 19:23:32,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-12-17 19:23:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-12-17 19:23:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:23:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-17 19:23:32,383 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2021-12-17 19:23:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:23:32,383 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-17 19:23:32,383 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:23:32,383 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-17 19:23:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 19:23:32,384 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:23:32,384 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:23:32,402 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:23:32,584 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:23:32,585 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:23:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:23:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2021-12-17 19:23:32,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:23:32,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136784372] [2021-12-17 19:23:32,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:23:32,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:23:32,591 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:23:32,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695227008] [2021-12-17 19:23:32,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 19:23:32,591 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:23:32,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:23:32,593 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:23:32,594 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:23:37,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 19:23:37,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:23:37,680 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-17 19:23:37,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:24:18,003 WARN L227 SmtUtils]: Spent 5.26s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-17 19:24:27,184 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:24:42,089 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:25:01,033 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:26:20,752 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:27:03,496 WARN L838 $PredicateComparison]: unable to prove that (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|))))) is different from false [2021-12-17 19:27:05,499 WARN L860 $PredicateComparison]: unable to prove that (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|))))) is different from true [2021-12-17 19:27:05,499 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:27:05,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:27:25,914 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 (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 false [2021-12-17 19:27:56,946 WARN L227 SmtUtils]: Spent 16.24s 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:28:34,530 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse1 (mod (* |c_ULTIMATE.start_main1_~x~0#1| 255) 256))) (and (let ((.cse0 (mod (mod .cse1 |c_ULTIMATE.start_main1_~y~0#1|) 256))) (or (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| .cse0) 256))) (< 127 .cse1) (= 0 .cse0))) (let ((.cse2 (mod (+ .cse1 (- 256)) |c_ULTIMATE.start_main1_~y~0#1|))) (or (<= .cse1 127) (not (= 0 (mod (mod |c_ULTIMATE.start_main1_~y~0#1| (+ (mod (+ (* |c_ULTIMATE.start_main1_~y~0#1| 255) .cse2) 256) (- 256))) 256))) (= 0 .cse2))))) (<= |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|)))) is different from true [2021-12-17 19:29:25,996 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:29:25,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:29:25,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136784372] [2021-12-17 19:29:25,997 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:29:25,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695227008] [2021-12-17 19:29:25,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695227008] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:29:25,997 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:29:25,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2021-12-17 19:29:25,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236766673] [2021-12-17 19:29:25,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:29:25,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-17 19:29:25,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:29:25,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-17 19:29:25,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=123, Unknown=14, NotChecked=196, Total=380 [2021-12-17 19:29:25,999 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:30:19,729 WARN L227 SmtUtils]: Spent 46.94s 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:30:22,059 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 (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (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) (or (= 0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|)) .cse6) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (<= |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 ((.cse8 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse8) .cse6 (let ((.cse9 (mod (+ .cse3 .cse8) 256))) (and (or (= .cse9 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse9 (- 256))) 256))) (<= .cse9 127)) (or (= 0 .cse9) (= .cse9 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (< 127 .cse9))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse10 (mod .cse8 256))) (and (or (< 127 .cse10) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256))) (= 0 .cse10) (= .cse10 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse10 (- 256))) 256))) (<= .cse10 127) (= .cse10 .cse1)))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|))) is different from false [2021-12-17 19:30:24,068 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 (< 0 |c_ULTIMATE.start_main1_~y~0#1|) (<= 0 (+ |c_ULTIMATE.start_gcd_test_~a#1| 128)) (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) (or (= 0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_main1_~y~0#1|)) .cse6) (<= 0 (+ |c_ULTIMATE.start_main1_~x~0#1| 128)) (<= |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 ((.cse8 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse8) .cse6 (let ((.cse9 (mod (+ .cse3 .cse8) 256))) (and (or (= .cse9 .cse1) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse9 (- 256))) 256))) (<= .cse9 127)) (or (= 0 .cse9) (= .cse9 |c_ULTIMATE.start_main1_~y~0#1|) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse9) 256))) (< 127 .cse9))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse10 (mod .cse8 256))) (and (or (< 127 .cse10) (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse10) 256))) (= 0 .cse10) (= .cse10 |c_ULTIMATE.start_main1_~y~0#1|)) (or (not (= 0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| (+ .cse10 (- 256))) 256))) (<= .cse10 127) (= .cse10 .cse1)))))))) (= |c_ULTIMATE.start_gcd_test_~b#1| |c_ULTIMATE.start_main1_~y~0#1|))) is different from true [2021-12-17 19:30:26,073 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:30:28,315 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:31:05,158 WARN L227 SmtUtils]: Spent 34.63s 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:31:07,164 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:31:07,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:31:07,274 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2021-12-17 19:31:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 19:31:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:31:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:31:07,276 INFO L225 Difference]: With dead ends: 43 [2021-12-17 19:31:07,276 INFO L226 Difference]: Without dead ends: 38 [2021-12-17 19:31:07,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 158.5s TimeCoverageRelationStatistics Valid=65, Invalid=169, Unknown=20, NotChecked=396, Total=650 [2021-12-17 19:31:07,277 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-17 19:31:07,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 91 Unchecked, 1.1s Time] [2021-12-17 19:31:07,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-12-17 19:31:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2021-12-17 19:31:07,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:31:07,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-12-17 19:31:07,281 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 13 [2021-12-17 19:31:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:31:07,281 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-12-17 19:31:07,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:31:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-12-17 19:31:07,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 19:31:07,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:31:07,282 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:31:07,289 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:31:07,482 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:31:07,482 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:31:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:31:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 403427572, now seen corresponding path program 1 times [2021-12-17 19:31:07,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:31:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143986595] [2021-12-17 19:31:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:31:07,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:31:07,488 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:31:07,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338152841] [2021-12-17 19:31:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:31:07,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:31:07,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:31:07,489 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:31:07,490 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:31:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 19:31:07,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 29 conjunts are in the unsatisfiable core [2021-12-17 19:31:07,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:31:07,803 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:31:07,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 19:31:41,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gcd_test_~a#1_22| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_22| |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse1 (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 ((.cse0 (mod .cse1 256))) (and (or (< 127 .cse0) (= 0 .cse0) (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse0) 256)))) (or (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (+ .cse0 (- 256))) 256))) (<= .cse0 127))))) (or (= 0 .cse1) (let ((.cse10 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse11 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse1) 256))) (let ((.cse4 (<= .cse11 127)) (.cse2 (or .cse10 (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (+ .cse11 (- 256))) 256))))) (.cse6 (< 127 .cse11)) (.cse5 (or .cse10 (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse11) 256))) (= 0 .cse11))) (.cse8 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse7 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse1) 256))) (and (or (let ((.cse3 (or (= 0 .cse7) (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| .cse7) 256))) .cse8))) (and (or (and .cse2 .cse3) .cse4) (or (and .cse5 .cse3) .cse6))) (< 127 .cse7)) (or (let ((.cse9 (or (not (= 0 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_22| (+ .cse7 (- 256))) 256))) .cse8))) (and (or .cse4 (and .cse9 .cse2)) (or .cse6 (and .cse5 .cse9)))) (<= .cse7 127))))) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)))))) is different from false [2021-12-17 19:32:08,851 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:32:08,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 19:32:08,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143986595] [2021-12-17 19:32:08,852 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 19:32:08,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338152841] [2021-12-17 19:32:08,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338152841] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 19:32:08,852 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 19:32:08,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 11 [2021-12-17 19:32:08,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626014934] [2021-12-17 19:32:08,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 19:32:08,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 19:32:08,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 19:32:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 19:32:08,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2021-12-17 19:32:08,854 INFO L87 Difference]: Start difference. First operand 36 states and 41 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:32:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 19:32:10,575 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2021-12-17 19:32:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 19:32:10,575 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:32:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 19:32:10,575 INFO L225 Difference]: With dead ends: 44 [2021-12-17 19:32:10,575 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 19:32:10,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2021-12-17 19:32:10,579 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 3 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 19:32:10,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 243 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 22 Unchecked, 1.0s Time] [2021-12-17 19:32:10,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 19:32:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-12-17 19:32:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 19:32:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2021-12-17 19:32:10,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 13 [2021-12-17 19:32:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 19:32:10,590 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2021-12-17 19:32:10,590 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:32:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2021-12-17 19:32:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 19:32:10,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 19:32:10,591 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 19:32:10,610 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:32:10,801 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:32:10,801 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 19:32:10,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 19:32:10,802 INFO L85 PathProgramCache]: Analyzing trace with hash 66034544, now seen corresponding path program 3 times [2021-12-17 19:32:10,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 19:32:10,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910424434] [2021-12-17 19:32:10,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 19:32:10,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 19:32:10,807 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 19:32:10,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871599451] [2021-12-17 19:32:10,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 19:32:10,808 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 19:32:10,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 19:32:10,809 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:32:10,810 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:32:13,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-17 19:32:13,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 19:32:13,260 WARN L261 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-17 19:32:13,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 19:34:03,448 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256))) (and (not (= 0 .cse0)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0) 256)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |v_ULTIMATE.start_gcd_test_~a#1_26|)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|) (= |c_ULTIMATE.start_gcd_test_~a#1| .cse0) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128))))) is different from false [2021-12-17 19:35:59,980 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256))) (and (not (= 0 .cse0)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0) 256)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128))))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:36:58,067 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256))) (and (not (= 0 .cse0)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |v_ULTIMATE.start_gcd_test_~a#1_26|)) (= 0 (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0) 256)) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0)))) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from false [2021-12-17 19:38:05,517 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_gcd_test_~a#1_24| Int) (|v_ULTIMATE.start_gcd_test_~a#1_26| Int)) (let ((.cse0 (mod (mod (mod (* |v_ULTIMATE.start_gcd_test_~a#1_24| 255) 256) |v_ULTIMATE.start_gcd_test_~a#1_26|) 256))) (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_26| .cse0) 256))) (and (not (= 0 .cse0)) (= 0 (mod |v_ULTIMATE.start_gcd_test_~a#1_24| |v_ULTIMATE.start_gcd_test_~a#1_26|)) (not (= 0 .cse1)) (= 0 (mod (mod .cse0 .cse1) 256)) (= |c_ULTIMATE.start_gcd_test_#res#1| .cse1) (< 0 |v_ULTIMATE.start_gcd_test_~a#1_26|) (<= 0 (+ |v_ULTIMATE.start_gcd_test_~a#1_24| 128)) (< |v_ULTIMATE.start_gcd_test_~a#1_24| 0))))) is different from false Killed by 15