./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 2329fc70 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-?-2329fc7 [2023-02-14 00:40:53,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 00:40:53,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 00:40:53,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 00:40:53,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 00:40:53,569 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 00:40:53,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 00:40:53,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 00:40:53,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 00:40:53,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 00:40:53,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 00:40:53,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 00:40:53,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 00:40:53,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 00:40:53,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 00:40:53,594 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 00:40:53,595 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 00:40:53,596 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 00:40:53,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 00:40:53,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 00:40:53,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 00:40:53,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 00:40:53,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 00:40:53,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 00:40:53,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 00:40:53,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 00:40:53,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 00:40:53,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 00:40:53,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 00:40:53,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 00:40:53,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 00:40:53,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 00:40:53,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 00:40:53,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 00:40:53,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 00:40:53,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 00:40:53,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 00:40:53,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 00:40:53,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 00:40:53,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 00:40:53,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 00:40:53,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-14 00:40:53,635 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 00:40:53,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 00:40:53,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 00:40:53,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 00:40:53,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 00:40:53,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 00:40:53,637 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 00:40:53,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 00:40:53,638 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 00:40:53,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 00:40:53,638 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 00:40:53,638 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 00:40:53,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 00:40:53,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 00:40:53,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-14 00:40:53,639 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 00:40:53,639 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-14 00:40:53,640 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 00:40:53,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-14 00:40:53,640 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 00:40:53,640 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-14 00:40:53,640 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 00:40:53,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 00:40:53,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 00:40:53,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 00:40:53,641 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 00:40:53,641 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 00:40:53,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-14 00:40:53,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 00:40:53,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 00:40:53,642 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 00:40:53,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-14 00:40:53,643 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 00:40:53,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 00:40:53,648 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 00:40:53,648 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-14 00:40:53,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 00:40:53,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 00:40:53,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 00:40:53,852 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 00:40:53,852 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 00:40:53,853 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-14 00:40:55,009 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 00:40:55,165 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 00:40:55,165 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-02-14 00:40:55,171 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7939904f/60ee4652befb44eeb02793cb92e36931/FLAG6677e9d8c [2023-02-14 00:40:55,188 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7939904f/60ee4652befb44eeb02793cb92e36931 [2023-02-14 00:40:55,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 00:40:55,191 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 00:40:55,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 00:40:55,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 00:40:55,197 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 00:40:55,198 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4608a0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55, skipping insertion in model container [2023-02-14 00:40:55,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 00:40:55,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 00:40:55,358 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-14 00:40:55,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 00:40:55,388 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 00:40:55,403 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-14 00:40:55,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 00:40:55,432 INFO L208 MainTranslator]: Completed translation [2023-02-14 00:40:55,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55 WrapperNode [2023-02-14 00:40:55,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 00:40:55,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 00:40:55,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 00:40:55,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 00:40:55,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,467 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-02-14 00:40:55,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 00:40:55,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 00:40:55,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 00:40:55,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 00:40:55,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,500 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 00:40:55,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 00:40:55,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 00:40:55,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 00:40:55,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (1/1) ... [2023-02-14 00:40:55,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 00:40:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:40:55,541 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-14 00:40:55,562 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-14 00:40:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 00:40:55,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-14 00:40:55,587 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-14 00:40:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 00:40:55,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 00:40:55,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 00:40:55,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-14 00:40:55,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-14 00:40:55,648 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 00:40:55,650 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 00:40:55,808 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 00:40:55,813 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 00:40:55,813 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-14 00:40:55,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 12:40:55 BoogieIcfgContainer [2023-02-14 00:40:55,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 00:40:55,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 00:40:55,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 00:40:55,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 00:40:55,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 12:40:55" (1/3) ... [2023-02-14 00:40:55,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9877b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 12:40:55, skipping insertion in model container [2023-02-14 00:40:55,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 12:40:55" (2/3) ... [2023-02-14 00:40:55,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9877b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 12:40:55, skipping insertion in model container [2023-02-14 00:40:55,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 12:40:55" (3/3) ... [2023-02-14 00:40:55,829 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2023-02-14 00:40:55,855 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 00:40:55,855 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-14 00:40:55,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 00:40:55,927 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;@31c341cb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 00:40:55,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-14 00:40:55,931 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-14 00:40:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-14 00:40:55,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:40:55,939 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 00:40:55,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:40:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:40:55,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2023-02-14 00:40:55,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:40:55,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308149993] [2023-02-14 00:40:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:40:56,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:40:56,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151417907] [2023-02-14 00:40:56,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:56,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:40:56,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:40:56,047 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-14 00:40:56,070 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-14 00:40:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 00:40:56,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 00:40:56,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:40:56,145 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-14 00:40:56,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 00:40:56,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:40:56,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308149993] [2023-02-14 00:40:56,147 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:40:56,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151417907] [2023-02-14 00:40:56,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151417907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 00:40:56,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 00:40:56,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 00:40:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33512856] [2023-02-14 00:40:56,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 00:40:56,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 00:40:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:40:56,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 00:40:56,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 00:40:56,240 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-14 00:40:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:40:56,263 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-02-14 00:40:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 00:40:56,265 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-14 00:40:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:40:56,271 INFO L225 Difference]: With dead ends: 47 [2023-02-14 00:40:56,271 INFO L226 Difference]: Without dead ends: 21 [2023-02-14 00:40:56,274 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-14 00:40:56,279 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-14 00:40:56,280 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-14 00:40:56,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-14 00:40:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-14 00:40:56,313 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-14 00:40:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-14 00:40:56,317 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2023-02-14 00:40:56,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:40:56,318 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-14 00:40:56,318 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-14 00:40:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-14 00:40:56,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 00:40:56,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:40:56,322 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 00:40:56,331 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-14 00:40:56,527 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-14 00:40:56,528 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:40:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:40:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2023-02-14 00:40:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:40:56,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677907668] [2023-02-14 00:40:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:40:56,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:40:56,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291104105] [2023-02-14 00:40:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:56,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:40:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:40:56,545 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-14 00:40:56,552 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-14 00:40:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 00:40:56,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 00:40:56,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:40:56,658 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-14 00:40:56,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 00:40:56,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:40:56,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677907668] [2023-02-14 00:40:56,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:40:56,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291104105] [2023-02-14 00:40:56,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291104105] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 00:40:56,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 00:40:56,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 00:40:56,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543524637] [2023-02-14 00:40:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 00:40:56,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 00:40:56,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:40:56,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 00:40:56,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 00:40:56,663 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-14 00:40:56,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:40:56,675 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-02-14 00:40:56,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 00:40:56,675 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-14 00:40:56,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:40:56,676 INFO L225 Difference]: With dead ends: 30 [2023-02-14 00:40:56,676 INFO L226 Difference]: Without dead ends: 23 [2023-02-14 00:40:56,677 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-14 00:40:56,678 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-14 00:40:56,679 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-14 00:40:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-14 00:40:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-14 00:40:56,683 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-14 00:40:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-14 00:40:56,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2023-02-14 00:40:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:40:56,685 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-14 00:40:56,685 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-14 00:40:56,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-14 00:40:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-14 00:40:56,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:40:56,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 00:40:56,697 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-14 00:40:56,891 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-14 00:40:56,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:40:56,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:40:56,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2023-02-14 00:40:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:40:56,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245454693] [2023-02-14 00:40:56,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:40:56,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:40:56,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704639789] [2023-02-14 00:40:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:56,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:40:56,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:40:56,912 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-14 00:40:56,913 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-14 00:40:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 00:40:56,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 00:40:56,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:40:57,215 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-14 00:40:57,215 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 00:40:57,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:40:57,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245454693] [2023-02-14 00:40:57,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:40:57,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704639789] [2023-02-14 00:40:57,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704639789] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 00:40:57,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 00:40:57,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-14 00:40:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533208239] [2023-02-14 00:40:57,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 00:40:57,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 00:40:57,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:40:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 00:40:57,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-14 00:40:57,223 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-14 00:40:59,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-14 00:40:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:40:59,766 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-02-14 00:40:59,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 00:40:59,767 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-14 00:40:59,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:40:59,768 INFO L225 Difference]: With dead ends: 35 [2023-02-14 00:40:59,768 INFO L226 Difference]: Without dead ends: 33 [2023-02-14 00:40:59,768 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-14 00:40:59,769 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.5s IncrementalHoareTripleChecker+Time [2023-02-14 00:40:59,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-14 00:40:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-14 00:40:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-02-14 00:40:59,782 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-14 00:40:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2023-02-14 00:40:59,784 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2023-02-14 00:40:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:40:59,784 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2023-02-14 00:40:59,784 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-14 00:40:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2023-02-14 00:40:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 00:40:59,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:40:59,787 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-14 00:40:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-14 00:40:59,992 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-14 00:40:59,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:40:59,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:40:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2023-02-14 00:40:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:40:59,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098689851] [2023-02-14 00:40:59,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:40:59,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:41:00,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:41:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999292235] [2023-02-14 00:41:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:41:00,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:41:00,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:41:00,012 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-14 00:41:00,015 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-14 00:41:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 00:41:00,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 00:41:00,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:41:00,139 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-14 00:41:00,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 00:41:00,303 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-14 00:41:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:41:00,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098689851] [2023-02-14 00:41:00,304 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:41:00,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999292235] [2023-02-14 00:41:00,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999292235] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 00:41:00,305 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 00:41:00,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-02-14 00:41:00,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86620050] [2023-02-14 00:41:00,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 00:41:00,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 00:41:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:41:00,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 00:41:00,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-14 00:41:00,310 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-14 00:41:00,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:41:00,476 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2023-02-14 00:41:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 00:41:00,477 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-14 00:41:00,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:41:00,478 INFO L225 Difference]: With dead ends: 39 [2023-02-14 00:41:00,478 INFO L226 Difference]: Without dead ends: 34 [2023-02-14 00:41:00,478 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-14 00:41:00,479 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-14 00:41:00,479 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-14 00:41:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-14 00:41:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2023-02-14 00:41:00,485 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-14 00:41:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-14 00:41:00,486 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2023-02-14 00:41:00,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:41:00,486 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-14 00:41:00,486 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-14 00:41:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-02-14 00:41:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-14 00:41:00,487 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:41:00,487 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-14 00:41:00,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-14 00:41:00,688 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-14 00:41:00,688 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:41:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:41:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2023-02-14 00:41:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:41:00,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003901422] [2023-02-14 00:41:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:41:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:41:00,697 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:41:00,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324750558] [2023-02-14 00:41:00,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:41:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:41:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:41:00,701 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-14 00:41:00,703 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-14 00:41:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 00:41:00,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 00:41:00,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:41:00,790 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-14 00:41:00,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 00:41:00,835 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-14 00:41:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:41:00,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003901422] [2023-02-14 00:41:00,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:41:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324750558] [2023-02-14 00:41:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324750558] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 00:41:00,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 00:41:00,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-14 00:41:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676814017] [2023-02-14 00:41:00,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 00:41:00,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 00:41:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:41:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 00:41:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-14 00:41:00,838 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-14 00:41:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:41:00,906 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-02-14 00:41:00,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 00:41:00,907 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-14 00:41:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:41:00,910 INFO L225 Difference]: With dead ends: 57 [2023-02-14 00:41:00,910 INFO L226 Difference]: Without dead ends: 52 [2023-02-14 00:41:00,911 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-14 00:41:00,915 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-14 00:41:00,916 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-14 00:41:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-14 00:41:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-14 00:41:00,940 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-14 00:41:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-02-14 00:41:00,943 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2023-02-14 00:41:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:41:00,944 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-02-14 00:41:00,944 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-14 00:41:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-02-14 00:41:00,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-14 00:41:00,945 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:41:00,946 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-14 00:41:00,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-14 00:41:01,150 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-14 00:41:01,151 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:41:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:41:01,151 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2023-02-14 00:41:01,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:41:01,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720969991] [2023-02-14 00:41:01,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:41:01,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:41:01,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:41:01,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535700736] [2023-02-14 00:41:01,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 00:41:01,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:41:01,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:41:01,162 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-14 00:41:01,166 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-14 00:41:01,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 00:41:01,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 00:41:01,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 00:41:01,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:41:01,323 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-14 00:41:01,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 00:41:01,419 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-14 00:41:01,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:41:01,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720969991] [2023-02-14 00:41:01,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:41:01,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535700736] [2023-02-14 00:41:01,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535700736] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 00:41:01,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 00:41:01,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-14 00:41:01,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039154277] [2023-02-14 00:41:01,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 00:41:01,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 00:41:01,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:41:01,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 00:41:01,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-14 00:41:01,422 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-14 00:41:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:41:01,591 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2023-02-14 00:41:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-14 00:41:01,592 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-14 00:41:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:41:01,593 INFO L225 Difference]: With dead ends: 111 [2023-02-14 00:41:01,593 INFO L226 Difference]: Without dead ends: 106 [2023-02-14 00:41:01,594 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-14 00:41:01,595 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-14 00:41:01,595 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-14 00:41:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-14 00:41:01,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-14 00:41:01,623 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-14 00:41:01,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2023-02-14 00:41:01,625 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2023-02-14 00:41:01,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:41:01,625 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2023-02-14 00:41:01,625 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-14 00:41:01,625 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2023-02-14 00:41:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-14 00:41:01,628 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:41:01,628 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-14 00:41:01,642 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-14 00:41:01,842 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-14 00:41:01,842 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:41:01,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:41:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2023-02-14 00:41:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:41:01,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857248753] [2023-02-14 00:41:01,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:41:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:41:01,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:41:01,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346747032] [2023-02-14 00:41:01,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 00:41:01,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:41:01,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:41:01,858 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-14 00:41:01,864 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-14 00:41:07,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-14 00:41:07,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 00:41:07,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 00:41:07,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 00:41:07,324 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-14 00:41:07,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 00:41:07,609 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-14 00:41:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 00:41:07,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857248753] [2023-02-14 00:41:07,610 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-14 00:41:07,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346747032] [2023-02-14 00:41:07,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346747032] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 00:41:07,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 00:41:07,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-14 00:41:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460270302] [2023-02-14 00:41:07,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 00:41:07,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-14 00:41:07,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 00:41:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-14 00:41:07,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-14 00:41:07,622 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-14 00:41:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 00:41:08,026 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2023-02-14 00:41:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-14 00:41:08,027 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-14 00:41:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 00:41:08,033 INFO L225 Difference]: With dead ends: 201 [2023-02-14 00:41:08,033 INFO L226 Difference]: Without dead ends: 196 [2023-02-14 00:41:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-02-14 00:41:08,035 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-14 00:41:08,035 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-14 00:41:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-14 00:41:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-02-14 00:41:08,092 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-14 00:41:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2023-02-14 00:41:08,093 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2023-02-14 00:41:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 00:41:08,093 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2023-02-14 00:41:08,094 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-14 00:41:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2023-02-14 00:41:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-14 00:41:08,096 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 00:41:08,096 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-14 00:41:08,109 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-14 00:41:08,304 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-14 00:41:08,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-14 00:41:08,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 00:41:08,305 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2023-02-14 00:41:08,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 00:41:08,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517555488] [2023-02-14 00:41:08,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 00:41:08,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 00:41:08,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-14 00:41:08,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1775689838] [2023-02-14 00:41:08,320 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-14 00:41:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 00:41:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 00:41:08,321 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-14 00:41:08,324 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-14 00:41:08,502 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-14 00:41:08,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-14 00:41:08,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-14 00:41:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-14 00:41:08,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-14 00:41:08,730 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-14 00:41:08,730 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-14 00:41:08,758 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-14 00:41:08,955 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-14 00:41:08,958 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-02-14 00:41:08,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-14 00:41:09,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 12:41:09 BoogieIcfgContainer [2023-02-14 00:41:09,039 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-14 00:41:09,039 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-14 00:41:09,039 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-14 00:41:09,040 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-14 00:41:09,040 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 12:40:55" (3/4) ... [2023-02-14 00:41:09,041 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-14 00:41:09,116 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-14 00:41:09,116 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-14 00:41:09,116 INFO L158 Benchmark]: Toolchain (without parser) took 13925.29ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 79.8MB in the beginning and 58.9MB in the end (delta: 20.9MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2023-02-14 00:41:09,117 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 00:41:09,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.32ms. Allocated memory is still 125.8MB. Free memory was 79.3MB in the beginning and 68.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 00:41:09,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.84ms. Allocated memory is still 125.8MB. Free memory was 68.8MB in the beginning and 67.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-14 00:41:09,117 INFO L158 Benchmark]: Boogie Preprocessor took 36.33ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 66.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 00:41:09,118 INFO L158 Benchmark]: RCFGBuilder took 310.16ms. Allocated memory is still 125.8MB. Free memory was 66.1MB in the beginning and 55.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-14 00:41:09,118 INFO L158 Benchmark]: TraceAbstraction took 13221.92ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 54.6MB in the beginning and 66.3MB in the end (delta: -11.6MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-02-14 00:41:09,118 INFO L158 Benchmark]: Witness Printer took 76.61ms. Allocated memory is still 159.4MB. Free memory was 66.3MB in the beginning and 58.9MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-14 00:41:09,120 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.22ms. Allocated memory is still 125.8MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.32ms. Allocated memory is still 125.8MB. Free memory was 79.3MB in the beginning and 68.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.84ms. Allocated memory is still 125.8MB. Free memory was 68.8MB in the beginning and 67.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.33ms. Allocated memory is still 125.8MB. Free memory was 67.6MB in the beginning and 66.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.16ms. Allocated memory is still 125.8MB. Free memory was 66.1MB in the beginning and 55.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13221.92ms. Allocated memory was 125.8MB in the beginning and 159.4MB in the end (delta: 33.6MB). Free memory was 54.6MB in the beginning and 66.3MB in the end (delta: -11.6MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 76.61ms. Allocated memory is still 159.4MB. Free memory was 66.3MB in the beginning and 58.9MB 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=202, r=401, 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=202, r=400, 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=400, R=202, 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=202, r=397, 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=202, r=392, u=405, v=7] [L34] EXPR counter++ VAL [A=40403, counter=4, counter++=3, r=392, R=202, 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=392, R=202, u=405, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=4, R=202, r=392, u=405, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=4, r=385, R=202, 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=385, R=202, 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=376, R=202, u=405, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=6, R=202, r=376, 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=202, r=365, 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=365, R=202, u=405, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=7, r=352, R=202, u=405, v=15] [L34] EXPR counter++ VAL [A=40403, counter=8, counter++=7, R=202, r=352, 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=202, r=352, 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=202, r=337, u=405, v=17] [L34] EXPR counter++ VAL [A=40403, counter=9, counter++=8, r=337, R=202, 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=337, R=202, 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=320, R=202, 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=202, r=320, u=405, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=10, r=320, R=202, u=405, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=10, R=202, r=301, u=405, v=21] [L34] EXPR counter++ VAL [A=40403, counter=11, counter++=10, R=202, r=301, 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=202, r=301, u=405, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=11, R=202, r=280, 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=280, R=202, 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=202, r=232, 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=205, R=202, u=405, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=40403, counter=15, r=176, R=202, u=405, v=31] [L34] EXPR counter++ VAL [A=40403, counter=16, counter++=15, R=202, r=176, 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=202, r=145, 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=145, R=202, 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=112, R=202, 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=112, R=202, u=405, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=18, R=202, r=112, 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=77, R=202, 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=202, r=77, 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=40, R=202, 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=202, r=40, u=405, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=40403, counter=20, r=40, R=202, 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=1, R=202, 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: 13.1s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 742 SdHoareTripleChecker+Invalid, 2.7s 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.8s 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1273 SizeOfPredicates, 25 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-14 00:41:09,144 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