./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-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/fermat1-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 a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:23:37,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:23:37,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:23:37,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:23:37,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:23:37,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:23:37,978 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:23:37,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:23:37,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:23:37,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:23:37,981 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:23:37,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:23:37,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:23:37,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:23:37,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:23:37,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:23:37,986 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:23:37,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:23:37,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:23:37,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:23:37,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:23:37,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:23:37,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:23:37,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:23:37,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:23:37,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:23:37,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:23:37,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:23:37,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:23:37,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:23:37,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:23:37,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:23:37,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:23:37,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:23:37,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:23:37,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:23:38,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:23:38,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:23:38,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:23:38,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:23:38,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:23:38,002 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:23:38,018 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:23:38,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:23:38,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:23:38,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:23:38,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:23:38,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:23:38,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:23:38,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:23:38,020 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:23:38,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:23:38,021 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:23:38,022 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:23:38,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:23:38,022 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:23:38,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:23:38,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:23:38,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:23:38,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:23:38,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:23:38,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:23:38,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:23:38,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:23:38,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:23:38,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:23:38,023 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:23:38,024 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:23:38,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:23:38,024 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 -> a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 [2022-02-20 17:23:38,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:23:38,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:23:38,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:23:38,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:23:38,211 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:23:38,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2022-02-20 17:23:38,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86727156b/9537597e6b22404c862d6097a63dcfab/FLAG35fef193c [2022-02-20 17:23:38,632 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:23:38,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2022-02-20 17:23:38,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86727156b/9537597e6b22404c862d6097a63dcfab/FLAG35fef193c [2022-02-20 17:23:39,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86727156b/9537597e6b22404c862d6097a63dcfab [2022-02-20 17:23:39,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:23:39,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:23:39,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:23:39,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:23:39,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:23:39,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a894d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39, skipping insertion in model container [2022-02-20 17:23:39,064 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:23:39,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:23:39,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c[535,548] [2022-02-20 17:23:39,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:23:39,252 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:23:39,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c[535,548] [2022-02-20 17:23:39,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:23:39,280 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:23:39,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39 WrapperNode [2022-02-20 17:23:39,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:23:39,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:23:39,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:23:39,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:23:39,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,290 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,312 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2022-02-20 17:23:39,312 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:23:39,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:23:39,313 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:23:39,313 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:23:39,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:23:39,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:23:39,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:23:39,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:23:39,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (1/1) ... [2022-02-20 17:23:39,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:23:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:39,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:23:39,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:23:39,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:23:39,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:23:39,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:23:39,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:23:39,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:23:39,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:23:39,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:23:39,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:23:39,442 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:23:39,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:23:39,610 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:23:39,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:23:39,620 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:23:39,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:23:39 BoogieIcfgContainer [2022-02-20 17:23:39,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:23:39,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:23:39,627 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:23:39,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:23:39,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:23:39" (1/3) ... [2022-02-20 17:23:39,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4316b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:23:39, skipping insertion in model container [2022-02-20 17:23:39,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:23:39" (2/3) ... [2022-02-20 17:23:39,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4316b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:23:39, skipping insertion in model container [2022-02-20 17:23:39,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:23:39" (3/3) ... [2022-02-20 17:23:39,633 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound1.c [2022-02-20 17:23:39,636 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:23:39,637 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:23:39,694 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:23:39,725 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:23:39,725 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:23:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:23:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:23:39,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:39,745 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:39,746 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:39,754 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2022-02-20 17:23:39,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:39,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40355863] [2022-02-20 17:23:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:39,859 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:39,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1174128556] [2022-02-20 17:23:39,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:39,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:39,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:39,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:23:39,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:23:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:39,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:23:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:39,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:40,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-02-20 17:23:40,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {35#true} is VALID [2022-02-20 17:23:40,076 INFO L272 TraceCheckUtils]: 2: Hoare triple {35#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {35#true} is VALID [2022-02-20 17:23:40,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 17:23:40,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-02-20 17:23:40,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#false} assume true; {36#false} is VALID [2022-02-20 17:23:40,079 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {36#false} {35#true} #87#return; {36#false} is VALID [2022-02-20 17:23:40,080 INFO L272 TraceCheckUtils]: 7: Hoare triple {36#false} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {36#false} is VALID [2022-02-20 17:23:40,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-02-20 17:23:40,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume 0 == ~cond;assume false; {36#false} is VALID [2022-02-20 17:23:40,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2022-02-20 17:23:40,081 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {36#false} {36#false} #89#return; {36#false} is VALID [2022-02-20 17:23:40,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {36#false} is VALID [2022-02-20 17:23:40,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-02-20 17:23:40,082 INFO L272 TraceCheckUtils]: 14: Hoare triple {36#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {36#false} is VALID [2022-02-20 17:23:40,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-02-20 17:23:40,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-02-20 17:23:40,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 17:23:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:23:40,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:40,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:40,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40355863] [2022-02-20 17:23:40,085 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:40,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174128556] [2022-02-20 17:23:40,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174128556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:40,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:40,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:23:40,090 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062773467] [2022-02-20 17:23:40,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:40,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:23:40,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:40,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:40,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:40,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:23:40,127 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:23:40,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:23:40,148 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:40,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:40,192 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-02-20 17:23:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:23:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-02-20 17:23:40,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:40,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:40,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:23:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:23:40,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2022-02-20 17:23:40,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:40,296 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:23:40,296 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:23:40,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:23:40,300 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:40,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:23:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:23:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:23:40,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:40,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,321 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,322 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:40,325 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:23:40,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:23:40,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:40,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:40,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:23:40,327 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:23:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:40,329 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:23:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:23:40,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:40,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:40,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:40,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:23:40,334 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-02-20 17:23:40,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:40,334 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:23:40,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:23:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:23:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:23:40,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:40,336 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:40,353 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:23:40,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:23:40,552 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2022-02-20 17:23:40,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:40,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88461676] [2022-02-20 17:23:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:40,564 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:40,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803479629] [2022-02-20 17:23:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:40,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:23:40,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:23:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:40,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:23:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:40,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:40,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,761 INFO L272 TraceCheckUtils]: 2: Hoare triple {271#(<= ~counter~0 0)} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(<= ~counter~0 0)} ~cond := #in~cond; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(<= ~counter~0 0)} assume !(0 == ~cond); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(<= ~counter~0 0)} assume true; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,764 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {271#(<= ~counter~0 0)} {271#(<= ~counter~0 0)} #87#return; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {271#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(<= ~counter~0 0)} ~cond := #in~cond; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(<= ~counter~0 0)} assume !(0 == ~cond); {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(<= ~counter~0 0)} assume true; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,767 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {271#(<= ~counter~0 0)} {271#(<= ~counter~0 0)} #89#return; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#(<= ~counter~0 0)} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {271#(<= ~counter~0 0)} is VALID [2022-02-20 17:23:40,768 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {311#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:23:40,769 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {267#false} is VALID [2022-02-20 17:23:40,770 INFO L272 TraceCheckUtils]: 15: Hoare triple {267#false} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {267#false} is VALID [2022-02-20 17:23:40,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2022-02-20 17:23:40,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#false} assume 0 == ~cond; {267#false} is VALID [2022-02-20 17:23:40,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:23:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:40,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:40,771 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:40,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88461676] [2022-02-20 17:23:40,771 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:40,771 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803479629] [2022-02-20 17:23:40,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803479629] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:40,772 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:40,772 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:23:40,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336129768] [2022-02-20 17:23:40,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:40,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:40,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:40,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:40,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:23:40,793 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:40,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:23:40,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:23:40,795 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:40,866 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 17:23:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:23:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:40,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:40,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:23:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:23:40,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-02-20 17:23:40,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:40,908 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:23:40,908 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:23:40,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:23:40,909 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:40,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:23:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:23:40,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:23:40,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:40,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,917 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,919 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:40,921 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:23:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:23:40,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:40,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:40,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:23:40,923 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:23:40,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:40,925 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:23:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:23:40,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:40,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:40,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:40,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:23:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:23:40,929 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-02-20 17:23:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:40,929 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:23:40,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:23:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:23:40,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:40,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:40,947 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:23:41,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 17:23:41,147 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:41,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2022-02-20 17:23:41,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:41,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697440115] [2022-02-20 17:23:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:41,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:41,157 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:41,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [969626147] [2022-02-20 17:23:41,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:41,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:41,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:41,159 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:23:41,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:23:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:41,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:23:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:41,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:41,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {477#true} is VALID [2022-02-20 17:23:41,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {477#true} is VALID [2022-02-20 17:23:41,435 INFO L272 TraceCheckUtils]: 2: Hoare triple {477#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {477#true} is VALID [2022-02-20 17:23:41,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-02-20 17:23:41,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-02-20 17:23:41,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 17:23:41,435 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {477#true} {477#true} #87#return; {477#true} is VALID [2022-02-20 17:23:41,435 INFO L272 TraceCheckUtils]: 7: Hoare triple {477#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {477#true} is VALID [2022-02-20 17:23:41,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#true} ~cond := #in~cond; {477#true} is VALID [2022-02-20 17:23:41,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {477#true} assume !(0 == ~cond); {477#true} is VALID [2022-02-20 17:23:41,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {477#true} assume true; {477#true} is VALID [2022-02-20 17:23:41,436 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {477#true} {477#true} #89#return; {477#true} is VALID [2022-02-20 17:23:42,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {477#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:23:42,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:23:42,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:23:42,865 INFO L272 TraceCheckUtils]: 15: Hoare triple {518#(and (= (mod (+ |ULTIMATE.start_main_~u~0#1| 1) 2) 0) (= |ULTIMATE.start_main_~v~0#1| 1) (= (+ (* (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2) (div (+ (- 1) |ULTIMATE.start_main_~u~0#1|) 2)) (* (- 1) |ULTIMATE.start_main_~A~0#1|)) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {528#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:42,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {532#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:42,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {532#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {478#false} is VALID [2022-02-20 17:23:42,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {478#false} assume !false; {478#false} is VALID [2022-02-20 17:23:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:42,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:23:42,867 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:42,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697440115] [2022-02-20 17:23:42,867 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:42,867 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969626147] [2022-02-20 17:23:42,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969626147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:23:42,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:23:42,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:23:42,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350448074] [2022-02-20 17:23:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:23:42,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:42,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:42,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:44,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:44,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:23:44,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:44,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:23:44,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:23:44,347 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:48,131 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:23:50,601 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:23:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:50,623 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-02-20 17:23:50,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:23:50,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:23:50,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:50,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 17:23:50,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-02-20 17:23:50,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-02-20 17:23:55,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 63 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:55,804 INFO L225 Difference]: With dead ends: 49 [2022-02-20 17:23:55,804 INFO L226 Difference]: Without dead ends: 47 [2022-02-20 17:23:55,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:23:55,805 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 16 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:55,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 113 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-02-20 17:23:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-20 17:23:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-02-20 17:23:55,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:55,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,813 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,813 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:55,815 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:23:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-02-20 17:23:55,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:55,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:55,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 17:23:55,816 INFO L87 Difference]: Start difference. First operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 47 states. [2022-02-20 17:23:55,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:55,818 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:23:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-02-20 17:23:55,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:55,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:55,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:55,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-02-20 17:23:55,821 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 19 [2022-02-20 17:23:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:55,821 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-02-20 17:23:55,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:23:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 17:23:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 17:23:55,822 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:55,822 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:55,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:23:56,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:56,039 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash -82041861, now seen corresponding path program 1 times [2022-02-20 17:23:56,040 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:56,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105926976] [2022-02-20 17:23:56,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:56,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:56,050 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:56,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [953433472] [2022-02-20 17:23:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:56,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:56,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:56,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:23:56,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:23:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:56,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:23:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:23:56,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:23:56,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {764#true} is VALID [2022-02-20 17:23:56,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {764#true} is VALID [2022-02-20 17:23:56,237 INFO L272 TraceCheckUtils]: 2: Hoare triple {764#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,237 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {764#true} {764#true} #87#return; {764#true} is VALID [2022-02-20 17:23:56,237 INFO L272 TraceCheckUtils]: 7: Hoare triple {764#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,238 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {764#true} {764#true} #89#return; {764#true} is VALID [2022-02-20 17:23:56,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {764#true} is VALID [2022-02-20 17:23:56,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#true} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,239 INFO L272 TraceCheckUtils]: 15: Hoare triple {764#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {764#true} ~cond := #in~cond; {817#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:56,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {817#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,241 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} {764#true} #91#return; {828#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:23:56,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {828#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~r~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} assume !(0 != main_~r~0#1); {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:23:56,243 INFO L272 TraceCheckUtils]: 21: Hoare triple {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:56,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:56,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {765#false} is VALID [2022-02-20 17:23:56,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#false} assume !false; {765#false} is VALID [2022-02-20 17:23:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:56,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:23:56,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {765#false} assume !false; {765#false} is VALID [2022-02-20 17:23:56,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {840#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {765#false} is VALID [2022-02-20 17:23:56,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {840#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:23:56,567 INFO L272 TraceCheckUtils]: 21: Hoare triple {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} call __VERIFIER_assert((if 4 * main_~A~0#1 == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {836#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:23:56,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {859#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} assume !(0 != main_~r~0#1); {832#(= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|)))} is VALID [2022-02-20 17:23:56,568 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} {764#true} #91#return; {859#(or (not (= |ULTIMATE.start_main_~r~0#1| 0)) (= (+ (* |ULTIMATE.start_main_~A~0#1| 4) (* |ULTIMATE.start_main_~v~0#1| |ULTIMATE.start_main_~v~0#1|) (* 2 |ULTIMATE.start_main_~u~0#1|)) (+ (* 2 |ULTIMATE.start_main_~v~0#1|) (* |ULTIMATE.start_main_~u~0#1| |ULTIMATE.start_main_~u~0#1|))))} is VALID [2022-02-20 17:23:56,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {872#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {821#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:23:56,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {764#true} ~cond := #in~cond; {872#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:23:56,570 INFO L272 TraceCheckUtils]: 15: Hoare triple {764#true} call __VERIFIER_assert((if 4 * (main_~A~0#1 + main_~r~0#1) == main_~u~0#1 * main_~u~0#1 - main_~v~0#1 * main_~v~0#1 - 2 * main_~u~0#1 + 2 * main_~v~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {764#true} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {764#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {764#true} is VALID [2022-02-20 17:23:56,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#true} main_~u~0#1 := 1 + 2 * main_~R~0#1;main_~v~0#1 := 1;main_~r~0#1 := main_~R~0#1 * main_~R~0#1 - main_~A~0#1; {764#true} is VALID [2022-02-20 17:23:56,570 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {764#true} {764#true} #89#return; {764#true} is VALID [2022-02-20 17:23:56,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,571 INFO L272 TraceCheckUtils]: 7: Hoare triple {764#true} call assume_abort_if_not((if 1 == (if main_~A~0#1 < 0 && 0 != main_~A~0#1 % 2 then main_~A~0#1 % 2 - 2 else main_~A~0#1 % 2) then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,571 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {764#true} {764#true} #87#return; {764#true} is VALID [2022-02-20 17:23:56,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {764#true} assume true; {764#true} is VALID [2022-02-20 17:23:56,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {764#true} assume !(0 == ~cond); {764#true} is VALID [2022-02-20 17:23:56,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {764#true} ~cond := #in~cond; {764#true} is VALID [2022-02-20 17:23:56,571 INFO L272 TraceCheckUtils]: 2: Hoare triple {764#true} call assume_abort_if_not((if (main_~R~0#1 - 1) * (main_~R~0#1 - 1) < main_~A~0#1 then 1 else 0)); {764#true} is VALID [2022-02-20 17:23:56,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {764#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {764#true} is VALID [2022-02-20 17:23:56,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {764#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {764#true} is VALID [2022-02-20 17:23:56,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:23:56,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:23:56,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105926976] [2022-02-20 17:23:56,572 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:23:56,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953433472] [2022-02-20 17:23:56,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953433472] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:23:56,573 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:23:56,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:23:56,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394929078] [2022-02-20 17:23:56,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:23:56,573 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-02-20 17:23:56,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:23:56,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:56,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:23:56,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:23:56,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:23:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:23:56,591 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:56,840 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2022-02-20 17:23:56,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:23:56,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-02-20 17:23:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:23:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 17:23:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-02-20 17:23:56,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-02-20 17:23:56,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:23:56,879 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:23:56,879 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:23:56,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:23:56,880 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:23:56,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 114 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:23:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:23:56,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:23:56,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:23:56,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:56,906 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:56,906 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:56,908 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:23:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:23:56,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:56,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:56,909 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 48 states. [2022-02-20 17:23:56,910 INFO L87 Difference]: Start difference. First operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 48 states. [2022-02-20 17:23:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:23:56,912 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2022-02-20 17:23:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:23:56,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:23:56,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:23:56,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:23:56,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:23:56,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:23:56,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-02-20 17:23:56,914 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 25 [2022-02-20 17:23:56,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:23:56,915 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2022-02-20 17:23:56,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 17:23:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2022-02-20 17:23:56,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 17:23:56,916 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:23:56,916 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:23:56,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:23:57,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,143 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:23:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:23:57,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1145481658, now seen corresponding path program 1 times [2022-02-20 17:23:57,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:23:57,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606080866] [2022-02-20 17:23:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:57,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:23:57,154 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:23:57,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [687436405] [2022-02-20 17:23:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:23:57,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:23:57,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:23:57,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:23:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:23:57,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:23:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:23:57,272 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:23:57,273 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:23:57,273 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:23:57,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:23:57,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:23:57,483 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:23:57,486 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:23:57,498 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); [2022-02-20 17:23:57,499 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:23:57,502 INFO L158 Benchmark]: Toolchain (without parser) took 18444.28ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 69.7MB in the beginning and 110.5MB in the end (delta: -40.8MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,503 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:23:57,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.41ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 69.7MB in the beginning and 119.7MB in the end (delta: -50.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.43ms. Allocated memory is still 144.7MB. Free memory was 119.7MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,503 INFO L158 Benchmark]: Boogie Preprocessor took 24.07ms. Allocated memory is still 144.7MB. Free memory was 117.6MB in the beginning and 116.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:23:57,504 INFO L158 Benchmark]: RCFGBuilder took 287.21ms. Allocated memory is still 144.7MB. Free memory was 116.3MB in the beginning and 104.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:23:57,504 INFO L158 Benchmark]: TraceAbstraction took 17875.23ms. Allocated memory is still 144.7MB. Free memory was 103.8MB in the beginning and 110.5MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:23:57,505 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 98.6MB. Free memory is still 56.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.41ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 69.7MB in the beginning and 119.7MB in the end (delta: -50.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.43ms. Allocated memory is still 144.7MB. Free memory was 119.7MB in the beginning and 117.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.07ms. Allocated memory is still 144.7MB. Free memory was 117.6MB in the beginning and 116.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 287.21ms. Allocated memory is still 144.7MB. Free memory was 116.3MB in the beginning and 104.4MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17875.23ms. Allocated memory is still 144.7MB. Free memory was 103.8MB in the beginning and 110.5MB in the end (delta: -6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:23:57,518 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/fermat1-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 a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:23:59,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:23:59,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:23:59,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:23:59,240 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:23:59,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:23:59,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:23:59,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:23:59,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:23:59,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:23:59,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:23:59,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:23:59,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:23:59,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:23:59,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:23:59,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:23:59,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:23:59,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:23:59,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:23:59,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:23:59,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:23:59,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:23:59,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:23:59,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:23:59,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:23:59,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:23:59,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:23:59,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:23:59,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:23:59,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:23:59,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:23:59,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:23:59,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:23:59,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:23:59,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:23:59,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:23:59,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:23:59,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:23:59,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:23:59,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:23:59,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:23:59,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:23:59,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:23:59,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:23:59,313 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:23:59,313 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:23:59,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:23:59,314 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:23:59,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:23:59,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:23:59,315 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:23:59,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:23:59,315 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:23:59,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:23:59,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:23:59,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:23:59,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:23:59,316 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:23:59,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:23:59,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:23:59,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:23:59,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:23:59,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:23:59,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:23:59,318 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:23:59,319 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 -> a4e999359b895f3090fa3a0a394d4e8b87ebbe801b1ab5ed9c028edec94c7c83 [2022-02-20 17:23:59,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:23:59,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:23:59,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:23:59,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:23:59,573 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:23:59,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2022-02-20 17:23:59,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb0591b8/88264198c4294f7ea9448b0eda1a627e/FLAG7b07de936 [2022-02-20 17:23:59,983 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:23:59,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c [2022-02-20 17:23:59,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb0591b8/88264198c4294f7ea9448b0eda1a627e/FLAG7b07de936 [2022-02-20 17:24:00,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb0591b8/88264198c4294f7ea9448b0eda1a627e [2022-02-20 17:24:00,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:24:00,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:24:00,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:24:00,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:24:00,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:24:00,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9b44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00, skipping insertion in model container [2022-02-20 17:24:00,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:24:00,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:24:00,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c[535,548] [2022-02-20 17:24:00,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:24:00,194 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:24:00,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound1.c[535,548] [2022-02-20 17:24:00,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:24:00,232 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:24:00,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00 WrapperNode [2022-02-20 17:24:00,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:24:00,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:24:00,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:24:00,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:24:00,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,249 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,271 INFO L137 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 65 [2022-02-20 17:24:00,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:24:00,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:24:00,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:24:00,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:24:00,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:24:00,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:24:00,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:24:00,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:24:00,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (1/1) ... [2022-02-20 17:24:00,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:24:00,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:24:00,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:24:00,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:24:00,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:24:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:24:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:24:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:24:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:24:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:24:00,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:24:00,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:24:00,448 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:24:00,449 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:24:00,687 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:24:00,691 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:24:00,692 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 17:24:00,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:24:00 BoogieIcfgContainer [2022-02-20 17:24:00,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:24:00,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:24:00,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:24:00,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:24:00,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:24:00" (1/3) ... [2022-02-20 17:24:00,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a38b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:24:00, skipping insertion in model container [2022-02-20 17:24:00,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:24:00" (2/3) ... [2022-02-20 17:24:00,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a38b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:24:00, skipping insertion in model container [2022-02-20 17:24:00,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:24:00" (3/3) ... [2022-02-20 17:24:00,697 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound1.c [2022-02-20 17:24:00,700 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:24:00,700 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:24:00,725 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:24:00,729 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:24:00,729 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:24:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:24:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:24:00,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:24:00,758 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:24:00,759 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:24:00,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:24:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 738208203, now seen corresponding path program 1 times [2022-02-20 17:24:00,772 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:24:00,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782545678] [2022-02-20 17:24:00,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:24:00,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:24:00,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:24:00,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:24:00,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:24:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:00,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:24:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:00,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:24:00,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {35#true} is VALID [2022-02-20 17:24:00,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {35#true} is VALID [2022-02-20 17:24:00,992 INFO L272 TraceCheckUtils]: 2: Hoare triple {35#true} call assume_abort_if_not((if ~bvslt64(~bvmul64(~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64), ~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64)), ~sign_extendFrom32To64(main_~A~0#1)) then 1bv32 else 0bv32)); {35#true} is VALID [2022-02-20 17:24:00,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 17:24:00,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#true} assume 0bv32 == ~cond;assume false; {35#true} is VALID [2022-02-20 17:24:00,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} assume true; {35#true} is VALID [2022-02-20 17:24:00,993 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35#true} {35#true} #87#return; {35#true} is VALID [2022-02-20 17:24:00,993 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {35#true} is VALID [2022-02-20 17:24:00,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-02-20 17:24:00,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0bv32 == ~cond;assume false; {35#true} is VALID [2022-02-20 17:24:00,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#true} assume true; {35#true} is VALID [2022-02-20 17:24:00,994 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {35#true} {35#true} #89#return; {35#true} is VALID [2022-02-20 17:24:00,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} main_~u~0#1 := ~bvadd64(1bv64, ~bvmul64(2bv64, ~sign_extendFrom32To64(main_~R~0#1)));main_~v~0#1 := 1bv64;main_~r~0#1 := ~bvsub64(~bvmul64(~sign_extendFrom32To64(main_~R~0#1), ~sign_extendFrom32To64(main_~R~0#1)), ~sign_extendFrom32To64(main_~A~0#1)); {35#true} is VALID [2022-02-20 17:24:00,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 17:24:00,995 INFO L272 TraceCheckUtils]: 14: Hoare triple {36#false} call __VERIFIER_assert((if ~bvmul64(4bv64, ~sign_extendFrom32To64(main_~A~0#1)) == ~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~u~0#1, main_~u~0#1), ~bvmul64(main_~v~0#1, main_~v~0#1)), ~bvmul64(2bv64, main_~u~0#1)), ~bvmul64(2bv64, main_~v~0#1)) then 1bv32 else 0bv32)); {36#false} is VALID [2022-02-20 17:24:00,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-02-20 17:24:00,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume 0bv32 == ~cond; {36#false} is VALID [2022-02-20 17:24:00,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 17:24:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:24:00,996 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:24:00,996 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:24:00,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782545678] [2022-02-20 17:24:00,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782545678] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:24:00,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:24:00,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:24:00,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039328669] [2022-02-20 17:24:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:24:01,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:24:01,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:24:01,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:01,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:01,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:24:01,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:24:01,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:24:01,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:24:01,114 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:02,777 INFO L93 Difference]: Finished difference Result 61 states and 94 transitions. [2022-02-20 17:24:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:24:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-02-20 17:24:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:24:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:24:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 94 transitions. [2022-02-20 17:24:02,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 94 transitions. [2022-02-20 17:24:03,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:03,809 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:24:03,809 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:24:03,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:24:03,813 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:24:03,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:24:03,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:24:03,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:24:03,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:24:03,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:03,846 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:03,846 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:03,857 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:24:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:24:03,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:03,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:03,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:24:03,869 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 28 states. [2022-02-20 17:24:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:03,877 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:24:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:24:03,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:03,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:03,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:24:03,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:24:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:24:03,891 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-02-20 17:24:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:24:03,892 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:24:03,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:24:03,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:24:03,894 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:24:03,894 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:24:03,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 17:24:04,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:24:04,099 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:24:04,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:24:04,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1770759922, now seen corresponding path program 1 times [2022-02-20 17:24:04,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:24:04,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33188979] [2022-02-20 17:24:04,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:24:04,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:24:04,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:24:04,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:24:04,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:24:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:04,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:24:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:24:04,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:24:04,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post7#1, main_#t~post8#1, main_#t~post6#1, main_~A~0#1, main_~R~0#1, main_~u~0#1, main_~v~0#1, main_~r~0#1;havoc main_~A~0#1;havoc main_~R~0#1;havoc main_~u~0#1;havoc main_~v~0#1;havoc main_~r~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~R~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,405 INFO L272 TraceCheckUtils]: 2: Hoare triple {271#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if ~bvslt64(~bvmul64(~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64), ~bvsub64(~sign_extendFrom32To64(main_~R~0#1), 1bv64)), ~sign_extendFrom32To64(main_~A~0#1)) then 1bv32 else 0bv32)); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {271#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume true; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,407 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {271#(= ~counter~0 (_ bv0 32))} {271#(= ~counter~0 (_ bv0 32))} #87#return; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,408 INFO L272 TraceCheckUtils]: 7: Hoare triple {271#(= ~counter~0 (_ bv0 32))} call assume_abort_if_not((if 1bv32 == ~bvsrem32(main_~A~0#1, 2bv32) then 1bv32 else 0bv32)); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {271#(= ~counter~0 (_ bv0 32))} ~cond := #in~cond; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == ~cond); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {271#(= ~counter~0 (_ bv0 32))} assume true; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,410 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {271#(= ~counter~0 (_ bv0 32))} {271#(= ~counter~0 (_ bv0 32))} #89#return; {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {271#(= ~counter~0 (_ bv0 32))} main_~u~0#1 := ~bvadd64(1bv64, ~bvmul64(2bv64, ~sign_extendFrom32To64(main_~R~0#1)));main_~v~0#1 := 1bv64;main_~r~0#1 := ~bvsub64(~bvmul64(~sign_extendFrom32To64(main_~R~0#1), ~sign_extendFrom32To64(main_~R~0#1)), ~sign_extendFrom32To64(main_~A~0#1)); {271#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:24:04,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {271#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {311#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:24:04,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {267#false} is VALID [2022-02-20 17:24:04,411 INFO L272 TraceCheckUtils]: 15: Hoare triple {267#false} call __VERIFIER_assert((if ~bvmul64(4bv64, ~sign_extendFrom32To64(main_~A~0#1)) == ~bvadd64(~bvsub64(~bvsub64(~bvmul64(main_~u~0#1, main_~u~0#1), ~bvmul64(main_~v~0#1, main_~v~0#1)), ~bvmul64(2bv64, main_~u~0#1)), ~bvmul64(2bv64, main_~v~0#1)) then 1bv32 else 0bv32)); {267#false} is VALID [2022-02-20 17:24:04,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#false} ~cond := #in~cond; {267#false} is VALID [2022-02-20 17:24:04,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#false} assume 0bv32 == ~cond; {267#false} is VALID [2022-02-20 17:24:04,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-02-20 17:24:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:24:04,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:24:04,413 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:24:04,413 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33188979] [2022-02-20 17:24:04,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33188979] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:24:04,413 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:24:04,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:24:04,414 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367975339] [2022-02-20 17:24:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:24:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:24:04,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:24:04,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:04,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:04,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:24:04,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:24:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:24:04,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:24:04,528 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:08,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:08,350 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 17:24:08,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:24:08,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:24:08,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:24:08,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:24:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-02-20 17:24:08,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-02-20 17:24:08,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:24:08,771 INFO L225 Difference]: With dead ends: 37 [2022-02-20 17:24:08,771 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:24:08,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:24:08,772 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:24:08,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:24:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:24:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:24:08,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:24:08,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:08,776 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:08,776 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:08,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:08,778 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:24:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:24:08,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:08,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:08,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:24:08,779 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-02-20 17:24:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:24:08,782 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:24:08,782 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:24:08,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:24:08,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:24:08,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:24:08,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:24:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:24:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:24:08,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 19 [2022-02-20 17:24:08,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:24:08,785 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:24:08,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:24:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:24:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:24:08,786 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:24:08,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:24:08,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:24:08,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:24:08,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:24:08,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:24:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1769091626, now seen corresponding path program 1 times [2022-02-20 17:24:09,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:24:09,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49915024] [2022-02-20 17:24:09,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:24:09,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:24:09,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:24:09,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:24:09,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process