./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_3+newton_3_6.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_3+newton_3_6.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 cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 20:07:05,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 20:07:05,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 20:07:05,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 20:07:05,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 20:07:05,490 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 20:07:05,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 20:07:05,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 20:07:05,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 20:07:05,496 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 20:07:05,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 20:07:05,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 20:07:05,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 20:07:05,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 20:07:05,501 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 20:07:05,502 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 20:07:05,504 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 20:07:05,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 20:07:05,507 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 20:07:05,509 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 20:07:05,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 20:07:05,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 20:07:05,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 20:07:05,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 20:07:05,516 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 20:07:05,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 20:07:05,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 20:07:05,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 20:07:05,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 20:07:05,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 20:07:05,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 20:07:05,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 20:07:05,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 20:07:05,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 20:07:05,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 20:07:05,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 20:07:05,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 20:07:05,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 20:07:05,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 20:07:05,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 20:07:05,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 20:07:05,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 20:07:05,544 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 20:07:05,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 20:07:05,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 20:07:05,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 20:07:05,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 20:07:05,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 20:07:05,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 20:07:05,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 20:07:05,546 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 20:07:05,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 20:07:05,547 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 20:07:05,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 20:07:05,547 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 20:07:05,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 20:07:05,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 20:07:05,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 20:07:05,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 20:07:05,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 20:07:05,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 20:07:05,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 20:07:05,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 20:07:05,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 20:07:05,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 20:07:05,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 20:07:05,550 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 20:07:05,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 20:07:05,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 20:07:05,551 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 20:07:05,551 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 -> cefb3bae89bbacb2fe493d14201bba1802fb381afd861fd412b13151077489a8 [2021-12-17 20:07:05,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 20:07:05,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 20:07:05,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 20:07:05,755 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 20:07:05,755 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 20:07:05,756 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2021-12-17 20:07:05,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09eab53cb/02694bdfb0504856b48d3b238ac7a871/FLAG94669a25a [2021-12-17 20:07:06,170 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 20:07:06,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_3+newton_3_6.i [2021-12-17 20:07:06,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09eab53cb/02694bdfb0504856b48d3b238ac7a871/FLAG94669a25a [2021-12-17 20:07:06,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09eab53cb/02694bdfb0504856b48d3b238ac7a871 [2021-12-17 20:07:06,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 20:07:06,196 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 20:07:06,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 20:07:06,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 20:07:06,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 20:07:06,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467442e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06, skipping insertion in model container [2021-12-17 20:07:06,202 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 20:07:06,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 20:07:06,354 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_3+newton_3_6.i[1226,1239] [2021-12-17 20:07:06,385 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_3+newton_3_6.i[2862,2875] [2021-12-17 20:07:06,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 20:07:06,392 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 20:07:06,405 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_3+newton_3_6.i[1226,1239] [2021-12-17 20:07:06,424 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_3+newton_3_6.i[2862,2875] [2021-12-17 20:07:06,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 20:07:06,438 INFO L208 MainTranslator]: Completed translation [2021-12-17 20:07:06,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06 WrapperNode [2021-12-17 20:07:06,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 20:07:06,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 20:07:06,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 20:07:06,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 20:07:06,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,456 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,477 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 82 [2021-12-17 20:07:06,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 20:07:06,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 20:07:06,478 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 20:07:06,478 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 20:07:06,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 20:07:06,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 20:07:06,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 20:07:06,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 20:07:06,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (1/1) ... [2021-12-17 20:07:06,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 20:07:06,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:07:06,517 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 20:07:06,524 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 20:07:06,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 20:07:06,542 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2021-12-17 20:07:06,542 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2021-12-17 20:07:06,542 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-12-17 20:07:06,543 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-12-17 20:07:06,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 20:07:06,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 20:07:06,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 20:07:06,591 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 20:07:06,592 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 20:07:06,736 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 20:07:06,740 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 20:07:06,740 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 20:07:06,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:07:06 BoogieIcfgContainer [2021-12-17 20:07:06,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 20:07:06,742 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 20:07:06,742 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 20:07:06,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 20:07:06,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 08:07:06" (1/3) ... [2021-12-17 20:07:06,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb28be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:07:06, skipping insertion in model container [2021-12-17 20:07:06,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 08:07:06" (2/3) ... [2021-12-17 20:07:06,747 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb28be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 08:07:06, skipping insertion in model container [2021-12-17 20:07:06,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 08:07:06" (3/3) ... [2021-12-17 20:07:06,748 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_3+newton_3_6.i [2021-12-17 20:07:06,752 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 20:07:06,755 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-17 20:07:06,785 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 20:07:06,790 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 20:07:06,790 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-17 20:07:06,802 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 20:07:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 20:07:06,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:07:06,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:07:06,805 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:07:06,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:07:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1709385323, now seen corresponding path program 1 times [2021-12-17 20:07:06,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:07:06,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957173752] [2021-12-17 20:07:06,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:07:06,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:07:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 20:07:06,948 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 20:07:06,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:07:06,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957173752] [2021-12-17 20:07:06,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957173752] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 20:07:06,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 20:07:06,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 20:07:06,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571523212] [2021-12-17 20:07:06,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 20:07:06,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 20:07:06,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:07:06,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 20:07:06,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 20:07:06,973 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 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 20:07:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:07:07,029 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2021-12-17 20:07:07,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 20:07:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 20:07:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:07:07,036 INFO L225 Difference]: With dead ends: 96 [2021-12-17 20:07:07,037 INFO L226 Difference]: Without dead ends: 39 [2021-12-17 20:07:07,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 20:07:07,043 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 20:07:07,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 134 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 20:07:07,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2021-12-17 20:07:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2021-12-17 20:07:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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 20:07:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2021-12-17 20:07:07,073 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 11 [2021-12-17 20:07:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:07:07,073 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2021-12-17 20:07:07,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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 20:07:07,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2021-12-17 20:07:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-17 20:07:07,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:07:07,075 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:07:07,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 20:07:07,076 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:07:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:07:07,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1776235347, now seen corresponding path program 1 times [2021-12-17 20:07:07,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:07:07,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869736892] [2021-12-17 20:07:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:07:07,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:07:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 20:07:07,175 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 20:07:07,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:07:07,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869736892] [2021-12-17 20:07:07,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869736892] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 20:07:07,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 20:07:07,177 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-17 20:07:07,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109579943] [2021-12-17 20:07:07,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 20:07:07,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 20:07:07,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:07:07,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 20:07:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-17 20:07:07,180 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 20:07:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:07:07,239 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2021-12-17 20:07:07,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 20:07:07,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 20:07:07,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:07:07,242 INFO L225 Difference]: With dead ends: 39 [2021-12-17 20:07:07,242 INFO L226 Difference]: Without dead ends: 33 [2021-12-17 20:07:07,245 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-17 20:07:07,246 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 20:07:07,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 155 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 20:07:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-12-17 20:07:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-12-17 20:07:07,254 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 20:07:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-12-17 20:07:07,257 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2021-12-17 20:07:07,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:07:07,259 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-12-17 20:07:07,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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 20:07:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-12-17 20:07:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 20:07:07,261 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:07:07,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:07:07,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 20:07:07,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:07:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:07:07,265 INFO L85 PathProgramCache]: Analyzing trace with hash 830014046, now seen corresponding path program 1 times [2021-12-17 20:07:07,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:07:07,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319417898] [2021-12-17 20:07:07,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:07:07,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:07:07,281 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 20:07:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922753350] [2021-12-17 20:07:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:07:07,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:07:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:07:07,287 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 20:07:07,288 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 20:07:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 20:07:07,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 20:07:07,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 20:07:36,570 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 20:07:36,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 20:07:48,033 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 20:07:48,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:07:48,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319417898] [2021-12-17 20:07:48,034 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 20:07:48,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922753350] [2021-12-17 20:07:48,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922753350] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 20:07:48,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 20:07:48,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2021-12-17 20:07:48,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964563881] [2021-12-17 20:07:48,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 20:07:48,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-17 20:07:48,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:07:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-17 20:07:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=208, Unknown=10, NotChecked=0, Total=272 [2021-12-17 20:07:48,041 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 20:07:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:07:48,255 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2021-12-17 20:07:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 20:07:48,255 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 20:07:48,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:07:48,256 INFO L225 Difference]: With dead ends: 41 [2021-12-17 20:07:48,256 INFO L226 Difference]: Without dead ends: 35 [2021-12-17 20:07:48,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=63, Invalid=233, Unknown=10, NotChecked=0, Total=306 [2021-12-17 20:07:48,257 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 20:07:48,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 291 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2021-12-17 20:07:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-12-17 20:07:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2021-12-17 20:07:48,260 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 20:07:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-12-17 20:07:48,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 12 [2021-12-17 20:07:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:07:48,261 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-12-17 20:07:48,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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 20:07:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-12-17 20:07:48,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 20:07:48,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:07:48,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:07:48,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 20:07:48,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:07:48,475 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:07:48,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:07:48,476 INFO L85 PathProgramCache]: Analyzing trace with hash 20667420, now seen corresponding path program 1 times [2021-12-17 20:07:48,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:07:48,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075162073] [2021-12-17 20:07:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:07:48,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:07:48,481 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 20:07:48,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [27437485] [2021-12-17 20:07:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:07:48,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:07:48,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:07:48,482 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 20:07:48,483 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 20:07:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 20:07:48,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-17 20:07:48,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 20:08:16,031 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 20:08:16,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 20:08:38,660 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 20:08:38,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:08:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075162073] [2021-12-17 20:08:38,660 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 20:08:38,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27437485] [2021-12-17 20:08:38,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27437485] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 20:08:38,661 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 20:08:38,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2021-12-17 20:08:38,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698045350] [2021-12-17 20:08:38,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 20:08:38,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 20:08:38,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:08:38,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 20:08:38,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=173, Unknown=14, NotChecked=0, Total=240 [2021-12-17 20:08:38,662 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 20:08:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:08:39,318 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2021-12-17 20:08:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-17 20:08:39,318 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 20:08:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:08:39,318 INFO L225 Difference]: With dead ends: 46 [2021-12-17 20:08:39,319 INFO L226 Difference]: Without dead ends: 37 [2021-12-17 20:08:39,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=62, Invalid=196, Unknown=14, NotChecked=0, Total=272 [2021-12-17 20:08:39,319 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-17 20:08:39,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 281 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 36 Unchecked, 0.2s Time] [2021-12-17 20:08:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-17 20:08:39,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-12-17 20:08:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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 20:08:39,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-12-17 20:08:39,323 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2021-12-17 20:08:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:08:39,323 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-12-17 20:08:39,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 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 20:08:39,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-12-17 20:08:39,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 20:08:39,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:08:39,324 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:08:39,342 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 20:08:39,537 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,SelfDestructingSolverStorable3 [2021-12-17 20:08:39,537 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:08:39,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:08:39,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1518646018, now seen corresponding path program 2 times [2021-12-17 20:08:39,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:08:39,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954392884] [2021-12-17 20:08:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:08:39,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:08:39,544 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 20:08:39,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [118388257] [2021-12-17 20:08:39,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 20:08:39,544 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:08:39,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:08:39,546 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 20:08:39,548 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 20:08:39,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 20:08:39,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 20:08:39,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-17 20:08:39,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 20:09:08,229 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse2 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse3 (+ .cse2 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse3) 256))) (let ((.cse1 (mod .cse3 .cse0))) (and (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ .cse1 (* .cse0 255)) 256)) (< 127 .cse2) (not (= 0 .cse1)) (not (= 0 .cse0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse4 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse4) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse4 .cse5) 256)) (not (= 0 .cse5)) (= |c_ULTIMATE.start_gcd_test_~b#1| (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (<= .cse4 127)))))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from true [2021-12-17 20:09:11,643 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse0 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse1 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse0) 256))) (and (= |c_ULTIMATE.start_gcd_test_~a#1| (mod (mod .cse0 .cse1) 256)) (= 0 (mod (mod .cse1 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (not (= 0 .cse1)) (<= .cse0 127))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse4 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse5 (+ .cse4 (- 256)))) (let ((.cse3 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse5) 256))) (let ((.cse2 (mod .cse5 .cse3))) (and (= (+ |c_ULTIMATE.start_gcd_test_~a#1| 256) (mod (+ .cse2 (* .cse3 255)) 256)) (= 0 (mod (mod .cse3 |c_ULTIMATE.start_gcd_test_~a#1|) 256)) (< 127 .cse4) (not (= 0 .cse2)) (not (= 0 .cse3))))))))) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 |c_ULTIMATE.start_gcd_test_~a#1|))) is different from true [2021-12-17 20:09:14,290 WARN L838 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse1 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse3 (+ .cse1 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse3) 256))) (let ((.cse2 (mod .cse3 .cse0))) (and (= 0 (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_#res#1|) 256)) (< 127 .cse1) (not (= 0 .cse2)) (= (+ |c_ULTIMATE.start_gcd_test_#res#1| 256) (mod (+ .cse2 (* .cse0 255)) 256)) (not (= 0 .cse0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse4 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse4) 256))) (and (= |c_ULTIMATE.start_gcd_test_#res#1| (mod (mod .cse4 .cse5) 256)) (not (= 0 .cse5)) (<= .cse4 127) (= 0 (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_#res#1|) 256))))))) (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from false [2021-12-17 20:09:16,664 WARN L860 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse1 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse3 (+ .cse1 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse3) 256))) (let ((.cse2 (mod .cse3 .cse0))) (and (= 0 (mod (mod .cse0 |c_ULTIMATE.start_gcd_test_#res#1|) 256)) (< 127 .cse1) (not (= 0 .cse2)) (= (+ |c_ULTIMATE.start_gcd_test_#res#1| 256) (mod (+ .cse2 (* .cse0 255)) 256)) (not (= 0 .cse0)))))))) (exists ((|v_ULTIMATE.start_gcd_test_~b#1_17| Int)) (let ((.cse4 (mod (* |v_ULTIMATE.start_gcd_test_~b#1_17| 255) 256))) (let ((.cse5 (mod (mod |c_ULTIMATE.start_main1_~x~0#1| .cse4) 256))) (and (= |c_ULTIMATE.start_gcd_test_#res#1| (mod (mod .cse4 .cse5) 256)) (not (= 0 .cse5)) (<= .cse4 127) (= 0 (mod (mod .cse5 |c_ULTIMATE.start_gcd_test_#res#1|) 256))))))) (not (= 0 |c_ULTIMATE.start_gcd_test_#res#1|)) (<= 0 |c_ULTIMATE.start_main1_~x~0#1|)) is different from true [2021-12-17 20:09:33,209 WARN L227 SmtUtils]: Spent 7.22s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:09:35,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 20:09:35,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 20:10:40,657 WARN L227 SmtUtils]: Spent 51.60s on a formula simplification. DAG size of input: 56 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:10:56,956 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse1 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse5 (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 ((.cse2 (mod .cse5 256))) (and (let ((.cse3 (+ .cse2 (- 256)))) (let ((.cse0 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse3) 256))) (or (<= .cse0 |c_ULTIMATE.start_main1_~x~0#1|) .cse1 (<= .cse2 127) (not (= 0 (mod (mod .cse3 .cse0) 256)))))) (let ((.cse4 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse2) 256))) (or (< 127 .cse2) (not (= 0 (mod (mod .cse2 .cse4) 256))) (<= .cse4 |c_ULTIMATE.start_main1_~x~0#1|) (= 0 .cse2) .cse1))))) (or (= 0 .cse5) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse17 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse5) 256))) (let ((.cse7 (<= .cse17 127)) (.cse10 (< 127 .cse17)) (.cse12 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse5) 256))) (and (or (let ((.cse11 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse12) 256))) (let ((.cse6 (= 0 .cse12)) (.cse8 (not (= 0 (mod (mod .cse12 .cse11) 256)))) (.cse9 (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse6 .cse7 .cse8 .cse9 .cse1) (or .cse6 .cse8 .cse10 .cse9 .cse1)))) (< 127 .cse12)) (or (let ((.cse16 (+ .cse12 (- 256)))) (let ((.cse15 (mod (mod |c_ULTIMATE.start_gcd_test_~b#1| .cse16) 256))) (let ((.cse13 (not (= 0 (mod (mod .cse16 .cse15) 256)))) (.cse14 (<= .cse15 |c_ULTIMATE.start_main1_~x~0#1|))) (and (or .cse7 .cse13 .cse14 .cse1) (or .cse13 .cse14 .cse10 .cse1))))) (<= .cse12 127))))))))) is different from true [2021-12-17 20:11:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 20:11:37,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:11:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954392884] [2021-12-17 20:11:37,308 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 20:11:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118388257] [2021-12-17 20:11:37,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118388257] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 20:11:37,308 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 20:11:37,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-17 20:11:37,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091784130] [2021-12-17 20:11:37,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 20:11:37,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 20:11:37,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:11:37,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 20:11:37,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=203, Unknown=13, NotChecked=132, Total=420 [2021-12-17 20:11:37,309 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 20:12:05,695 WARN L227 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 61 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:12:44,844 WARN L227 SmtUtils]: Spent 21.39s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:13:09,653 WARN L227 SmtUtils]: Spent 10.47s on a formula simplification. DAG size of input: 51 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:13:09,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:13:09,661 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2021-12-17 20:13:09,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-17 20:13:09,661 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 14 [2021-12-17 20:13:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:13:09,662 INFO L225 Difference]: With dead ends: 50 [2021-12-17 20:13:09,662 INFO L226 Difference]: Without dead ends: 41 [2021-12-17 20:13:09,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 211.2s TimeCoverageRelationStatistics Valid=102, Invalid=309, Unknown=25, NotChecked=164, Total=600 [2021-12-17 20:13:09,663 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 20:13:09,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 319 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 145 Unchecked, 0.0s Time] [2021-12-17 20:13:09,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-12-17 20:13:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2021-12-17 20:13:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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 20:13:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-12-17 20:13:09,667 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2021-12-17 20:13:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:13:09,667 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-12-17 20:13:09,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 20:13:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-12-17 20:13:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 20:13:09,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:13:09,667 INFO L514 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:13:09,702 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 20:13:09,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:13:09,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:13:09,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:13:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1911673028, now seen corresponding path program 2 times [2021-12-17 20:13:09,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:13:09,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11887877] [2021-12-17 20:13:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:13:09,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:13:09,873 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 20:13:09,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1633714719] [2021-12-17 20:13:09,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 20:13:09,873 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:13:09,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:13:09,874 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 20:13:09,875 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 20:13:09,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 20:13:09,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 20:13:09,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 37 conjunts are in the unsatisfiable core [2021-12-17 20:13:09,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 20:13:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 20:13:31,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 20:14:21,790 WARN L227 SmtUtils]: Spent 36.81s on a formula simplification. DAG size of input: 56 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:17:48,911 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse15 (< |v_ULTIMATE.start_gcd_test_~a#1_27| 0)) (.cse7 (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) (.cse0 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (= 0 .cse0) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|) (let ((.cse14 (<= 0 |c_ULTIMATE.start_gcd_test_~b#1|)) (.cse16 (mod (+ |c_ULTIMATE.start_gcd_test_~b#1| .cse0) 256))) (let ((.cse4 (let ((.cse17 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse16) 256))) (or .cse14 (not (= 0 (mod (mod .cse16 .cse17) 256))) (<= .cse17 |c_ULTIMATE.start_main1_~x~0#1|) .cse15 (= 0 .cse16)))) (.cse5 (< 127 .cse16)) (.cse1 (<= .cse16 127)) (.cse2 (let ((.cse12 (+ .cse16 (- 256)))) (let ((.cse13 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse12) 256))) (or (not (= 0 (mod (mod .cse12 .cse13) 256))) .cse14 (<= .cse13 |c_ULTIMATE.start_main1_~x~0#1|) .cse15)))) (.cse9 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse0) 256))) (and (or (let ((.cse3 (let ((.cse8 (+ .cse9 (- 256)))) (let ((.cse6 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse8) 256))) (or (<= .cse6 |c_ULTIMATE.start_main1_~x~0#1|) .cse7 (not (= 0 (mod (mod .cse8 .cse6) 256)))))))) (and (or .cse1 (and .cse2 .cse3)) (or (and .cse4 .cse3) .cse5))) (<= .cse9 127)) (or (let ((.cse10 (let ((.cse11 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse9) 256))) (or (= 0 .cse9) (<= .cse11 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse9 .cse11) 256))) .cse7)))) (and (or (and .cse4 .cse10) .cse5) (or .cse1 (and .cse2 .cse10)))) (< 127 .cse9)))))) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse19 (mod .cse0 256))) (and (let ((.cse18 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse19) 256))) (or (<= .cse18 |c_ULTIMATE.start_main1_~x~0#1|) (< 127 .cse19) (= 0 .cse19) (not (= 0 (mod (mod .cse19 .cse18) 256))) .cse15)) (or (<= .cse19 127) (let ((.cse22 (+ .cse19 (- 256)))) (let ((.cse23 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse22) 256))) (let ((.cse20 (<= .cse23 |c_ULTIMATE.start_main1_~x~0#1|)) (.cse21 (not (= 0 (mod (mod .cse22 .cse23) 256))))) (and (or .cse20 .cse21 .cse15) (or .cse20 .cse7 .cse21)))))))))))))) is different from true [2021-12-17 20:18:24,731 WARN L860 $PredicateComparison]: unable to prove that (or (<= |c_ULTIMATE.start_main1_~x~0#1| 0) (forall ((|v_ULTIMATE.start_gcd_test_~a#1_27| Int)) (or (< |v_ULTIMATE.start_gcd_test_~a#1_27| |c_ULTIMATE.start_gcd_test_~b#1|) (let ((.cse4 (mod |c_ULTIMATE.start_gcd_test_~a#1| |c_ULTIMATE.start_gcd_test_~b#1|))) (and (or (let ((.cse0 (mod (+ (* |c_ULTIMATE.start_gcd_test_~b#1| 255) .cse4) 256))) (and (let ((.cse1 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse0) 256))) (or (= 0 .cse0) (<= .cse1 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse0 .cse1) 256))) (< 127 .cse0))) (let ((.cse3 (+ .cse0 (- 256)))) (let ((.cse2 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse3) 256))) (or (<= .cse2 |c_ULTIMATE.start_main1_~x~0#1|) (not (= 0 (mod (mod .cse3 .cse2) 256))) (<= .cse0 127)))))) (= 0 .cse4) (<= 0 |c_ULTIMATE.start_gcd_test_~a#1|)) (or (< |c_ULTIMATE.start_gcd_test_~a#1| 0) (let ((.cse6 (mod .cse4 256))) (and (let ((.cse5 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse6) 256))) (or (<= .cse5 |c_ULTIMATE.start_main1_~x~0#1|) (< 127 .cse6) (= 0 .cse6) (not (= 0 (mod (mod .cse6 .cse5) 256))))) (let ((.cse8 (+ .cse6 (- 256)))) (let ((.cse7 (mod (mod |v_ULTIMATE.start_gcd_test_~a#1_27| .cse8) 256))) (or (<= .cse7 |c_ULTIMATE.start_main1_~x~0#1|) (<= .cse6 127) (not (= 0 (mod (mod .cse8 .cse7) 256))))))))))))) (= 0 |c_ULTIMATE.start_gcd_test_~b#1|) (< |c_ULTIMATE.start_gcd_test_~b#1| 0)) is different from true [2021-12-17 20:18:44,062 WARN L227 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:18:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-17 20:18:44,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 20:18:44,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11887877] [2021-12-17 20:18:44,097 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 20:18:44,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633714719] [2021-12-17 20:18:44,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633714719] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 20:18:44,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 20:18:44,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-17 20:18:44,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768297543] [2021-12-17 20:18:44,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 20:18:44,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-17 20:18:44,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 20:18:44,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-17 20:18:44,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=267, Unknown=7, NotChecked=70, Total=420 [2021-12-17 20:18:44,098 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 20:18:55,831 WARN L227 SmtUtils]: Spent 5.30s 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 20:19:04,743 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 20:19:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 20:19:15,059 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2021-12-17 20:19:15,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-17 20:19:15,060 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 14 [2021-12-17 20:19:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 20:19:15,060 INFO L225 Difference]: With dead ends: 53 [2021-12-17 20:19:15,060 INFO L226 Difference]: Without dead ends: 44 [2021-12-17 20:19:15,061 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 102.1s TimeCoverageRelationStatistics Valid=113, Invalid=387, Unknown=14, NotChecked=86, Total=600 [2021-12-17 20:19:15,061 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-17 20:19:15,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 309 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 30 Invalid, 1 Unknown, 129 Unchecked, 2.4s Time] [2021-12-17 20:19:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-17 20:19:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2021-12-17 20:19:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 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 20:19:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2021-12-17 20:19:15,066 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 14 [2021-12-17 20:19:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 20:19:15,066 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2021-12-17 20:19:15,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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 20:19:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2021-12-17 20:19:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-17 20:19:15,067 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 20:19:15,067 INFO L514 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 20:19:15,085 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 20:19:15,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:19:15,279 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 20:19:15,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 20:19:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2146807949, now seen corresponding path program 3 times [2021-12-17 20:19:15,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 20:19:15,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290355416] [2021-12-17 20:19:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 20:19:15,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 20:19:15,285 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 20:19:15,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206442434] [2021-12-17 20:19:15,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 20:19:15,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 20:19:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 20:19:15,286 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 20:19:15,287 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 20:19:15,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-17 20:19:15,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 20:19:15,509 WARN L261 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 60 conjunts are in the unsatisfiable core [2021-12-17 20:19:15,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 20:20:34,600 WARN L227 SmtUtils]: Spent 10.45s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 20:21:44,317 WARN L227 SmtUtils]: Spent 19.39s on a formula simplification. DAG size of input: 67 DAG size of output: 59 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15