./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_1+newton_2_7.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/gcd_1+newton_2_7.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 184de52a0dff4eb1d8c7e38c30c44a1d55b19bad29c4bb3af8f1421516bacfd9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:29:48,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:29:48,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:29:48,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:29:48,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:29:48,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:29:48,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:29:48,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:29:48,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:29:48,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:29:48,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:29:48,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:29:48,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:29:48,449 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:29:48,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:29:48,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:29:48,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:29:48,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:29:48,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:29:48,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:29:48,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:29:48,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:29:48,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:29:48,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:29:48,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:29:48,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:29:48,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:29:48,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:29:48,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:29:48,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:29:48,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:29:48,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:29:48,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:29:48,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:29:48,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:29:48,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:29:48,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:29:48,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:29:48,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:29:48,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:29:48,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:29:48,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:29:48,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:29:48,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:29:48,478 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:29:48,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:29:48,479 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:29:48,479 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:29:48,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:29:48,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:29:48,480 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:29:48,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:29:48,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:29:48,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:29:48,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:29:48,481 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:29:48,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:29:48,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:29:48,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:29:48,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:29:48,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:29:48,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:29:48,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:29:48,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:29:48,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:29:48,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:29:48,483 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:29:48,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:29:48,483 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:29:48,483 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 -> 184de52a0dff4eb1d8c7e38c30c44a1d55b19bad29c4bb3af8f1421516bacfd9 [2022-02-20 19:29:48,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:29:48,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:29:48,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:29:48,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:29:48,689 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:29:48,690 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_1+newton_2_7.i [2022-02-20 19:29:48,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5999cd01/b2013758e226479591a18fba0ab97520/FLAGf8bce15ea [2022-02-20 19:29:49,129 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:29:49,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_7.i [2022-02-20 19:29:49,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5999cd01/b2013758e226479591a18fba0ab97520/FLAGf8bce15ea [2022-02-20 19:29:49,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5999cd01/b2013758e226479591a18fba0ab97520 [2022-02-20 19:29:49,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:29:49,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:29:49,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:29:49,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:29:49,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:29:49,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643bb10c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49, skipping insertion in model container [2022-02-20 19:29:49,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:29:49,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:29:49,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_7.i[1226,1239] [2022-02-20 19:29:49,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_7.i[2807,2820] [2022-02-20 19:29:49,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:29:49,745 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:29:49,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_7.i[1226,1239] [2022-02-20 19:29:49,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_1+newton_2_7.i[2807,2820] [2022-02-20 19:29:49,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:29:49,780 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:29:49,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49 WrapperNode [2022-02-20 19:29:49,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:29:49,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:29:49,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:29:49,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:29:49,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,809 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 77 [2022-02-20 19:29:49,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:29:49,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:29:49,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:29:49,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:29:49,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:29:49,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:29:49,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:29:49,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:29:49,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (1/1) ... [2022-02-20 19:29:49,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:29:49,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:29:49,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 19:29:49,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 19:29:49,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:29:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure fp [2022-02-20 19:29:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure fp [2022-02-20 19:29:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-02-20 19:29:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-02-20 19:29:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:29:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:29:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:29:49,941 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:29:49,942 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:29:50,165 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:29:50,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:29:50,170 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:29:50,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:29:50 BoogieIcfgContainer [2022-02-20 19:29:50,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:29:50,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:29:50,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:29:50,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:29:50,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:29:49" (1/3) ... [2022-02-20 19:29:50,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772e6edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:29:50, skipping insertion in model container [2022-02-20 19:29:50,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:29:49" (2/3) ... [2022-02-20 19:29:50,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772e6edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:29:50, skipping insertion in model container [2022-02-20 19:29:50,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:29:50" (3/3) ... [2022-02-20 19:29:50,176 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_1+newton_2_7.i [2022-02-20 19:29:50,180 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:29:50,180 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:29:50,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:29:50,212 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 [2022-02-20 19:29:50,213 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:29:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:50,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:29:50,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:29:50,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:29:50,230 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:29:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:29:50,233 INFO L85 PathProgramCache]: Analyzing trace with hash -247750664, now seen corresponding path program 1 times [2022-02-20 19:29:50,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:29:50,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4032892] [2022-02-20 19:29:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:50,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:29:50,302 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:29:50,302 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876977332] [2022-02-20 19:29:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:50,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:29:50,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:29:50,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:29:50,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 19:29:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:29:50,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 19:29:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:29:50,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:29:50,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-02-20 19:29:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {40#true} is VALID [2022-02-20 19:29:50,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1; {40#true} is VALID [2022-02-20 19:29:50,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~0#1);assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {40#true} is VALID [2022-02-20 19:29:50,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#true} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {40#true} is VALID [2022-02-20 19:29:50,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {40#true} is VALID [2022-02-20 19:29:50,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 19:29:50,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#false} gcd_test_#res#1 := gcd_test_~a#1; {41#false} is VALID [2022-02-20 19:29:50,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#false} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {41#false} is VALID [2022-02-20 19:29:50,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume 0 == __VERIFIER_assert_~cond#1; {41#false} is VALID [2022-02-20 19:29:50,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 19:29:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:29:50,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:29:50,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:29:50,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4032892] [2022-02-20 19:29:50,474 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:29:50,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876977332] [2022-02-20 19:29:50,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876977332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:29:50,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:29:50,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:29:50,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654120535] [2022-02-20 19:29:50,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:29:50,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:29:50,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:29:50,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:50,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:29:50,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:29:50,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:29:50,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:29:50,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:29:50,529 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:50,592 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-02-20 19:29:50,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:29:50,593 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:29:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:29:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2022-02-20 19:29:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2022-02-20 19:29:50,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2022-02-20 19:29:50,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:29:50,679 INFO L225 Difference]: With dead ends: 66 [2022-02-20 19:29:50,679 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 19:29:50,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:29:50,684 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:29:50,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:29:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 19:29:50,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 19:29:50,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:29:50,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:50,709 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:50,709 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:50,712 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 19:29:50,712 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 19:29:50,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:29:50,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:29:50,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 19:29:50,714 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 19:29:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:50,718 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 19:29:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 19:29:50,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:29:50,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:29:50,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:29:50,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:29:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 19:29:50,728 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 11 [2022-02-20 19:29:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:29:50,729 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 19:29:50,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 19:29:50,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 19:29:50,734 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:29:50,734 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:29:50,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 19:29:50,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 19:29:50,951 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:29:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:29:50,954 INFO L85 PathProgramCache]: Analyzing trace with hash -251444748, now seen corresponding path program 1 times [2022-02-20 19:29:50,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:29:50,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309275241] [2022-02-20 19:29:50,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:50,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:29:50,978 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:29:50,981 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551982831] [2022-02-20 19:29:50,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:50,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:29:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:29:50,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:29:50,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 19:29:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:29:51,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 19:29:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:29:51,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:29:51,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {254#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {254#true} is VALID [2022-02-20 19:29:51,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {254#true} is VALID [2022-02-20 19:29:51,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1; {254#true} is VALID [2022-02-20 19:29:51,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {254#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~0#1);assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {268#(< 0 |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:29:51,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {268#(< 0 |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {268#(< 0 |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-20 19:29:51,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#(< 0 |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~b#1 < 0;gcd_test_~b#1 := (if -gcd_test_~b#1 % 256 <= 127 then -gcd_test_~b#1 % 256 else -gcd_test_~b#1 % 256 - 256); {255#false} is VALID [2022-02-20 19:29:51,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {255#false} assume !(0 != gcd_test_~b#1); {255#false} is VALID [2022-02-20 19:29:51,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#false} gcd_test_#res#1 := gcd_test_~a#1; {255#false} is VALID [2022-02-20 19:29:51,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#false} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {255#false} is VALID [2022-02-20 19:29:51,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#false} assume 0 == __VERIFIER_assert_~cond#1; {255#false} is VALID [2022-02-20 19:29:51,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {255#false} assume !false; {255#false} is VALID [2022-02-20 19:29:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:29:51,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:29:51,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:29:51,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309275241] [2022-02-20 19:29:51,114 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:29:51,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551982831] [2022-02-20 19:29:51,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551982831] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:29:51,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:29:51,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:29:51,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37986935] [2022-02-20 19:29:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:29:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:29:51,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:29:51,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:29:51,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:29:51,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:29:51,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:29:51,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:29:51,125 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:51,156 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 19:29:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:29:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 19:29:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:29:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-20 19:29:51,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-20 19:29:51,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-02-20 19:29:51,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:29:51,186 INFO L225 Difference]: With dead ends: 36 [2022-02-20 19:29:51,186 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 19:29:51,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:29:51,188 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:29:51,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:29:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 19:29:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 19:29:51,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:29:51,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,191 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,191 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:51,193 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 19:29:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:29:51,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:29:51,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:29:51,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-02-20 19:29:51,194 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-02-20 19:29:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:51,195 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-02-20 19:29:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:29:51,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:29:51,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:29:51,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:29:51,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:29:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-02-20 19:29:51,198 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 11 [2022-02-20 19:29:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:29:51,198 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-02-20 19:29:51,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-02-20 19:29:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 19:29:51,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:29:51,199 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:29:51,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:29:51,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 19:29:51,416 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:29:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:29:51,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1673157840, now seen corresponding path program 1 times [2022-02-20 19:29:51,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:29:51,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668108590] [2022-02-20 19:29:51,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:51,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:29:51,432 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:29:51,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [554313716] [2022-02-20 19:29:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:51,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:29:51,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:29:51,434 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 19:29:51,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 19:29:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:29:51,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 19:29:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:29:51,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:29:51,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {430#true} is VALID [2022-02-20 19:29:51,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {430#true} is VALID [2022-02-20 19:29:51,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1; {430#true} is VALID [2022-02-20 19:29:51,593 INFO L290 TraceCheckUtils]: 3: Hoare triple {430#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~0#1);assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {461#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#1|)} is VALID [2022-02-20 19:29:51,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {461#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#1|)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {465#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:29:51,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {431#false} is VALID [2022-02-20 19:29:51,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-02-20 19:29:51,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:29:51,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 19:29:51,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-02-20 19:29:51,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {431#false} is VALID [2022-02-20 19:29:51,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {461#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#1|)} main1_#t~ret7#1 := gcd_test_#res#1;assume { :end_inline_gcd_test } true;assume -128 <= main1_#t~ret7#1 && main1_#t~ret7#1 <= 127;main1_~g~0#1 := main1_#t~ret7#1;havoc main1_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main1_~g~0#1 == main1_~y~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {465#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 19:29:51,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} gcd_test_#res#1 := gcd_test_~a#1; {461#(= |ULTIMATE.start_main1_~y~0#1| |ULTIMATE.start_gcd_test_#res#1|)} is VALID [2022-02-20 19:29:51,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(0 != gcd_test_~b#1); {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !!(0 != gcd_test_~b#1);gcd_test_~t~0#1 := gcd_test_~b#1;gcd_test_~b#1 := (if (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 <= 127 then (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 else (if gcd_test_~a#1 < 0 && 0 != gcd_test_~a#1 % gcd_test_~b#1 then (if gcd_test_~b#1 < 0 then gcd_test_~a#1 % gcd_test_~b#1 + gcd_test_~b#1 else gcd_test_~a#1 % gcd_test_~b#1 - gcd_test_~b#1) else gcd_test_~a#1 % gcd_test_~b#1) % 256 - 256);gcd_test_~a#1 := gcd_test_~t~0#1; {454#(= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume !(gcd_test_~b#1 < 0); {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,709 INFO L290 TraceCheckUtils]: 4: Hoare triple {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} assume gcd_test_~a#1 < 0;gcd_test_~a#1 := (if -gcd_test_~a#1 % 256 <= 127 then -gcd_test_~a#1 % 256 else -gcd_test_~a#1 % 256 - 256); {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,709 INFO L290 TraceCheckUtils]: 3: Hoare triple {430#true} assume main1_~y~0#1 > 0 && 0 == (if main1_~x~0#1 < 0 && 0 != main1_~x~0#1 % main1_~y~0#1 then (if main1_~y~0#1 < 0 then main1_~x~0#1 % main1_~y~0#1 + main1_~y~0#1 else main1_~x~0#1 % main1_~y~0#1 - main1_~y~0#1) else main1_~x~0#1 % main1_~y~0#1);assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main1_~x~0#1, main1_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1, gcd_test_~t~0#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1;havoc gcd_test_~t~0#1; {444#(= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_main1_~y~0#1|)} is VALID [2022-02-20 19:29:51,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume 0 != main_#t~nondet13#1;havoc main_#t~nondet13#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet5#1, main1_#t~nondet6#1, main1_#t~ret7#1, main1_~x~0#1, main1_~y~0#1, main1_~g~0#1;assume -128 <= main1_#t~nondet5#1 && main1_#t~nondet5#1 <= 127;main1_~x~0#1 := main1_#t~nondet5#1;havoc main1_#t~nondet5#1;assume -128 <= main1_#t~nondet6#1 && main1_#t~nondet6#1 <= 127;main1_~y~0#1 := main1_#t~nondet6#1;havoc main1_#t~nondet6#1;havoc main1_~g~0#1; {430#true} is VALID [2022-02-20 19:29:51,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet13#1, main_#t~ret14#1, main_#t~ret15#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647; {430#true} is VALID [2022-02-20 19:29:51,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {430#true} is VALID [2022-02-20 19:29:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:29:51,710 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:29:51,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668108590] [2022-02-20 19:29:51,710 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 19:29:51,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554313716] [2022-02-20 19:29:51,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554313716] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 19:29:51,711 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 19:29:51,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-02-20 19:29:51,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645926556] [2022-02-20 19:29:51,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 19:29:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 19:29:51,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:29:51,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:29:51,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 19:29:51,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:29:51,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 19:29:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:29:51,724 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:51,848 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 19:29:51,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:29:51,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 19:29:51,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:29:51,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-02-20 19:29:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-02-20 19:29:51,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-02-20 19:29:51,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:29:51,878 INFO L225 Difference]: With dead ends: 36 [2022-02-20 19:29:51,878 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 19:29:51,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:29:51,879 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:29:51,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:29:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 19:29:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 19:29:51,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:29:51,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,883 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,883 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:51,884 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 19:29:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:29:51,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:29:51,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:29:51,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-02-20 19:29:51,886 INFO L87 Difference]: Start difference. First operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-02-20 19:29:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:29:51,887 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 19:29:51,887 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:29:51,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:29:51,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:29:51,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:29:51,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:29:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 19:29:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-02-20 19:29:51,889 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 12 [2022-02-20 19:29:51,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:29:51,889 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-02-20 19:29:51,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:29:51,890 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-02-20 19:29:51,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 19:29:51,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:29:51,890 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:29:51,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 19:29:52,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:29:52,103 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:29:52,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:29:52,104 INFO L85 PathProgramCache]: Analyzing trace with hash -276630798, now seen corresponding path program 2 times [2022-02-20 19:29:52,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:29:52,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242609630] [2022-02-20 19:29:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:29:52,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:29:52,127 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 19:29:52,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1834181300] [2022-02-20 19:29:52,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 19:29:52,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 19:29:52,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:29:52,144 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) [2022-02-20 19:29:52,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 19:29:57,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 19:29:57,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 19:29:57,508 WARN L261 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 19:29:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 19:29:59,529 INFO L286 TraceCheckSpWp]: Computing forward predicates...