./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c --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/nla-digbench-scaling/fermat1-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:23:41,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:23:41,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:23:41,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:23:41,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:23:41,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:23:41,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:23:41,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:23:41,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:23:41,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:23:41,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:23:41,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:23:41,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:23:41,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:23:41,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:23:41,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:23:41,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:23:41,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:23:41,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:23:41,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:23:41,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:23:41,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:23:41,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:23:41,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:23:41,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:23:41,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:23:41,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:23:41,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:23:41,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:23:41,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:23:41,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:23:41,601 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:23:41,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:23:41,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:23:41,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:23:41,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:23:41,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:23:41,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:23:41,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:23:41,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:23:41,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:23:41,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:23:41,630 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:23:41,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:23:41,630 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:23:41,631 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:23:41,631 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:23:41,631 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:23:41,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:23:41,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:23:41,632 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:23:41,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:23:41,633 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:23:41,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:23:41,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:23:41,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:23:41,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:23:41,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:23:41,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:23:41,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:23:41,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:23:41,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:23:41,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:23:41,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:23:41,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:23:41,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:23:41,636 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:23:41,636 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:23:41,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:23:41,637 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 -> 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 [2022-02-20 17:23:41,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:23:41,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:23:41,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:23:41,817 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:23:41,818 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:23:41,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2022-02-20 17:23:41,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75427606c/0c4085cc03ed426f9c7ba993572ccdaf/FLAG6c55bc370 [2022-02-20 17:23:42,226 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:23:42,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2022-02-20 17:23:42,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75427606c/0c4085cc03ed426f9c7ba993572ccdaf/FLAG6c55bc370 [2022-02-20 17:23:42,244 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75427606c/0c4085cc03ed426f9c7ba993572ccdaf [2022-02-20 17:23:42,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:23:42,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:23:42,249 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:23:42,249 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:23:42,251 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:23:42,252 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4db9523c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42, skipping insertion in model container [2022-02-20 17:23:42,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:23:42,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:23:42,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/nla-digbench-scaling/fermat1-ll_unwindbound2.c[535,548] [2022-02-20 17:23:42,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:23:42,413 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:23:42,421 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/nla-digbench-scaling/fermat1-ll_unwindbound2.c[535,548] [2022-02-20 17:23:42,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:23:42,435 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:23:42,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42 WrapperNode [2022-02-20 17:23:42,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:23:42,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:23:42,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:23:42,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:23:42,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,487 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2022-02-20 17:23:42,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:23:42,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:23:42,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:23:42,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:23:42,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,501 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:23:42,502 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:23:42,502 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:23:42,502 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:23:42,503 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (1/1) ... [2022-02-20 17:23:42,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:23:42,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:42,527 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 17:23:42,533 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 17:23:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:23:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:23:42,551 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:23:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:23:42,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:23:42,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:23:42,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:23:42,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:23:42,590 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:23:42,591 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:23:42,709 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:23:42,713 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:23:42,713 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:23:42,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:23:42 BoogieIcfgContainer [2022-02-20 17:23:42,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:23:42,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:23:42,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:23:42,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:23:42,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:23:42" (1/3) ... [2022-02-20 17:23:42,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66049c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:23:42, skipping insertion in model container [2022-02-20 17:23:42,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:42" (2/3) ... [2022-02-20 17:23:42,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66049c9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:23:42, skipping insertion in model container [2022-02-20 17:23:42,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:23:42" (3/3) ... [2022-02-20 17:23:42,720 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2022-02-20 17:23:42,723 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:23:42,723 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:23:42,751 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:23:42,755 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 17:23:42,756 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:23:42,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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) [2022-02-20 17:23:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:23:42,787 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:42,788 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:42,788 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2022-02-20 17:23:42,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:42,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679729079] [2022-02-20 17:23:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:42,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:42,880 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:42,881 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778400222] [2022-02-20 17:23:42,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:42,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:42,891 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 17:23:42,896 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 17:23:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:42,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:23:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:42,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:43,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-02-20 17:23:43,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {35#true} is VALID [2022-02-20 17:23:43,067 INFO L272 TraceCheckUtils]: 2: Hoare triple {35#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {35#true} is VALID [2022-02-20 17:23:43,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 17:23:43,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-02-20 17:23:43,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#false} assume true; {36#false} is VALID [2022-02-20 17:23:43,069 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36#false} {35#true} #87#return; {36#false} is VALID [2022-02-20 17:23:43,070 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#false} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {36#false} is VALID [2022-02-20 17:23:43,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-02-20 17:23:43,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume 0 == ~cond;assume false; {36#false} is VALID [2022-02-20 17:23:43,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2022-02-20 17:23:43,071 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {36#false} {36#false} #89#return; {36#false} is VALID [2022-02-20 17:23:43,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {36#false} is VALID [2022-02-20 17:23:43,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-02-20 17:23:43,071 INFO L272 TraceCheckUtils]: 14: Hoare triple {36#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {36#false} is VALID [2022-02-20 17:23:43,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-02-20 17:23:43,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-02-20 17:23:43,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 17:23:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:23:43,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:43,074 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:43,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679729079] [2022-02-20 17:23:43,074 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:43,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778400222] [2022-02-20 17:23:43,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778400222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:43,076 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:43,076 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:23:43,078 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91767466] [2022-02-20 17:23:43,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:23:43,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:43,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:43,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:43,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:23:43,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:23:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:23:43,165 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:43,248 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-02-20 17:23:43,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:23:43,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:23:43,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:23:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:23:43,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2022-02-20 17:23:43,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:43,368 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:23:43,369 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:23:43,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 17:23:43,375 INFO L933 BasicCegarLoop]: 41 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, 41 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 17:23:43,377 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:23:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:23:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:23:43,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:43,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,402 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,402 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:43,408 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:23:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:23:43,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:43,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:43,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:23:43,409 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:23:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:43,411 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:23:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:23:43,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:43,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:43,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:43,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:23:43,415 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-02-20 17:23:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:43,416 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:23:43,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:43,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:23:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:23:43,418 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:43,418 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:43,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:23:43,634 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 17:23:43,635 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:43,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2022-02-20 17:23:43,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:43,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573757466] [2022-02-20 17:23:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:43,649 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:43,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [420072280] [2022-02-20 17:23:43,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:43,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:43,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:43,652 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 17:23:43,653 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 17:23:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:43,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:23:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:43,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:43,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,801 INFO L272 TraceCheckUtils]: 2: Hoare triple {271#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(<= ~counter~0 0)} ~cond := #in~cond; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,802 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(<= ~counter~0 0)} assume !(0 == ~cond); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(<= ~counter~0 0)} assume true; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,803 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {271#(<= ~counter~0 0)} {271#(<= ~counter~0 0)} #87#return; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,804 INFO L272 TraceCheckUtils]: 7: Hoare triple {271#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(<= ~counter~0 0)} ~cond := #in~cond; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= ~counter~0 0)} assume !(0 == ~cond); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(<= ~counter~0 0)} assume true; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,806 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {271#(<= ~counter~0 0)} {271#(<= ~counter~0 0)} #89#return; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:43,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {311#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:23:43,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {267#false} is VALID [2022-02-20 17:23:43,807 INFO L272 TraceCheckUtils]: 15: Hoare triple {267#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {267#false} is VALID [2022-02-20 17:23:43,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2022-02-20 17:23:43,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#false} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:23:43,808 INFO L290 TraceCheckUtils]: 18: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:23:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:43,808 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:43,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:43,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573757466] [2022-02-20 17:23:43,809 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:43,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420072280] [2022-02-20 17:23:43,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420072280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:43,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:43,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:23:43,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505326420] [2022-02-20 17:23:43,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:43,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:43,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:43,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:43,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:43,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:23:43,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:23:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:23:43,827 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:43,908 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 17:23:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:23:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:43,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:23:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:43,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:23:43,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-02-20 17:23:43,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:43,950 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:23:43,950 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:23:43,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:23:43,953 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:43,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:23:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:23:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:23:43,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:43,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,963 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,963 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:43,965 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:23:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:23:43,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:43,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:43,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:23:43,966 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:23:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:43,969 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:23:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:23:43,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:43,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:43,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:43,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:23:43,979 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-02-20 17:23:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:43,979 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:23:43,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:23:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:23:43,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:43,980 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:43,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:23:44,180 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 17:23:44,181 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2022-02-20 17:23:44,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:44,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403437473] [2022-02-20 17:23:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:44,195 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:44,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107722372] [2022-02-20 17:23:44,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:44,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:44,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:44,201 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 17:23:44,202 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 17:23:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:44,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:23:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:44,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:45,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {477#true} is VALID [2022-02-20 17:23:45,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {477#true} is VALID [2022-02-20 17:23:45,400 INFO L272 TraceCheckUtils]: 2: Hoare triple {477#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {477#true} is VALID [2022-02-20 17:23:45,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-02-20 17:23:45,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-02-20 17:23:45,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 17:23:45,401 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {477#true} {477#true} #87#return; {477#true} is VALID [2022-02-20 17:23:45,401 INFO L272 TraceCheckUtils]: 7: Hoare triple {477#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {477#true} is VALID [2022-02-20 17:23:45,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-02-20 17:23:45,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-02-20 17:23:45,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 17:23:45,402 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {477#true} {477#true} #89#return; {477#true} is VALID [2022-02-20 17:23:46,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:23:46,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:23:46,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:23:46,130 INFO L272 TraceCheckUtils]: 15: Hoare triple {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:46,131 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:46,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {478#false} is VALID [2022-02-20 17:23:46,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-02-20 17:23:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:46,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:46,132 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:46,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403437473] [2022-02-20 17:23:46,132 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:46,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107722372] [2022-02-20 17:23:46,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107722372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:46,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:46,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:23:46,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189185904] [2022-02-20 17:23:46,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:46,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:46,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:46,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:49,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:49,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:23:49,571 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:23:49,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:23:49,571 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:52,682 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-02-20 17:23:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:23:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:52,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:52,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 17:23:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:52,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 17:23:52,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-02-20 17:23:55,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:55,657 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:23:55,657 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:23:55,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:23:55,658 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:55,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 110 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 17:23:55,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:23:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-02-20 17:23:55,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:55,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,672 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,673 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:55,674 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:23:55,675 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-02-20 17:23:55,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:55,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:55,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 17:23:55,676 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 17:23:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:55,678 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:23:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-02-20 17:23:55,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:55,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:55,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:55,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-02-20 17:23:55,682 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2022-02-20 17:23:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:55,682 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-02-20 17:23:55,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 17:23:55,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:23:55,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:55,683 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:55,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:23:55,899 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 17:23:55,899 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -82041861, now seen corresponding path program 1 times [2022-02-20 17:23:55,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:55,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783558441] [2022-02-20 17:23:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:55,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:55,909 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:55,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425916556] [2022-02-20 17:23:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:55,911 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 17:23:55,912 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 17:23:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:55,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:23:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:55,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:56,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {764#true} is VALID [2022-02-20 17:23:56,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {764#true} is VALID [2022-02-20 17:23:56,090 INFO L272 TraceCheckUtils]: 2: Hoare triple {764#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,091 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {764#true} {764#true} #87#return; {764#true} is VALID [2022-02-20 17:23:56,091 INFO L272 TraceCheckUtils]: 7: Hoare triple {764#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,093 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {764#true} {764#true} #89#return; {764#true} is VALID [2022-02-20 17:23:56,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {764#true} is VALID [2022-02-20 17:23:56,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#true} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,094 INFO L272 TraceCheckUtils]: 15: Hoare triple {764#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {764#true} ~cond := #in~cond; {817#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:56,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {817#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,097 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} {764#true} #91#return; {828#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:23:56,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} assume !(0 != main_~r~0#1); {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:23:56,099 INFO L272 TraceCheckUtils]: 21: Hoare triple {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:56,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:56,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {765#false} is VALID [2022-02-20 17:23:56,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#false} assume !false; {765#false} is VALID [2022-02-20 17:23:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:56,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:23:56,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#false} assume !false; {765#false} is VALID [2022-02-20 17:23:56,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {765#false} is VALID [2022-02-20 17:23:56,459 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:56,459 INFO L272 TraceCheckUtils]: 21: Hoare triple {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:56,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {859#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} assume !(0 != main_~r~0#1); {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:23:56,461 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} {764#true} #91#return; {859#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} is VALID [2022-02-20 17:23:56,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {872#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {764#true} ~cond := #in~cond; {872#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:23:56,462 INFO L272 TraceCheckUtils]: 15: Hoare triple {764#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#true} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {764#true} is VALID [2022-02-20 17:23:56,463 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {764#true} {764#true} #89#return; {764#true} is VALID [2022-02-20 17:23:56,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,463 INFO L272 TraceCheckUtils]: 7: Hoare triple {764#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,464 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {764#true} {764#true} #87#return; {764#true} is VALID [2022-02-20 17:23:56,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,464 INFO L272 TraceCheckUtils]: 2: Hoare triple {764#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {764#true} is VALID [2022-02-20 17:23:56,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {764#true} is VALID [2022-02-20 17:23:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:56,465 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:56,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783558441] [2022-02-20 17:23:56,465 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:56,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425916556] [2022-02-20 17:23:56,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425916556] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:23:56,465 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:23:56,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:23:56,466 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389047377] [2022-02-20 17:23:56,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:23:56,466 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-02-20 17:23:56,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:56,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:56,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:23:56,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:56,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:23:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:23:56,487 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:56,776 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-20 17:23:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:23:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-02-20 17:23:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:56,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 17:23:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 17:23:56,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-02-20 17:23:56,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:56,816 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:23:56,816 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:23:56,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:23:56,817 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:56,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 114 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:23:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:23:56,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-02-20 17:23:56,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:56,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:56,825 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:56,825 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:56,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:56,826 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:23:56,827 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:23:56,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:56,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:56,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-02-20 17:23:56,827 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 48 states. [2022-02-20 17:23:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:56,829 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:23:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:23:56,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:56,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:56,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:56,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-02-20 17:23:56,831 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 25 [2022-02-20 17:23:56,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:56,831 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-02-20 17:23:56,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 17:23:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:23:56,832 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:56,832 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:56,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:23:57,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,047 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:57,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1145481658, now seen corresponding path program 1 times [2022-02-20 17:23:57,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:57,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555168900] [2022-02-20 17:23:57,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:57,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:57,057 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:57,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [285096773] [2022-02-20 17:23:57,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:57,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:57,058 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) [2022-02-20 17:23:57,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:23:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:57,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:23:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:57,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:57,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {1143#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,233 INFO L272 TraceCheckUtils]: 2: Hoare triple {1143#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {1143#(<= ~counter~0 0)} ~cond := #in~cond; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {1143#(<= ~counter~0 0)} assume !(0 == ~cond); {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {1143#(<= ~counter~0 0)} assume true; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,235 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1143#(<= ~counter~0 0)} {1143#(<= ~counter~0 0)} #87#return; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,235 INFO L272 TraceCheckUtils]: 7: Hoare triple {1143#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {1143#(<= ~counter~0 0)} ~cond := #in~cond; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {1143#(<= ~counter~0 0)} assume !(0 == ~cond); {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {1143#(<= ~counter~0 0)} assume true; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,237 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1143#(<= ~counter~0 0)} {1143#(<= ~counter~0 0)} #89#return; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {1143#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {1143#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:57,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {1143#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,239 INFO L272 TraceCheckUtils]: 15: Hoare triple {1183#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {1183#(<= ~counter~0 1)} ~cond := #in~cond; {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,252 INFO L290 TraceCheckUtils]: 17: Hoare triple {1183#(<= ~counter~0 1)} assume !(0 == ~cond); {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(<= ~counter~0 1)} assume true; {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,253 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1183#(<= ~counter~0 1)} {1183#(<= ~counter~0 1)} #91#return; {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#(<= ~counter~0 1)} assume !!(0 != main_~r~0#1); {1183#(<= ~counter~0 1)} is VALID [2022-02-20 17:23:57,254 INFO L290 TraceCheckUtils]: 21: Hoare triple {1183#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1208#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:23:57,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {1208#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 2);havoc main_#t~post7#1; {1139#false} is VALID [2022-02-20 17:23:57,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {1139#false} main_#t~post8#1 := ~counter~0;~counter~0 := 1 + main_#t~post8#1; {1139#false} is VALID [2022-02-20 17:23:57,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {1139#false} assume !(main_#t~post8#1 < 2);havoc main_#t~post8#1; {1139#false} is VALID [2022-02-20 17:23:57,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {1139#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1139#false} is VALID [2022-02-20 17:23:57,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {1139#false} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {1139#false} is VALID [2022-02-20 17:23:57,255 INFO L272 TraceCheckUtils]: 27: Hoare triple {1139#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {1139#false} is VALID [2022-02-20 17:23:57,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {1139#false} ~cond := #in~cond; {1139#false} is VALID [2022-02-20 17:23:57,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {1139#false} assume 0 == ~cond; {1139#false} is VALID [2022-02-20 17:23:57,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2022-02-20 17:23:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:57,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:57,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:57,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555168900] [2022-02-20 17:23:57,256 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:57,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285096773] [2022-02-20 17:23:57,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285096773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:57,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:57,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:23:57,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485860694] [2022-02-20 17:23:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:57,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 17:23:57,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:57,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:23:57,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:57,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:23:57,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:23:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:23:57,274 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:23:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:57,351 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-20 17:23:57,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:23:57,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-02-20 17:23:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:23:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-02-20 17:23:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:23:57,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-02-20 17:23:57,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-02-20 17:23:57,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:57,399 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:23:57,399 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:23:57,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:23:57,400 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:57,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:23:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:23:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 17:23:57,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:57,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:23:57,410 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:23:57,410 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:23:57,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:57,411 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-20 17:23:57,411 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 17:23:57,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:57,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:57,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 40 states. [2022-02-20 17:23:57,412 INFO L87 Difference]: Start difference. First operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 40 states. [2022-02-20 17:23:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:57,413 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-02-20 17:23:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 17:23:57,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:57,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:57,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:57,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:23:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-02-20 17:23:57,415 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 31 [2022-02-20 17:23:57,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:57,416 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-02-20 17:23:57,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:23:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-02-20 17:23:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 17:23:57,416 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:57,416 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:57,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:23:57,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,636 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1102972225, now seen corresponding path program 1 times [2022-02-20 17:23:57,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:57,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672668427] [2022-02-20 17:23:57,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:57,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:57,650 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:57,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [883766289] [2022-02-20 17:23:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:57,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:57,652 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:23:57,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:23:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:23:57,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:23:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:23:57,731 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:23:57,731 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:23:57,732 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:23:57,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:23:57,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,946 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 17:23:57,947 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:23:57,958 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); [2022-02-20 17:23:57,963 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:23:57,965 INFO L158 Benchmark]: Toolchain (without parser) took 15718.58ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 67.5MB in the beginning and 59.2MB in the end (delta: 8.3MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,966 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 75.2MB in the beginning and 75.2MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:23:57,966 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.41ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 76.9MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.47ms. Allocated memory is still 102.8MB. Free memory was 76.9MB in the beginning and 75.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,966 INFO L158 Benchmark]: Boogie Preprocessor took 12.72ms. Allocated memory is still 102.8MB. Free memory was 75.3MB in the beginning and 74.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:23:57,966 INFO L158 Benchmark]: RCFGBuilder took 213.04ms. Allocated memory is still 102.8MB. Free memory was 74.3MB in the beginning and 61.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,966 INFO L158 Benchmark]: TraceAbstraction took 15248.95ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,967 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 75.2MB in the beginning and 75.2MB in the end (delta: 26.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.41ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 76.9MB in the end (delta: -9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.47ms. Allocated memory is still 102.8MB. Free memory was 76.9MB in the beginning and 75.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.72ms. Allocated memory is still 102.8MB. Free memory was 75.3MB in the beginning and 74.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 213.04ms. Allocated memory is still 102.8MB. Free memory was 74.3MB in the beginning and 61.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15248.95ms. Allocated memory was 102.8MB in the beginning and 125.8MB in the end (delta: 23.1MB). Free memory was 61.6MB in the beginning and 59.2MB in the end (delta: 2.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:23:57,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/nla-digbench-scaling/fermat1-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:23:59,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:23:59,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:23:59,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:23:59,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:23:59,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:23:59,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:23:59,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:23:59,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:23:59,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:23:59,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:23:59,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:23:59,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:23:59,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:23:59,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:23:59,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:23:59,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:23:59,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:23:59,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:23:59,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:23:59,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:23:59,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:23:59,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:23:59,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:23:59,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:23:59,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:23:59,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:23:59,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:23:59,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:23:59,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:23:59,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:23:59,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:23:59,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:23:59,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:23:59,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:23:59,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:23:59,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:23:59,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:23:59,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:23:59,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:23:59,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:23:59,571 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:23:59,587 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:23:59,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:23:59,588 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:23:59,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:23:59,589 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:23:59,589 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:23:59,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:23:59,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:23:59,590 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:23:59,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:23:59,590 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:23:59,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:23:59,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:23:59,591 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:23:59,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:23:59,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:23:59,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:23:59,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:23:59,592 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:23:59,592 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:23:59,592 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:23:59,592 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:23:59,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:23:59,593 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:23:59,593 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:23:59,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:23:59,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:23:59,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:23:59,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:23:59,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:23:59,594 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:23:59,594 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:23:59,594 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:23:59,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:23:59,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:23:59,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:23:59,595 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 [2022-02-20 17:23:59,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:23:59,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:23:59,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:23:59,876 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:23:59,878 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:23:59,879 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2022-02-20 17:23:59,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60cda526/8998c5d4b3334b59befbdc3b345accc4/FLAG4e08d6e1b [2022-02-20 17:24:00,231 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:24:00,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2022-02-20 17:24:00,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60cda526/8998c5d4b3334b59befbdc3b345accc4/FLAG4e08d6e1b [2022-02-20 17:24:00,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60cda526/8998c5d4b3334b59befbdc3b345accc4 [2022-02-20 17:24:00,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:24:00,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:24:00,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:24:00,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:24:00,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:24:00,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34614cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00, skipping insertion in model container [2022-02-20 17:24:00,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:24:00,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:24:00,746 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/nla-digbench-scaling/fermat1-ll_unwindbound2.c[535,548] [2022-02-20 17:24:00,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:24:00,785 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:24:00,794 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/nla-digbench-scaling/fermat1-ll_unwindbound2.c[535,548] [2022-02-20 17:24:00,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:24:00,835 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:24:00,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00 WrapperNode [2022-02-20 17:24:00,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:24:00,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:24:00,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:24:00,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:24:00,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,890 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-02-20 17:24:00,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:24:00,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:24:00,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:24:00,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:24:00,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:24:00,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:24:00,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:24:00,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:24:00,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:24:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:24:00,947 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 17:24:00,962 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 17:24:00,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:24:00,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:24:00,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:24:00,982 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:24:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:24:00,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:24:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:24:00,983 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:24:01,038 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:24:01,039 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:24:01,240 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:24:01,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:24:01,245 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:24:01,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:24:01 BoogieIcfgContainer [2022-02-20 17:24:01,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:24:01,247 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:24:01,247 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:24:01,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:24:01,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:24:00" (1/3) ... [2022-02-20 17:24:01,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b79c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:24:01, skipping insertion in model container [2022-02-20 17:24:01,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (2/3) ... [2022-02-20 17:24:01,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b79c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:24:01, skipping insertion in model container [2022-02-20 17:24:01,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:24:01" (3/3) ... [2022-02-20 17:24:01,251 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2022-02-20 17:24:01,254 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:24:01,254 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:24:01,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:24:01,329 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 17:24:01,329 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:24:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 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) [2022-02-20 17:24:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:24:01,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:24:01,355 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:24:01,355 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:24:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:24:01,362 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2022-02-20 17:24:01,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:24:01,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644869453] [2022-02-20 17:24:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:24:01,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:24:01,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:24:01,376 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:24:01,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:24:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:01,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:24:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:01,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:24:01,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {35#true} is VALID [2022-02-20 17:24:01,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {35#true} is VALID [2022-02-20 17:24:01,595 INFO L272 TraceCheckUtils]: 2: Hoare triple {35#true} call assume_abort_if_not((if ~bvslt64(~bvmul64(~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64), ~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64)), ~sign_extendFrom32To64(main_~A~0#1)) then 1bv32 else 0bv32)); {35#true} is VALID [2022-02-20 17:24:01,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 17:24:01,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#true} assume 0bv32 == ~cond;assume false; {35#true} is VALID [2022-02-20 17:24:01,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} assume true; {35#true} is VALID [2022-02-20 17:24:01,596 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35#true} {35#true} #87#return; {35#true} is VALID [2022-02-20 17:24:01,596 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {35#true} is VALID [2022-02-20 17:24:01,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 17:24:01,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0bv32 == ~cond;assume false; {35#true} is VALID [2022-02-20 17:24:01,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#true} assume true; {35#true} is VALID [2022-02-20 17:24:01,597 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {35#true} {35#true} #89#return; {35#true} is VALID [2022-02-20 17:24:01,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} main_~u~0#1 := ~bvadd64(1bv64, ~bvmul64(2bv64, ~sign_extendFrom32To64(main_~R~0#1)));main_~v~0#1 := 1bv64;main_~r~0#1 := ~bvsub64(~bvmul64(~sign_extendFrom32To64(main_~R~0#1), ~sign_extendFrom32To64(main_~R~0#1)), ~sign_extendFrom32To64(main_~A~0#1)); {35#true} is VALID [2022-02-20 17:24:01,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 17:24:01,599 INFO L272 TraceCheckUtils]: 14: Hoare triple {36#false} call __VERIFIER_assert((if ~bvmul64(4bv64, ~sign_extendFrom32To64(main_~A~0#1)) == ~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~u~0#1, main_~u~0#1), ~bvmul64(main_~v~0#1, main_~v~0#1)), ~bvmul64(2bv64, main_~u~0#1)), ~bvmul64(2bv64, main_~v~0#1)) then 1bv32 else 0bv32)); {36#false} is VALID [2022-02-20 17:24:01,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-02-20 17:24:01,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume 0bv32 == ~cond; {36#false} is VALID [2022-02-20 17:24:01,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 17:24:01,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:24:01,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:24:01,601 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:24:01,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644869453] [2022-02-20 17:24:01,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644869453] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:24:01,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:24:01,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:24:01,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629293090] [2022-02-20 17:24:01,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:24:01,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:24:01,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:24:01,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:01,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:01,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:24:01,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:24:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:24:01,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:24:01,735 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:03,069 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-02-20 17:24:03,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:24:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:24:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:24:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:24:03,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:24:03,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2022-02-20 17:24:04,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:04,086 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:24:04,086 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:24:04,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 17:24:04,090 INFO L933 BasicCegarLoop]: 41 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, 41 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 17:24:04,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:24:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:24:04,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:24:04,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:24:04,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:04,110 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:04,111 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:04,114 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:24:04,114 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:24:04,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:04,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:04,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:24:04,115 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:24:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:04,118 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:24:04,118 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:24:04,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:04,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:04,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:24:04,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:24:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:24:04,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-02-20 17:24:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:24:04,122 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:24:04,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:04,122 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:24:04,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:24:04,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:24:04,127 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:24:04,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:24:04,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:24:04,337 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:24:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:24:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2022-02-20 17:24:04,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:24:04,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832125164] [2022-02-20 17:24:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:24:04,339 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:24:04,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:24:04,340 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:24:04,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:24:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:04,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:24:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:04,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:24:04,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,597 INFO L272 TraceCheckUtils]: 2: Hoare triple {271#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if ~bvslt64(~bvmul64(~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64), ~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64)), ~sign_extendFrom32To64(main_~A~0#1)) then 1bv32 else 0bv32)); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,598 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume true; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,604 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {271#(= ~counter~0 (_ bv0 32))} {271#(= ~counter~0 (_ bv0 32))} #87#return; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,605 INFO L272 TraceCheckUtils]: 7: Hoare triple {271#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume true; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,607 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {271#(= ~counter~0 (_ bv0 32))} {271#(= ~counter~0 (_ bv0 32))} #89#return; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#(= ~counter~0 (_ bv0 32))} main_~u~0#1 := ~bvadd64(1bv64, ~bvmul64(2bv64, ~sign_extendFrom32To64(main_~R~0#1)));main_~v~0#1 := 1bv64;main_~r~0#1 := ~bvsub64(~bvmul64(~sign_extendFrom32To64(main_~R~0#1), ~sign_extendFrom32To64(main_~R~0#1)), ~sign_extendFrom32To64(main_~A~0#1)); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {311#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:24:04,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 2bv32);havoc main_#t~post6#1; {267#false} is VALID [2022-02-20 17:24:04,609 INFO L272 TraceCheckUtils]: 15: Hoare triple {267#false} call __VERIFIER_assert((if ~bvmul64(4bv64, ~sign_extendFrom32To64(main_~A~0#1)) == ~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~u~0#1, main_~u~0#1), ~bvmul64(main_~v~0#1, main_~v~0#1)), ~bvmul64(2bv64, main_~u~0#1)), ~bvmul64(2bv64, main_~v~0#1)) then 1bv32 else 0bv32)); {267#false} is VALID [2022-02-20 17:24:04,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2022-02-20 17:24:04,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#false} assume 0bv32 == ~cond; {267#false} is VALID [2022-02-20 17:24:04,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:24:04,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:24:04,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:24:04,610 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:24:04,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832125164] [2022-02-20 17:24:04,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832125164] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:24:04,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:24:04,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:24:04,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374415220] [2022-02-20 17:24:04,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:24:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:24:04,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:24:04,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:04,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:04,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:24:04,718 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:24:04,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:24:04,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:24:04,719 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:07,569 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 17:24:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:24:07,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:24:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:24:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:07,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:24:07,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:24:07,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-02-20 17:24:07,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:07,990 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:24:07,990 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:24:07,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:24:07,991 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:24:07,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:24:07,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:24:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:24:07,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:24:07,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:07,996 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:07,996 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:07,998 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:24:07,998 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:24:07,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:07,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:07,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:24:07,999 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:24:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:08,001 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:24:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:24:08,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:08,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:08,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:24:08,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:24:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:24:08,003 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-02-20 17:24:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:24:08,004 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:24:08,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:24:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:24:08,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:24:08,005 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:24:08,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:24:08,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:24:08,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:24:08,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:24:08,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2022-02-20 17:24:08,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:24:08,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348266393] [2022-02-20 17:24:08,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:24:08,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:24:08,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:24:08,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:24:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process