./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.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 c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 11:48:42,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 11:48:42,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 11:48:42,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 11:48:42,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 11:48:42,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 11:48:42,708 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 11:48:42,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 11:48:42,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 11:48:42,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 11:48:42,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 11:48:42,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 11:48:42,720 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 11:48:42,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 11:48:42,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 11:48:42,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 11:48:42,724 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 11:48:42,725 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 11:48:42,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 11:48:42,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 11:48:42,740 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 11:48:42,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 11:48:42,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 11:48:42,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 11:48:42,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 11:48:42,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 11:48:42,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 11:48:42,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 11:48:42,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 11:48:42,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 11:48:42,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 11:48:42,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 11:48:42,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 11:48:42,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 11:48:42,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 11:48:42,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 11:48:42,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 11:48:42,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 11:48:42,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 11:48:42,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 11:48:42,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 11:48:42,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-15 11:48:42,781 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 11:48:42,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 11:48:42,781 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 11:48:42,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 11:48:42,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 11:48:42,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 11:48:42,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 11:48:42,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 11:48:42,783 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 11:48:42,784 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 11:48:42,784 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 11:48:42,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 11:48:42,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 11:48:42,786 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 11:48:42,786 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 11:48:42,786 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 11:48:42,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 11:48:42,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 11:48:42,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:48:42,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 11:48:42,787 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 11:48:42,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 11:48:42,788 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 11:48:42,788 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a [2023-02-15 11:48:43,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 11:48:43,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 11:48:43,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 11:48:43,023 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 11:48:43,023 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 11:48:43,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-02-15 11:48:43,943 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 11:48:44,120 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 11:48:44,120 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-02-15 11:48:44,126 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f5c4e2b/ac8c6fa9d72443c9afb16e6448e3cbbf/FLAGd07f1d1f9 [2023-02-15 11:48:44,136 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63f5c4e2b/ac8c6fa9d72443c9afb16e6448e3cbbf [2023-02-15 11:48:44,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 11:48:44,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 11:48:44,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 11:48:44,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 11:48:44,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 11:48:44,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68b98675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44, skipping insertion in model container [2023-02-15 11:48:44,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 11:48:44,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 11:48:44,243 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c[524,537] [2023-02-15 11:48:44,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:48:44,263 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 11:48:44,297 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c[524,537] [2023-02-15 11:48:44,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 11:48:44,330 INFO L208 MainTranslator]: Completed translation [2023-02-15 11:48:44,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44 WrapperNode [2023-02-15 11:48:44,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 11:48:44,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 11:48:44,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 11:48:44,332 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 11:48:44,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,350 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-02-15 11:48:44,351 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 11:48:44,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 11:48:44,351 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 11:48:44,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 11:48:44,357 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,357 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,362 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,364 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 11:48:44,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 11:48:44,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 11:48:44,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 11:48:44,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (1/1) ... [2023-02-15 11:48:44,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 11:48:44,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:44,398 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) [2023-02-15 11:48:44,401 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 [2023-02-15 11:48:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 11:48:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-15 11:48:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-15 11:48:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 11:48:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 11:48:44,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 11:48:44,444 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 11:48:44,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 11:48:44,482 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 11:48:44,484 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 11:48:44,570 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 11:48:44,574 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 11:48:44,574 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 11:48:44,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:48:44 BoogieIcfgContainer [2023-02-15 11:48:44,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 11:48:44,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 11:48:44,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 11:48:44,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 11:48:44,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 11:48:44" (1/3) ... [2023-02-15 11:48:44,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26efc704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:48:44, skipping insertion in model container [2023-02-15 11:48:44,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 11:48:44" (2/3) ... [2023-02-15 11:48:44,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26efc704 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:48:44, skipping insertion in model container [2023-02-15 11:48:44,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:48:44" (3/3) ... [2023-02-15 11:48:44,597 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2023-02-15 11:48:44,609 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 11:48:44,609 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-15 11:48:44,636 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 11:48:44,640 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3362e807, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 11:48:44,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-15 11:48:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 11:48:44,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 11:48:44,647 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:44,648 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:44,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:44,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:44,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2023-02-15 11:48:44,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:44,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855112043] [2023-02-15 11:48:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:44,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:44,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:44,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644960200] [2023-02-15 11:48:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:44,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:44,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:44,714 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) [2023-02-15 11:48:44,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 11:48:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:48:44,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 11:48:44,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 11:48:44,776 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:48:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855112043] [2023-02-15 11:48:44,777 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:44,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644960200] [2023-02-15 11:48:44,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644960200] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:48:44,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:48:44,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 11:48:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106752193] [2023-02-15 11:48:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:48:44,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 11:48:44,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:44,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 11:48:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 11:48:44,810 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 11:48:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:44,828 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-02-15 11:48:44,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 11:48:44,830 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 [2023-02-15 11:48:44,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:44,835 INFO L225 Difference]: With dead ends: 47 [2023-02-15 11:48:44,835 INFO L226 Difference]: Without dead ends: 21 [2023-02-15 11:48:44,837 INFO L412 NwaCegarLoop]: 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 [2023-02-15 11:48:44,842 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:44,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:48:44,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-15 11:48:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-15 11:48:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 11:48:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-15 11:48:44,865 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2023-02-15 11:48:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:44,865 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-15 11:48:44,865 INFO L496 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) [2023-02-15 11:48:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-15 11:48:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 11:48:44,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:44,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:44,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 11:48:45,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-02-15 11:48:45,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:45,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:45,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2023-02-15 11:48:45,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:45,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670472142] [2023-02-15 11:48:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:45,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:45,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:45,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009462416] [2023-02-15 11:48:45,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:45,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:45,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:45,090 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) [2023-02-15 11:48:45,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 11:48:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:48:45,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 11:48:45,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:45,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:48:45,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:45,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670472142] [2023-02-15 11:48:45,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:45,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009462416] [2023-02-15 11:48:45,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009462416] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:48:45,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:48:45,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 11:48:45,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210408574] [2023-02-15 11:48:45,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:48:45,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 11:48:45,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:45,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 11:48:45,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 11:48:45,186 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 11:48:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:45,197 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-02-15 11:48:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 11:48:45,197 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 [2023-02-15 11:48:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:45,198 INFO L225 Difference]: With dead ends: 30 [2023-02-15 11:48:45,198 INFO L226 Difference]: Without dead ends: 23 [2023-02-15 11:48:45,198 INFO L412 NwaCegarLoop]: 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 [2023-02-15 11:48:45,199 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:45,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:48:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-15 11:48:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-15 11:48:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 11:48:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-15 11:48:45,204 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2023-02-15 11:48:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:45,205 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-15 11:48:45,205 INFO L496 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) [2023-02-15 11:48:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-15 11:48:45,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 11:48:45,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:45,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:45,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 11:48:45,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-02-15 11:48:45,411 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:45,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2023-02-15 11:48:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009365465] [2023-02-15 11:48:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:45,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:45,425 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:45,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162311521] [2023-02-15 11:48:45,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:45,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:45,435 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) [2023-02-15 11:48:45,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 11:48:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:48:45,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 11:48:45,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:45,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 11:48:45,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 11:48:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:45,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009365465] [2023-02-15 11:48:45,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162311521] [2023-02-15 11:48:45,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162311521] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 11:48:45,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 11:48:45,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 11:48:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416581832] [2023-02-15 11:48:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 11:48:45,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 11:48:45,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:45,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 11:48:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:48:45,674 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 11:48:47,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:47,053 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-02-15 11:48:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 11:48:47,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-15 11:48:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:47,054 INFO L225 Difference]: With dead ends: 35 [2023-02-15 11:48:47,055 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 11:48:47,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 11:48:47,056 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:47,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 11:48:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 11:48:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-02-15 11:48:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 11:48:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-15 11:48:47,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2023-02-15 11:48:47,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:47,063 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-15 11:48:47,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 11:48:47,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-15 11:48:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 11:48:47,064 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:47,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:47,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 11:48:47,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:47,270 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2023-02-15 11:48:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:47,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394793277] [2023-02-15 11:48:47,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:47,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:47,286 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:47,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1481530910] [2023-02-15 11:48:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:47,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:47,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:47,288 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) [2023-02-15 11:48:47,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 11:48:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:48:47,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 11:48:47,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:47,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:48:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:47,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394793277] [2023-02-15 11:48:47,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:47,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481530910] [2023-02-15 11:48:47,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481530910] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:48:47,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:48:47,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-02-15 11:48:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782970432] [2023-02-15 11:48:47,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:48:47,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 11:48:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 11:48:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-15 11:48:47,481 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 11:48:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:47,589 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-15 11:48:47,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 11:48:47,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2023-02-15 11:48:47,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:47,595 INFO L225 Difference]: With dead ends: 39 [2023-02-15 11:48:47,595 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 11:48:47,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-15 11:48:47,602 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:47,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:48:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 11:48:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2023-02-15 11:48:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 11:48:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-15 11:48:47,619 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2023-02-15 11:48:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:47,619 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-15 11:48:47,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 11:48:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-02-15 11:48:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 11:48:47,620 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:47,621 INFO L195 NwaCegarLoop]: 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] [2023-02-15 11:48:47,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-15 11:48:47,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:47,825 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2023-02-15 11:48:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:47,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596980715] [2023-02-15 11:48:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:47,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:47,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:47,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158578659] [2023-02-15 11:48:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:47,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:47,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:47,853 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) [2023-02-15 11:48:47,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 11:48:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 11:48:47,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 11:48:47,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:47,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:48:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:47,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:47,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596980715] [2023-02-15 11:48:47,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:47,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158578659] [2023-02-15 11:48:47,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158578659] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:48:47,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:48:47,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-15 11:48:47,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777920033] [2023-02-15 11:48:47,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:48:47,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 11:48:47,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:47,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 11:48:47,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 11:48:47,976 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 11:48:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:48,019 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-02-15 11:48:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 11:48:48,020 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2023-02-15 11:48:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:48,021 INFO L225 Difference]: With dead ends: 57 [2023-02-15 11:48:48,021 INFO L226 Difference]: Without dead ends: 52 [2023-02-15 11:48:48,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 11:48:48,021 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:48,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 11:48:48,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-15 11:48:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-15 11:48:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 11:48:48,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-02-15 11:48:48,031 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2023-02-15 11:48:48,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:48,031 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-02-15 11:48:48,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 11:48:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-02-15 11:48:48,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 11:48:48,032 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:48,032 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:48,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 11:48:48,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:48,237 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:48,237 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2023-02-15 11:48:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:48,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70363975] [2023-02-15 11:48:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:48,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:48,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986739776] [2023-02-15 11:48:48,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 11:48:48,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:48,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:48,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:48:48,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 11:48:48,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 11:48:48,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:48:48,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 11:48:48,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:48,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:48:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 11:48:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:48,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70363975] [2023-02-15 11:48:48,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:48,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986739776] [2023-02-15 11:48:48,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986739776] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:48:48,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:48:48,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-15 11:48:48,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082436268] [2023-02-15 11:48:48,479 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:48:48,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 11:48:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:48,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 11:48:48,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-15 11:48:48,480 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-02-15 11:48:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:48,630 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2023-02-15 11:48:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 11:48:48,649 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2023-02-15 11:48:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:48,650 INFO L225 Difference]: With dead ends: 111 [2023-02-15 11:48:48,650 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 11:48:48,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-02-15 11:48:48,651 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:48,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 136 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:48:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 11:48:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-15 11:48:48,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-02-15 11:48:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2023-02-15 11:48:48,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2023-02-15 11:48:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:48,694 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2023-02-15 11:48:48,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-02-15 11:48:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2023-02-15 11:48:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-15 11:48:48,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:48,700 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:48,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 11:48:48,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:48,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2023-02-15 11:48:48,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:48,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949321075] [2023-02-15 11:48:48,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:48,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:48,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46940524] [2023-02-15 11:48:48,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 11:48:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:48,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:48,915 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:48:48,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 11:48:53,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 11:48:53,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 11:48:53,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 11:48:53,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 11:48:54,015 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 11:48:54,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 11:48:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-02-15 11:48:54,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 11:48:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949321075] [2023-02-15 11:48:54,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 11:48:54,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46940524] [2023-02-15 11:48:54,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46940524] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 11:48:54,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 11:48:54,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-15 11:48:54,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616503422] [2023-02-15 11:48:54,211 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 11:48:54,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 11:48:54,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 11:48:54,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 11:48:54,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-15 11:48:54,217 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2023-02-15 11:48:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 11:48:54,515 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2023-02-15 11:48:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 11:48:54,516 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) Word has length 109 [2023-02-15 11:48:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 11:48:54,517 INFO L225 Difference]: With dead ends: 201 [2023-02-15 11:48:54,517 INFO L226 Difference]: Without dead ends: 196 [2023-02-15 11:48:54,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 11:48:54,519 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 126 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 11:48:54,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 255 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 11:48:54,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-15 11:48:54,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-02-15 11:48:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-02-15 11:48:54,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2023-02-15 11:48:54,541 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2023-02-15 11:48:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 11:48:54,541 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2023-02-15 11:48:54,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2023-02-15 11:48:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2023-02-15 11:48:54,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-15 11:48:54,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 11:48:54,543 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 11:48:54,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 11:48:54,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:54,750 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-15 11:48:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 11:48:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2023-02-15 11:48:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 11:48:54,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978848312] [2023-02-15 11:48:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 11:48:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 11:48:54,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-15 11:48:54,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6485957] [2023-02-15 11:48:54,761 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 11:48:54,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 11:48:54,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 11:48:54,777 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 11:48:54,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 11:48:54,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 11:48:54,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-15 11:48:54,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 11:48:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 11:48:55,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 11:48:55,143 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 11:48:55,144 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-15 11:48:55,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 11:48:55,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-02-15 11:48:55,354 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-02-15 11:48:55,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 11:48:55,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 11:48:55 BoogieIcfgContainer [2023-02-15 11:48:55,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 11:48:55,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 11:48:55,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 11:48:55,423 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 11:48:55,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:48:44" (3/4) ... [2023-02-15 11:48:55,424 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 11:48:55,502 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 11:48:55,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 11:48:55,503 INFO L158 Benchmark]: Toolchain (without parser) took 11364.30ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 148.3MB in the beginning and 175.3MB in the end (delta: -27.1MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2023-02-15 11:48:55,503 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 95.9MB in the beginning and 95.8MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:48:55,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.18ms. Allocated memory is still 180.4MB. Free memory was 147.7MB in the beginning and 149.2MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:48:55,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.86ms. Allocated memory is still 180.4MB. Free memory was 149.2MB in the beginning and 147.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 11:48:55,504 INFO L158 Benchmark]: Boogie Preprocessor took 12.84ms. Allocated memory is still 180.4MB. Free memory was 147.5MB in the beginning and 146.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 11:48:55,504 INFO L158 Benchmark]: RCFGBuilder took 211.16ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 135.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 11:48:55,504 INFO L158 Benchmark]: TraceAbstraction took 10845.17ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 134.9MB in the beginning and 182.7MB in the end (delta: -47.8MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2023-02-15 11:48:55,504 INFO L158 Benchmark]: Witness Printer took 79.71ms. Allocated memory is still 228.6MB. Free memory was 182.7MB in the beginning and 175.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 11:48:55,506 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory was 95.9MB in the beginning and 95.8MB in the end (delta: 74.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.18ms. Allocated memory is still 180.4MB. Free memory was 147.7MB in the beginning and 149.2MB in the end (delta: -1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.86ms. Allocated memory is still 180.4MB. Free memory was 149.2MB in the beginning and 147.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 12.84ms. Allocated memory is still 180.4MB. Free memory was 147.5MB in the beginning and 146.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 211.16ms. Allocated memory is still 180.4MB. Free memory was 146.1MB in the beginning and 135.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10845.17ms. Allocated memory was 180.4MB in the beginning and 228.6MB in the end (delta: 48.2MB). Free memory was 134.9MB in the beginning and 182.7MB in the end (delta: -47.8MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 79.71ms. Allocated memory is still 228.6MB. Free memory was 182.7MB in the beginning and 175.3MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=40403, counter=0, R=202] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=40403, counter=0, R=202] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=40403, counter=0, r=401, R=202, u=405, v=1] [L34] EXPR counter++ VAL [A=40403, counter=1, counter++=0, r=401, R=202, u=405, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=1, R=202, r=401, u=405, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=1, R=202, r=401, u=405, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=1, r=400, R=202, u=405, v=3] [L34] EXPR counter++ VAL [A=40403, counter=2, counter++=1, R=202, r=400, u=405, v=3] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=2, R=202, r=400, u=405, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=2, R=202, r=400, u=405, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=2, r=397, R=202, u=405, v=5] [L34] EXPR counter++ VAL [A=40403, counter=3, counter++=2, r=397, R=202, u=405, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=3, r=397, R=202, u=405, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=3, r=397, R=202, u=405, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=3, r=392, R=202, u=405, v=7] [L34] EXPR counter++ VAL [A=40403, counter=4, counter++=3, R=202, r=392, u=405, v=7] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=4, R=202, r=392, u=405, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=4, r=392, R=202, u=405, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=4, R=202, r=385, u=405, v=9] [L34] EXPR counter++ VAL [A=40403, counter=5, counter++=4, r=385, R=202, u=405, v=9] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=5, R=202, r=385, u=405, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=5, R=202, r=385, u=405, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=5, r=376, R=202, u=405, v=11] [L34] EXPR counter++ VAL [A=40403, counter=6, counter++=5, R=202, r=376, u=405, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=6, R=202, r=376, u=405, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=6, r=376, R=202, u=405, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=6, R=202, r=365, u=405, v=13] [L34] EXPR counter++ VAL [A=40403, counter=7, counter++=6, r=365, R=202, u=405, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=7, R=202, r=365, u=405, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=7, R=202, r=365, u=405, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=7, R=202, r=352, u=405, v=15] [L34] EXPR counter++ VAL [A=40403, counter=8, counter++=7, r=352, R=202, u=405, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=8, r=352, R=202, u=405, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=8, r=352, R=202, u=405, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=8, r=337, R=202, u=405, v=17] [L34] EXPR counter++ VAL [A=40403, counter=9, counter++=8, R=202, r=337, u=405, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=9, R=202, r=337, u=405, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=9, R=202, r=337, u=405, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=9, R=202, r=320, u=405, v=19] [L34] EXPR counter++ VAL [A=40403, counter=10, counter++=9, R=202, r=320, u=405, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=10, r=320, R=202, u=405, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=10, R=202, r=320, u=405, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=10, r=301, R=202, u=405, v=21] [L34] EXPR counter++ VAL [A=40403, counter=11, counter++=10, r=301, R=202, u=405, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=11, r=301, R=202, u=405, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=11, r=301, R=202, u=405, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=11, r=280, R=202, u=405, v=23] [L34] EXPR counter++ VAL [A=40403, counter=12, counter++=11, R=202, r=280, u=405, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=12, r=280, R=202, u=405, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=12, R=202, r=280, u=405, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=12, R=202, r=257, u=405, v=25] [L34] EXPR counter++ VAL [A=40403, counter=13, counter++=12, r=257, R=202, u=405, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=13, R=202, r=257, u=405, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=13, R=202, r=257, u=405, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=13, r=232, R=202, u=405, v=27] [L34] EXPR counter++ VAL [A=40403, counter=14, counter++=13, r=232, R=202, u=405, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=14, R=202, r=232, u=405, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=14, r=232, R=202, u=405, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=14, R=202, r=205, u=405, v=29] [L34] EXPR counter++ VAL [A=40403, counter=15, counter++=14, r=205, R=202, u=405, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=15, R=202, r=205, u=405, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=15, R=202, r=205, u=405, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=15, R=202, r=176, u=405, v=31] [L34] EXPR counter++ VAL [A=40403, counter=16, counter++=15, r=176, R=202, u=405, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=16, R=202, r=176, u=405, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=16, R=202, r=176, u=405, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=16, r=145, R=202, u=405, v=33] [L34] EXPR counter++ VAL [A=40403, counter=17, counter++=16, r=145, R=202, u=405, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=17, r=145, R=202, u=405, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=17, R=202, r=145, u=405, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=17, R=202, r=112, u=405, v=35] [L34] EXPR counter++ VAL [A=40403, counter=18, counter++=17, R=202, r=112, u=405, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=18, R=202, r=112, u=405, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=18, r=112, R=202, u=405, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=18, R=202, r=77, u=405, v=37] [L34] EXPR counter++ VAL [A=40403, counter=19, counter++=18, R=202, r=77, u=405, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=19, r=77, R=202, u=405, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=19, r=77, R=202, u=405, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=19, R=202, r=40, u=405, v=39] [L34] EXPR counter++ VAL [A=40403, counter=20, counter++=19, R=202, r=40, u=405, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=40403, counter=20, r=40, R=202, u=405, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=20, R=202, r=40, u=405, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=20, r=1, R=202, u=405, v=41] [L34] EXPR counter++ VAL [A=40403, counter=21, counter++=20, R=202, r=1, u=405, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 742 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 560 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 352 IncrementalHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 182 mSDtfsCounter, 352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 515 GetRequests, 420 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=7, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1277 SizeOfPredicates, 27 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 11:48:55,522 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE