./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.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/fermat2-ll_unwindbound1.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 6568b5930df9b96ff5e807ba48758caa6128d98ba24e8c1d6b9a86c6290462f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:01,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:01,677 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:01,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:01,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:01,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:01,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:01,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:01,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:01,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:01,712 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:01,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:01,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:01,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:01,718 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:01,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:01,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:01,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:01,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:01,726 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:01,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:01,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:01,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:01,731 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:01,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:01,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:01,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:01,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:01,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:01,736 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:01,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:01,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:01,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:01,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:01,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:01,739 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:01,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:01,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:01,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:01,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:01,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:01,742 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:25:01,761 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:01,762 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:01,762 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:01,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:01,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:01,762 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:01,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:01,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:01,763 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:01,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:01,763 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:01,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:25:01,763 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:01,763 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:01,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:01,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:01,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:01,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:01,765 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 -> 6568b5930df9b96ff5e807ba48758caa6128d98ba24e8c1d6b9a86c6290462f1 [2022-02-20 17:25:01,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:01,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:01,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:01,963 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:01,964 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:01,965 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2022-02-20 17:25:02,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da6702d4/e39d66ad8dc24e91bc64238d941abe3d/FLAGd7870526f [2022-02-20 17:25:02,382 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:02,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2022-02-20 17:25:02,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da6702d4/e39d66ad8dc24e91bc64238d941abe3d/FLAGd7870526f [2022-02-20 17:25:02,402 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7da6702d4/e39d66ad8dc24e91bc64238d941abe3d [2022-02-20 17:25:02,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:02,405 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:02,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:02,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:02,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:02,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d80fd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02, skipping insertion in model container [2022-02-20 17:25:02,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,418 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:02,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:02,564 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/fermat2-ll_unwindbound1.c[524,537] [2022-02-20 17:25:02,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:02,601 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:02,611 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/fermat2-ll_unwindbound1.c[524,537] [2022-02-20 17:25:02,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:02,641 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:02,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02 WrapperNode [2022-02-20 17:25:02,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:02,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:02,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:02,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:02,647 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:25:02" (1/1) ... [2022-02-20 17:25:02,652 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:25:02" (1/1) ... [2022-02-20 17:25:02,670 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-02-20 17:25:02,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:02,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:02,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:02,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:02,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:02,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:02,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:02,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:02,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (1/1) ... [2022-02-20 17:25:02,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:02,707 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:25:02,711 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:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:25:02,734 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:25:02,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:02,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:02,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:02,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:02,775 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:02,776 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:02,881 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:02,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:02,886 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:02,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:02 BoogieIcfgContainer [2022-02-20 17:25:02,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:02,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:02,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:02,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:02,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:02" (1/3) ... [2022-02-20 17:25:02,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ef644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:02, skipping insertion in model container [2022-02-20 17:25:02,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:02" (2/3) ... [2022-02-20 17:25:02,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ef644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:02, skipping insertion in model container [2022-02-20 17:25:02,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:02" (3/3) ... [2022-02-20 17:25:02,904 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound1.c [2022-02-20 17:25:02,908 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:02,908 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:02,964 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:02,969 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:25:02,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:02,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:02,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:25:02,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:02,990 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:02,991 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:02,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-02-20 17:25:03,005 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:03,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071303954] [2022-02-20 17:25:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:03,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:03,117 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:03,119 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1063074855] [2022-02-20 17:25:03,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:03,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:03,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:03,124 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:25:03,125 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:25:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:03,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:25:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:03,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:03,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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; {28#true} is VALID [2022-02-20 17:25:03,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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~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; {28#true} is VALID [2022-02-20 17:25:03,280 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#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)); {28#true} is VALID [2022-02-20 17:25:03,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:25:03,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:25:03,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:25:03,281 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #56#return; {29#false} is VALID [2022-02-20 17:25:03,282 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#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)); {29#false} is VALID [2022-02-20 17:25:03,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:25:03,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:25:03,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:25:03,282 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29#false} {29#false} #58#return; {29#false} is VALID [2022-02-20 17:25:03,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#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; {29#false} is VALID [2022-02-20 17:25:03,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-02-20 17:25:03,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {29#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)); {29#false} is VALID [2022-02-20 17:25:03,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:25:03,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-02-20 17:25:03,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:25:03,284 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:25:03,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:03,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:03,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071303954] [2022-02-20 17:25:03,284 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:03,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063074855] [2022-02-20 17:25:03,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063074855] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:03,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:03,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:03,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500707958] [2022-02-20 17:25:03,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:03,290 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:25:03,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:03,293 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:25:03,316 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:25:03,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:03,317 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:03,339 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 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:25:03,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:03,388 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:25:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:03,389 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:25:03,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:03,391 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:25:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:03,397 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:25:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:03,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 17:25:03,468 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:25:03,476 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:25:03,476 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:25:03,479 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:25:03,482 INFO L933 BasicCegarLoop]: 29 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, 29 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:25:03,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:25:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:25:03,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:03,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:03,507 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:03,508 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:03,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:03,511 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:03,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:03,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:03,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:03,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:03,516 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:03,520 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:03,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:03,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:03,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:03,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 17:25:03,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-02-20 17:25:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:03,523 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 17:25:03,523 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:25:03,524 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:03,524 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:03,524 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:25:03,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:03,737 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:25:03,738 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:03,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:03,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-02-20 17:25:03,740 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:03,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655534257] [2022-02-20 17:25:03,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:03,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:03,764 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:03,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256704858] [2022-02-20 17:25:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:03,766 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:25:03,767 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:25:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:03,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:25:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:03,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:03,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#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; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(<= ~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~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; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,929 INFO L272 TraceCheckUtils]: 2: Hoare triple {220#(<= ~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)); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(<= ~counter~0 0)} ~cond := #in~cond; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#(<= ~counter~0 0)} assume !(0 == ~cond); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#(<= ~counter~0 0)} assume true; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,931 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {220#(<= ~counter~0 0)} {220#(<= ~counter~0 0)} #56#return; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,932 INFO L272 TraceCheckUtils]: 7: Hoare triple {220#(<= ~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)); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(<= ~counter~0 0)} ~cond := #in~cond; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(<= ~counter~0 0)} assume !(0 == ~cond); {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(<= ~counter~0 0)} assume true; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,933 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {220#(<= ~counter~0 0)} {220#(<= ~counter~0 0)} #58#return; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(<= ~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; {220#(<= ~counter~0 0)} is VALID [2022-02-20 17:25:03,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {220#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {260#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:25:03,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {260#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {216#false} is VALID [2022-02-20 17:25:03,935 INFO L272 TraceCheckUtils]: 15: Hoare triple {216#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)); {216#false} is VALID [2022-02-20 17:25:03,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-02-20 17:25:03,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {216#false} assume 0 == ~cond; {216#false} is VALID [2022-02-20 17:25:03,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-02-20 17:25:03,943 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:25:03,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:03,943 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:03,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655534257] [2022-02-20 17:25:03,944 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:03,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256704858] [2022-02-20 17:25:03,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256704858] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:03,945 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:03,945 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:25:03,945 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590018351] [2022-02-20 17:25:03,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:03,946 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:25:03,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:03,946 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:25:03,958 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:25:03,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:25:03,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:03,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:25:03,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:03,960 INFO L87 Difference]: Start difference. First operand 21 states and 25 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:25:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:04,003 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 17:25:04,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:25:04,004 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:25:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:04,004 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:25:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:04,005 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:25:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:04,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 17:25:04,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:04,035 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:25:04,035 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:25:04,035 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:25:04,037 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:04,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:04,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:25:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:25:04,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:04,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:04,047 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:04,047 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:04,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:04,050 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:04,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:04,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:04,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:04,052 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:04,054 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:04,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:04,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:04,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:04,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:04,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:25:04,058 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-02-20 17:25:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:04,058 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:25:04,059 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:25:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:04,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:04,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:04,061 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:25:04,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:04,275 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:25:04,276 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-02-20 17:25:04,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:04,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929255320] [2022-02-20 17:25:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:04,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:04,294 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:04,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1502467915] [2022-02-20 17:25:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:04,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:04,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:04,296 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:25:04,297 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:25:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:04,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:25:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:04,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:04,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {392#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; {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#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~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; {392#true} is VALID [2022-02-20 17:25:04,632 INFO L272 TraceCheckUtils]: 2: Hoare triple {392#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)); {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {392#true} assume true; {392#true} is VALID [2022-02-20 17:25:04,632 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {392#true} {392#true} #56#return; {392#true} is VALID [2022-02-20 17:25:04,632 INFO L272 TraceCheckUtils]: 7: Hoare triple {392#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)); {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {392#true} ~cond := #in~cond; {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#true} assume !(0 == ~cond); {392#true} is VALID [2022-02-20 17:25:04,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#true} assume true; {392#true} is VALID [2022-02-20 17:25:04,633 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {392#true} {392#true} #58#return; {392#true} is VALID [2022-02-20 17:25:06,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {392#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; {433#(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:25:06,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {433#(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; {433#(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:25:06,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {433#(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 < 1);havoc main_#t~post6#1; {433#(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:25:07,596 INFO L272 TraceCheckUtils]: 15: Hoare triple {433#(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)); {443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:07,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:07,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {393#false} is VALID [2022-02-20 17:25:07,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {393#false} assume !false; {393#false} is VALID [2022-02-20 17:25:07,598 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:25:07,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:07,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:07,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929255320] [2022-02-20 17:25:07,598 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:07,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502467915] [2022-02-20 17:25:07,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502467915] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:07,598 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:07,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:25:07,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759582198] [2022-02-20 17:25:07,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:07,599 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:25:07,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:07,599 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:25:09,419 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:25:09,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:25:09,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:09,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:25:09,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:25:09,420 INFO L87 Difference]: Start difference. First operand 23 states and 27 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:25:12,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:25:12,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:12,453 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 17:25:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:25:12,453 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:25:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:12,454 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:25:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-20 17:25:12,455 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:25:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-02-20 17:25:12,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 39 transitions. [2022-02-20 17:25:13,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:13,740 INFO L225 Difference]: With dead ends: 33 [2022-02-20 17:25:13,741 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 17:25:13,741 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:25:13,742 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:13,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 17:25:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 17:25:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-02-20 17:25:13,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:13,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:13,748 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:13,748 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:13,750 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 17:25:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 17:25:13,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:13,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:13,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-02-20 17:25:13,751 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 31 states. [2022-02-20 17:25:13,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:13,752 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2022-02-20 17:25:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 17:25:13,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:13,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:13,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:13,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 17:25:13,755 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-02-20 17:25:13,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:13,755 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 17:25:13,755 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:25:13,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 17:25:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:25:13,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:13,756 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:25:13,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:13,956 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:25:13,957 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:13,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:13,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-02-20 17:25:13,957 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:13,957 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609745330] [2022-02-20 17:25:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:13,965 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:13,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413500633] [2022-02-20 17:25:13,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:13,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:13,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:13,967 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:25:13,968 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:25:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:14,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:25:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:14,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:14,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#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; {599#true} is VALID [2022-02-20 17:25:14,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#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~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; {599#true} is VALID [2022-02-20 17:25:14,155 INFO L272 TraceCheckUtils]: 2: Hoare triple {599#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)); {599#true} is VALID [2022-02-20 17:25:14,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {599#true} ~cond := #in~cond; {599#true} is VALID [2022-02-20 17:25:14,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {599#true} assume !(0 == ~cond); {599#true} is VALID [2022-02-20 17:25:14,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {599#true} assume true; {599#true} is VALID [2022-02-20 17:25:14,155 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {599#true} {599#true} #56#return; {599#true} is VALID [2022-02-20 17:25:14,155 INFO L272 TraceCheckUtils]: 7: Hoare triple {599#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)); {599#true} is VALID [2022-02-20 17:25:14,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#true} ~cond := #in~cond; {599#true} is VALID [2022-02-20 17:25:14,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#true} assume !(0 == ~cond); {599#true} is VALID [2022-02-20 17:25:14,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#true} assume true; {599#true} is VALID [2022-02-20 17:25:14,156 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {599#true} {599#true} #58#return; {599#true} is VALID [2022-02-20 17:25:14,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#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; {599#true} is VALID [2022-02-20 17:25:14,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {599#true} is VALID [2022-02-20 17:25:14,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {599#true} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {599#true} is VALID [2022-02-20 17:25:14,157 INFO L272 TraceCheckUtils]: 15: Hoare triple {599#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)); {599#true} is VALID [2022-02-20 17:25:14,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#true} ~cond := #in~cond; {652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:14,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:14,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:14,165 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {656#(not (= |__VERIFIER_assert_#in~cond| 0))} {599#true} #60#return; {663#(= (+ (* |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:25:14,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {663#(= (+ (* |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); {667#(= (+ (* |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:25:14,166 INFO L272 TraceCheckUtils]: 21: Hoare triple {667#(= (+ (* |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)); {671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:14,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:14,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {600#false} is VALID [2022-02-20 17:25:14,167 INFO L290 TraceCheckUtils]: 24: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 17:25:14,167 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:25:14,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:25:14,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {600#false} assume !false; {600#false} is VALID [2022-02-20 17:25:14,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {675#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {600#false} is VALID [2022-02-20 17:25:14,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {671#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {675#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:25:14,509 INFO L272 TraceCheckUtils]: 21: Hoare triple {667#(= (+ (* |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)); {671#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:25:14,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {694#(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); {667#(= (+ (* |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:25:14,511 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {656#(not (= |__VERIFIER_assert_#in~cond| 0))} {599#true} #60#return; {694#(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:25:14,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:14,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {707#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:25:14,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#true} ~cond := #in~cond; {707#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:25:14,512 INFO L272 TraceCheckUtils]: 15: Hoare triple {599#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)); {599#true} is VALID [2022-02-20 17:25:14,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {599#true} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {599#true} is VALID [2022-02-20 17:25:14,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {599#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {599#true} is VALID [2022-02-20 17:25:14,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {599#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; {599#true} is VALID [2022-02-20 17:25:14,512 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {599#true} {599#true} #58#return; {599#true} is VALID [2022-02-20 17:25:14,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#true} assume true; {599#true} is VALID [2022-02-20 17:25:14,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#true} assume !(0 == ~cond); {599#true} is VALID [2022-02-20 17:25:14,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {599#true} ~cond := #in~cond; {599#true} is VALID [2022-02-20 17:25:14,513 INFO L272 TraceCheckUtils]: 7: Hoare triple {599#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)); {599#true} is VALID [2022-02-20 17:25:14,513 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {599#true} {599#true} #56#return; {599#true} is VALID [2022-02-20 17:25:14,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {599#true} assume true; {599#true} is VALID [2022-02-20 17:25:14,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {599#true} assume !(0 == ~cond); {599#true} is VALID [2022-02-20 17:25:14,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {599#true} ~cond := #in~cond; {599#true} is VALID [2022-02-20 17:25:14,514 INFO L272 TraceCheckUtils]: 2: Hoare triple {599#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)); {599#true} is VALID [2022-02-20 17:25:14,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {599#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~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; {599#true} is VALID [2022-02-20 17:25:14,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {599#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; {599#true} is VALID [2022-02-20 17:25:14,514 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:25:14,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:25:14,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609745330] [2022-02-20 17:25:14,515 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:25:14,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413500633] [2022-02-20 17:25:14,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413500633] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:25:14,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:25:14,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:25:14,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633723239] [2022-02-20 17:25:14,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:25:14,516 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:25:14,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:14,516 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:25:14,532 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:25:14,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:25:14,533 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:25:14,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:25:14,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:25:14,533 INFO L87 Difference]: Start difference. First operand 28 states and 32 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:25:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:14,785 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-02-20 17:25:14,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:25:14,785 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:25:14,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:14,785 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:25:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-20 17:25:14,787 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:25:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-20 17:25:14,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-02-20 17:25:14,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:14,812 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:25:14,812 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:25:14,812 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:25:14,813 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:14,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 102 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:25:14,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:25:14,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-02-20 17:25:14,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:14,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:14,820 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:14,820 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:14,821 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 17:25:14,821 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 17:25:14,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:14,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:14,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 17:25:14,822 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 17:25:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:14,823 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 17:25:14,823 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 17:25:14,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:14,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:14,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:14,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:14,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-02-20 17:25:14,825 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-02-20 17:25:14,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:14,825 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-02-20 17:25:14,825 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:25:14,825 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-02-20 17:25:14,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:25:14,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:14,826 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] [2022-02-20 17:25:14,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:25:15,029 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:25:15,029 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-02-20 17:25:15,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:25:15,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738065894] [2022-02-20 17:25:15,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:25:15,038 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:25:15,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822932061] [2022-02-20 17:25:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:25:15,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:15,039 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:25:15,040 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:25:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:25:15,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:25:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:25:15,091 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:25:15,091 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:25:15,091 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:25:15,111 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:25:15,293 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:25:15,295 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:25:15,297 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:25:15,305 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:25:15,305 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:25:15,308 INFO L158 Benchmark]: Toolchain (without parser) took 12902.17ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 67.9MB in the beginning and 59.9MB in the end (delta: 8.1MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2022-02-20 17:25:15,308 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:15,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.77ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 74.4MB in the end (delta: -6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 17:25:15,308 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.19ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 72.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:25:15,308 INFO L158 Benchmark]: Boogie Preprocessor took 12.50ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 71.6MB in the end (delta: 971.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:25:15,309 INFO L158 Benchmark]: RCFGBuilder took 202.86ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 60.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:25:15,309 INFO L158 Benchmark]: TraceAbstraction took 12407.56ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 166.0kB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2022-02-20 17:25:15,310 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.16ms. Allocated memory is still 100.7MB. Free memory was 54.9MB in the beginning and 54.9MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.77ms. Allocated memory is still 100.7MB. Free memory was 67.7MB in the beginning and 74.4MB in the end (delta: -6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.19ms. Allocated memory is still 100.7MB. Free memory was 74.4MB in the beginning and 72.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.50ms. Allocated memory is still 100.7MB. Free memory was 72.6MB in the beginning and 71.6MB in the end (delta: 971.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 202.86ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 60.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12407.56ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 60.0MB in the beginning and 59.9MB in the end (delta: 166.0kB). Peak memory consumption was 25.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:25:15,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/fermat2-ll_unwindbound1.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 6568b5930df9b96ff5e807ba48758caa6128d98ba24e8c1d6b9a86c6290462f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:25:16,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:25:16,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:25:16,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:25:16,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:25:16,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:25:16,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:25:16,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:25:16,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:25:16,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:25:16,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:25:16,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:25:16,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:25:16,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:25:16,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:25:16,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:25:16,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:25:16,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:25:16,914 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:25:16,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:25:16,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:25:16,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:25:16,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:25:16,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:25:16,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:25:16,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:25:16,935 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:25:16,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:25:16,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:25:16,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:25:16,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:25:16,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:25:16,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:25:16,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:25:16,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:25:16,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:25:16,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:25:16,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:25:16,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:25:16,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:25:16,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:25:16,943 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:25:16,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:25:16,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:25:16,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:25:16,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:25:16,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:25:16,969 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:25:16,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:25:16,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:25:16,970 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:25:16,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:25:16,971 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:25:16,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:25:16,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:25:16,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:16,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:25:16,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:25:16,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:25:16,973 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:25:16,973 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:25:16,974 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:25:16,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:25:16,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:25:16,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:25:16,974 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 -> 6568b5930df9b96ff5e807ba48758caa6128d98ba24e8c1d6b9a86c6290462f1 [2022-02-20 17:25:17,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:25:17,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:25:17,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:25:17,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:25:17,247 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:25:17,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2022-02-20 17:25:17,293 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b04d3d/74afb0f82495457eb4a6ea25df310929/FLAG851447fd4 [2022-02-20 17:25:17,667 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:25:17,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound1.c [2022-02-20 17:25:17,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b04d3d/74afb0f82495457eb4a6ea25df310929/FLAG851447fd4 [2022-02-20 17:25:17,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c0b04d3d/74afb0f82495457eb4a6ea25df310929 [2022-02-20 17:25:17,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:25:17,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:25:17,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:17,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:25:17,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:25:17,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f699bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17, skipping insertion in model container [2022-02-20 17:25:17,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,695 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:25:17,705 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:25:17,822 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/fermat2-ll_unwindbound1.c[524,537] [2022-02-20 17:25:17,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:17,861 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:25:17,878 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/fermat2-ll_unwindbound1.c[524,537] [2022-02-20 17:25:17,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:25:17,914 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:25:17,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17 WrapperNode [2022-02-20 17:25:17,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:25:17,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:17,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:25:17,915 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:25:17,920 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:25:17" (1/1) ... [2022-02-20 17:25:17,925 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:25:17" (1/1) ... [2022-02-20 17:25:17,943 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2022-02-20 17:25:17,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:25:17,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:25:17,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:25:17,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:25:17,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:25:17,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:25:17,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:25:17,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:25:17,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (1/1) ... [2022-02-20 17:25:17,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:25:17,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:25:17,998 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:25:18,004 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:25:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:25:18,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:25:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:25:18,024 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:25:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:25:18,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:25:18,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:25:18,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:25:18,068 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:25:18,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:25:18,249 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:25:18,253 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:25:18,253 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:25:18,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:18 BoogieIcfgContainer [2022-02-20 17:25:18,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:25:18,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:25:18,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:25:18,257 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:25:18,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:25:17" (1/3) ... [2022-02-20 17:25:18,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a4f132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:18, skipping insertion in model container [2022-02-20 17:25:18,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:25:17" (2/3) ... [2022-02-20 17:25:18,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a4f132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:25:18, skipping insertion in model container [2022-02-20 17:25:18,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:25:18" (3/3) ... [2022-02-20 17:25:18,262 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound1.c [2022-02-20 17:25:18,265 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:25:18,265 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:25:18,294 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:25:18,299 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:25:18,300 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:25:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:25:18,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:25:18,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:18,316 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:25:18,317 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:18,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-02-20 17:25:18,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:18,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423369437] [2022-02-20 17:25:18,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:18,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:18,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:18,336 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:25:18,337 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:25:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:18,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:25:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:18,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:18,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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; {28#true} is VALID [2022-02-20 17:25:18,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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~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; {28#true} is VALID [2022-02-20 17:25:18,568 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#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)); {28#true} is VALID [2022-02-20 17:25:18,569 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:25:18,569 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:25:18,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:25:18,570 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#true} {28#true} #56#return; {28#true} is VALID [2022-02-20 17:25:18,570 INFO L272 TraceCheckUtils]: 7: Hoare triple {28#true} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:25:18,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:25:18,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:25:18,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:25:18,571 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2022-02-20 17:25:18,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#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)); {28#true} is VALID [2022-02-20 17:25:18,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 17:25:18,572 INFO L272 TraceCheckUtils]: 14: Hoare triple {29#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)); {29#false} is VALID [2022-02-20 17:25:18,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:25:18,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2022-02-20 17:25:18,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:25:18,574 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:25:18,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:18,574 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:25:18,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423369437] [2022-02-20 17:25:18,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423369437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:18,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:18,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:25:18,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245474998] [2022-02-20 17:25:18,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:18,581 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:25:18,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:18,584 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:25:18,689 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:25:18,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:25:18,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:25:18,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:25:18,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:25:18,709 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.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:25:19,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:19,296 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:25:19,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:25:19,296 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:25:19,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:19,297 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:25:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:19,302 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:25:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 17:25:19,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 17:25:19,821 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:25:19,826 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:25:19,826 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:25:19,828 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:25:19,830 INFO L933 BasicCegarLoop]: 29 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, 29 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:25:19,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:19,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:25:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:25:19,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:19,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:19,849 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:19,849 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:19,852 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:19,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:19,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:19,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:19,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:19,853 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:25:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:19,855 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-02-20 17:25:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:19,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:19,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:19,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:19,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:19,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-20 17:25:19,869 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-02-20 17:25:19,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:19,872 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-20 17:25:19,872 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:25:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-02-20 17:25:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:19,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:19,873 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:25:19,885 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:25:20,083 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:25:20,083 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:20,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-02-20 17:25:20,084 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:20,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588733695] [2022-02-20 17:25:20,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:20,086 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:25:20,088 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:25:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:20,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:25:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:25:20,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:25:20,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {215#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; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(= ~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~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; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,328 INFO L272 TraceCheckUtils]: 2: Hoare triple {220#(= ~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)); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {220#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume true; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,332 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {220#(= ~counter~0 (_ bv0 32))} {220#(= ~counter~0 (_ bv0 32))} #56#return; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,333 INFO L272 TraceCheckUtils]: 7: Hoare triple {220#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {220#(= ~counter~0 (_ bv0 32))} assume true; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,335 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {220#(= ~counter~0 (_ bv0 32))} {220#(= ~counter~0 (_ bv0 32))} #58#return; {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#(= ~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)); {220#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:25:20,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {220#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {260#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:25:20,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {260#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {216#false} is VALID [2022-02-20 17:25:20,339 INFO L272 TraceCheckUtils]: 15: Hoare triple {216#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)); {216#false} is VALID [2022-02-20 17:25:20,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {216#false} ~cond := #in~cond; {216#false} is VALID [2022-02-20 17:25:20,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {216#false} assume 0bv32 == ~cond; {216#false} is VALID [2022-02-20 17:25:20,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {216#false} assume !false; {216#false} is VALID [2022-02-20 17:25:20,340 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:25:20,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:25:20,340 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:25:20,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [588733695] [2022-02-20 17:25:20,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [588733695] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:25:20,341 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:25:20,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:25:20,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706863004] [2022-02-20 17:25:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:25:20,345 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:25:20,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:25:20,346 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:25:20,457 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:25:20,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:25:20,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:25:20,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:25:20,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:25:20,458 INFO L87 Difference]: Start difference. First operand 21 states and 25 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:25:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:22,041 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 17:25:22,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:25:22,041 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:25:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:25:22,042 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:25:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:22,043 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:25:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:25:22,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 17:25:22,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:25:22,288 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:25:22,288 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:25:22,288 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:25:22,289 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:25:22,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:25:22,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:25:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:25:22,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:25:22,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:22,292 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:22,293 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:22,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:22,294 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:22,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:22,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:22,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:22,295 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:25:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:25:22,296 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:25:22,296 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:22,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:25:22,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:25:22,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:25:22,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:25:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:25:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:25:22,298 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-02-20 17:25:22,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:25:22,299 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:25:22,299 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:25:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:25:22,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:25:22,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:25:22,300 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:25:22,315 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:25:22,511 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:25:22,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:25:22,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:25:22,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-02-20 17:25:22,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:25:22,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464168630] [2022-02-20 17:25:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:25:22,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:25:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:25:22,514 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:25:22,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process