./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 b5317dae 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-?-b5317da-m [2023-02-16 02:08:30,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 02:08:30,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 02:08:30,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 02:08:30,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 02:08:30,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 02:08:30,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 02:08:30,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 02:08:30,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 02:08:30,825 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 02:08:30,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 02:08:30,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 02:08:30,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 02:08:30,829 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 02:08:30,830 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 02:08:30,831 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 02:08:30,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 02:08:30,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 02:08:30,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 02:08:30,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 02:08:30,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 02:08:30,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 02:08:30,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 02:08:30,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 02:08:30,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 02:08:30,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 02:08:30,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 02:08:30,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 02:08:30,848 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 02:08:30,849 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 02:08:30,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 02:08:30,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 02:08:30,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 02:08:30,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 02:08:30,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 02:08:30,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 02:08:30,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 02:08:30,853 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 02:08:30,853 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 02:08:30,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 02:08:30,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 02:08:30,856 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 02:08:30,879 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 02:08:30,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 02:08:30,880 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 02:08:30,880 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 02:08:30,881 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 02:08:30,881 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 02:08:30,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 02:08:30,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 02:08:30,882 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 02:08:30,882 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 02:08:30,883 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 02:08:30,883 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 02:08:30,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 02:08:30,883 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 02:08:30,883 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 02:08:30,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 02:08:30,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 02:08:30,884 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 02:08:30,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 02:08:30,884 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 02:08:30,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 02:08:30,884 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 02:08:30,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 02:08:30,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 02:08:30,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:08:30,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 02:08:30,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 02:08:30,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 02:08:30,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 02:08:30,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 02:08:30,886 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 02:08:30,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 02:08:30,887 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 02:08:30,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 02:08:30,887 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 02:08:30,887 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-16 02:08:31,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 02:08:31,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 02:08:31,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 02:08:31,121 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 02:08:31,122 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 02:08:31,123 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-16 02:08:32,091 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 02:08:32,223 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 02:08:32,224 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-02-16 02:08:32,228 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26e5471a/cc67b11bbd414d42b9ff950a8ca4dd38/FLAG07d09ae86 [2023-02-16 02:08:32,237 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a26e5471a/cc67b11bbd414d42b9ff950a8ca4dd38 [2023-02-16 02:08:32,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 02:08:32,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 02:08:32,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 02:08:32,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 02:08:32,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 02:08:32,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d53fe8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32, skipping insertion in model container [2023-02-16 02:08:32,244 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 02:08:32,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 02:08:32,336 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-16 02:08:32,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:08:32,352 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 02:08:32,359 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-16 02:08:32,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:08:32,372 INFO L208 MainTranslator]: Completed translation [2023-02-16 02:08:32,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32 WrapperNode [2023-02-16 02:08:32,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 02:08:32,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 02:08:32,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 02:08:32,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 02:08:32,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,392 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2023-02-16 02:08:32,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 02:08:32,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 02:08:32,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 02:08:32,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 02:08:32,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,402 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,402 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 02:08:32,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 02:08:32,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 02:08:32,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 02:08:32,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (1/1) ... [2023-02-16 02:08:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:08:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:32,465 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-16 02:08:32,473 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-16 02:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 02:08:32,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-02-16 02:08:32,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-02-16 02:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 02:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 02:08:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 02:08:32,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-16 02:08:32,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-16 02:08:32,528 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 02:08:32,530 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 02:08:32,668 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 02:08:32,672 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 02:08:32,673 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 02:08:32,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:08:32 BoogieIcfgContainer [2023-02-16 02:08:32,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 02:08:32,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 02:08:32,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 02:08:32,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 02:08:32,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:08:32" (1/3) ... [2023-02-16 02:08:32,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193c48bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:08:32, skipping insertion in model container [2023-02-16 02:08:32,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:08:32" (2/3) ... [2023-02-16 02:08:32,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193c48bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:08:32, skipping insertion in model container [2023-02-16 02:08:32,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:08:32" (3/3) ... [2023-02-16 02:08:32,680 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2023-02-16 02:08:32,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 02:08:32,691 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 02:08:32,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 02:08:32,725 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;@77926d7a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 02:08:32,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 02:08:32,728 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-16 02:08:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 02:08:32,733 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:32,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:08:32,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:32,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2023-02-16 02:08:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:32,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621224404] [2023-02-16 02:08:32,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:32,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:32,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582198568] [2023-02-16 02:08:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:32,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:32,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:32,861 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-16 02:08:32,901 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-16 02:08:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:32,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 02:08:32,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:32,985 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-16 02:08:32,985 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:08:32,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:32,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621224404] [2023-02-16 02:08:32,987 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:32,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582198568] [2023-02-16 02:08:32,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582198568] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:08:32,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:08:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 02:08:32,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887917042] [2023-02-16 02:08:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:08:32,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 02:08:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:33,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 02:08:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 02:08:33,030 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-16 02:08:33,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:33,049 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2023-02-16 02:08:33,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 02:08:33,052 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-16 02:08:33,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:33,057 INFO L225 Difference]: With dead ends: 47 [2023-02-16 02:08:33,057 INFO L226 Difference]: Without dead ends: 21 [2023-02-16 02:08:33,060 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-16 02:08:33,063 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-16 02:08:33,064 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-16 02:08:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-16 02:08:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-02-16 02:08:33,115 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-16 02:08:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-02-16 02:08:33,117 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2023-02-16 02:08:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:33,117 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-02-16 02:08:33,118 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-16 02:08:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-02-16 02:08:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 02:08:33,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:33,119 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:08:33,127 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-16 02:08:33,324 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-16 02:08:33,325 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:33,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:33,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2023-02-16 02:08:33,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:33,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253946717] [2023-02-16 02:08:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:33,348 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:33,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305351791] [2023-02-16 02:08:33,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:33,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:33,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:33,365 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-16 02:08:33,368 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-16 02:08:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:33,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 02:08:33,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:33,489 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-16 02:08:33,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:08:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253946717] [2023-02-16 02:08:33,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:33,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305351791] [2023-02-16 02:08:33,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305351791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:08:33,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:08:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 02:08:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843936500] [2023-02-16 02:08:33,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:08:33,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 02:08:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:33,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 02:08:33,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 02:08:33,492 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-16 02:08:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:33,505 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2023-02-16 02:08:33,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 02:08:33,508 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-16 02:08:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:33,510 INFO L225 Difference]: With dead ends: 30 [2023-02-16 02:08:33,510 INFO L226 Difference]: Without dead ends: 23 [2023-02-16 02:08:33,510 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-16 02:08:33,511 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-16 02:08:33,511 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-16 02:08:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-02-16 02:08:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-02-16 02:08:33,514 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-16 02:08:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-02-16 02:08:33,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2023-02-16 02:08:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:33,516 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-02-16 02:08:33,518 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-16 02:08:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-02-16 02:08:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 02:08:33,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:33,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:08:33,525 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-16 02:08:33,723 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-16 02:08:33,723 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:33,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2023-02-16 02:08:33,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:33,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901103512] [2023-02-16 02:08:33,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:33,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:33,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:33,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658372597] [2023-02-16 02:08:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:33,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:33,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:33,733 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-16 02:08:33,735 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-16 02:08:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:33,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 02:08:33,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:33,860 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-16 02:08:33,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 02:08:33,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:33,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901103512] [2023-02-16 02:08:33,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:33,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658372597] [2023-02-16 02:08:33,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658372597] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:08:33,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:08:33,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 02:08:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167884930] [2023-02-16 02:08:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:08:33,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:08:33,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:33,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:08:33,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 02:08:33,863 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 02:08:36,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-02-16 02:08:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:37,002 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-02-16 02:08:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 02:08:37,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2023-02-16 02:08:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:37,005 INFO L225 Difference]: With dead ends: 33 [2023-02-16 02:08:37,006 INFO L226 Difference]: Without dead ends: 31 [2023-02-16 02:08:37,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 02:08:37,007 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:37,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2023-02-16 02:08:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-16 02:08:37,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-02-16 02:08:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 02:08:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-02-16 02:08:37,016 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2023-02-16 02:08:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:37,016 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-02-16 02:08:37,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-16 02:08:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-02-16 02:08:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 02:08:37,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:37,018 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-16 02:08:37,021 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-16 02:08:37,218 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-16 02:08:37,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2023-02-16 02:08:37,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:37,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311465876] [2023-02-16 02:08:37,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:37,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:37,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006651980] [2023-02-16 02:08:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:37,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:37,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:37,244 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-16 02:08:37,249 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-16 02:08:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:37,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 02:08:37,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:37,400 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-16 02:08:37,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:08:37,498 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-16 02:08:37,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311465876] [2023-02-16 02:08:37,499 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:37,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006651980] [2023-02-16 02:08:37,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006651980] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:08:37,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:08:37,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-02-16 02:08:37,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169059608] [2023-02-16 02:08:37,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:08:37,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 02:08:37,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:37,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 02:08:37,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-16 02:08:37,501 INFO L87 Difference]: Start difference. First operand 28 states and 32 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-16 02:08:37,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:37,675 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-02-16 02:08:37,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 02:08:37,676 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-16 02:08:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:37,678 INFO L225 Difference]: With dead ends: 35 [2023-02-16 02:08:37,678 INFO L226 Difference]: Without dead ends: 30 [2023-02-16 02:08:37,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:08:37,679 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:37,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:08:37,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-02-16 02:08:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-16 02:08:37,686 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-16 02:08:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2023-02-16 02:08:37,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2023-02-16 02:08:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:37,687 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2023-02-16 02:08:37,687 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-16 02:08:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2023-02-16 02:08:37,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 02:08:37,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:37,688 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-16 02:08:37,702 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-16 02:08:37,889 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-16 02:08:37,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2023-02-16 02:08:37,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:37,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861684781] [2023-02-16 02:08:37,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:37,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:37,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5541777] [2023-02-16 02:08:37,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:37,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:37,905 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-16 02:08:37,907 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-16 02:08:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:08:37,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 02:08:37,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:37,989 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-16 02:08:37,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:08:38,030 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-16 02:08:38,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:38,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861684781] [2023-02-16 02:08:38,031 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:38,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5541777] [2023-02-16 02:08:38,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5541777] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:08:38,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:08:38,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-02-16 02:08:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074664058] [2023-02-16 02:08:38,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:08:38,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 02:08:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 02:08:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 02:08:38,034 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-16 02:08:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:38,105 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2023-02-16 02:08:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 02:08:38,105 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-16 02:08:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:38,108 INFO L225 Difference]: With dead ends: 57 [2023-02-16 02:08:38,108 INFO L226 Difference]: Without dead ends: 52 [2023-02-16 02:08:38,108 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-16 02:08:38,115 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-16 02:08:38,116 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-16 02:08:38,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-02-16 02:08:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-02-16 02:08:38,129 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-16 02:08:38,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2023-02-16 02:08:38,131 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2023-02-16 02:08:38,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:38,132 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2023-02-16 02:08:38,132 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-16 02:08:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2023-02-16 02:08:38,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-16 02:08:38,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:38,135 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-16 02:08:38,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 02:08:38,339 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-16 02:08:38,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:38,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2023-02-16 02:08:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:38,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828394069] [2023-02-16 02:08:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:38,366 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:38,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1459649944] [2023-02-16 02:08:38,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 02:08:38,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:38,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:38,381 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-16 02:08:38,382 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-16 02:08:38,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 02:08:38,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:08:38,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 02:08:38,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:08:38,538 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-16 02:08:38,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:08:38,652 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-16 02:08:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:08:38,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828394069] [2023-02-16 02:08:38,652 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:08:38,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459649944] [2023-02-16 02:08:38,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459649944] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:08:38,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:08:38,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-16 02:08:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431655728] [2023-02-16 02:08:38,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:08:38,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 02:08:38,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:08:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 02:08:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-02-16 02:08:38,660 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-16 02:08:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:08:38,799 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2023-02-16 02:08:38,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 02:08:38,800 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-16 02:08:38,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:08:38,803 INFO L225 Difference]: With dead ends: 111 [2023-02-16 02:08:38,803 INFO L226 Difference]: Without dead ends: 106 [2023-02-16 02:08:38,804 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-16 02:08:38,805 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 70 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:08:38,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 155 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:08:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-16 02:08:38,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2023-02-16 02:08:38,834 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-16 02:08:38,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2023-02-16 02:08:38,836 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2023-02-16 02:08:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:08:38,838 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2023-02-16 02:08:38,839 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-16 02:08:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2023-02-16 02:08:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-02-16 02:08:38,843 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:08:38,843 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-16 02:08:38,861 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-16 02:08:39,047 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-16 02:08:39,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:08:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:08:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2023-02-16 02:08:39,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:08:39,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046028006] [2023-02-16 02:08:39,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:08:39,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:08:39,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:08:39,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2116603152] [2023-02-16 02:08:39,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 02:08:39,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:08:39,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:08:39,066 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-16 02:08:39,068 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-16 02:09:02,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-16 02:09:02,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:09:02,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 02:09:02,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:09:02,454 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-16 02:09:02,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:09:02,693 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-16 02:09:02,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:09:02,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046028006] [2023-02-16 02:09:02,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-16 02:09:02,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116603152] [2023-02-16 02:09:02,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116603152] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:09:02,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 02:09:02,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-02-16 02:09:02,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460714845] [2023-02-16 02:09:02,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 02:09:02,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 02:09:02,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:09:02,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 02:09:02,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-02-16 02:09:02,696 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-16 02:09:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:09:03,018 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2023-02-16 02:09:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-16 02:09:03,018 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-16 02:09:03,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:09:03,020 INFO L225 Difference]: With dead ends: 201 [2023-02-16 02:09:03,020 INFO L226 Difference]: Without dead ends: 196 [2023-02-16 02:09:03,021 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-16 02:09:03,021 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 104 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:09:03,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 226 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:09:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-16 02:09:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2023-02-16 02:09:03,041 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-16 02:09:03,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2023-02-16 02:09:03,042 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2023-02-16 02:09:03,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:09:03,042 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2023-02-16 02:09:03,043 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-16 02:09:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2023-02-16 02:09:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-02-16 02:09:03,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:09:03,044 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-16 02:09:03,062 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-16 02:09:03,252 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-16 02:09:03,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:09:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:09:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2023-02-16 02:09:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:09:03,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40093049] [2023-02-16 02:09:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:09:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:09:03,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-02-16 02:09:03,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898841223] [2023-02-16 02:09:03,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 02:09:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:09:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:09:03,265 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-16 02:09:03,267 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-16 02:09:03,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 02:09:03,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-16 02:09:03,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 02:09:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:09:03,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 02:09:03,552 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 02:09:03,553 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 02:09:03,581 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-16 02:09:03,761 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-16 02:09:03,772 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-02-16 02:09:03,775 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 02:09:03,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:09:03 BoogieIcfgContainer [2023-02-16 02:09:03,829 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 02:09:03,829 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 02:09:03,829 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 02:09:03,830 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 02:09:03,830 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:08:32" (3/4) ... [2023-02-16 02:09:03,831 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 02:09:03,897 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 02:09:03,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 02:09:03,898 INFO L158 Benchmark]: Toolchain (without parser) took 31658.47ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 94.7MB in the beginning and 87.2MB in the end (delta: 7.5MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2023-02-16 02:09:03,898 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 132.1MB. Free memory was 103.7MB in the beginning and 103.7MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:09:03,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 132.27ms. Allocated memory is still 132.1MB. Free memory was 94.4MB in the beginning and 83.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:09:03,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.73ms. Allocated memory is still 132.1MB. Free memory was 83.9MB in the beginning and 82.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:09:03,899 INFO L158 Benchmark]: Boogie Preprocessor took 19.18ms. Allocated memory is still 132.1MB. Free memory was 82.4MB in the beginning and 81.5MB in the end (delta: 887.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:09:03,899 INFO L158 Benchmark]: RCFGBuilder took 261.38ms. Allocated memory is still 132.1MB. Free memory was 81.2MB in the beginning and 70.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:09:03,899 INFO L158 Benchmark]: TraceAbstraction took 31153.64ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 70.1MB in the beginning and 95.5MB in the end (delta: -25.5MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-02-16 02:09:03,899 INFO L158 Benchmark]: Witness Printer took 68.04ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 87.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 02:09:03,901 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.15ms. Allocated memory is still 132.1MB. Free memory was 103.7MB in the beginning and 103.7MB in the end (delta: 72.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 132.27ms. Allocated memory is still 132.1MB. Free memory was 94.4MB in the beginning and 83.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.73ms. Allocated memory is still 132.1MB. Free memory was 83.9MB in the beginning and 82.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.18ms. Allocated memory is still 132.1MB. Free memory was 82.4MB in the beginning and 81.5MB in the end (delta: 887.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 261.38ms. Allocated memory is still 132.1MB. Free memory was 81.2MB in the beginning and 70.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31153.64ms. Allocated memory was 132.1MB in the beginning and 159.4MB in the end (delta: 27.3MB). Free memory was 70.1MB in the beginning and 95.5MB in the end (delta: -25.5MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Witness Printer took 68.04ms. Allocated memory is still 159.4MB. Free memory was 94.5MB in the beginning and 87.2MB 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=274366097, counter=0, R=16565] [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=274366097, counter=0, R=16565] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=274366097, counter=0, R=16565, r=33128, u=33131, v=1] [L34] EXPR counter++ VAL [A=274366097, counter=1, counter++=0, R=16565, r=33128, u=33131, 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=274366097, counter=1, r=33128, R=16565, u=33131, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=1, R=16565, r=33128, u=33131, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=1, r=33127, R=16565, u=33131, v=3] [L34] EXPR counter++ VAL [A=274366097, counter=2, counter++=1, r=33127, R=16565, u=33131, 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=274366097, counter=2, r=33127, R=16565, u=33131, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=2, r=33127, R=16565, u=33131, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=2, r=33124, R=16565, u=33131, v=5] [L34] EXPR counter++ VAL [A=274366097, counter=3, counter++=2, R=16565, r=33124, u=33131, 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=274366097, counter=3, r=33124, R=16565, u=33131, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=3, r=33124, R=16565, u=33131, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=3, r=33119, R=16565, u=33131, v=7] [L34] EXPR counter++ VAL [A=274366097, counter=4, counter++=3, r=33119, R=16565, u=33131, 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=274366097, counter=4, r=33119, R=16565, u=33131, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=4, R=16565, r=33119, u=33131, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=4, r=33112, R=16565, u=33131, v=9] [L34] EXPR counter++ VAL [A=274366097, counter=5, counter++=4, r=33112, R=16565, u=33131, 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=274366097, counter=5, r=33112, R=16565, u=33131, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=5, r=33112, R=16565, u=33131, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=5, r=33103, R=16565, u=33131, v=11] [L34] EXPR counter++ VAL [A=274366097, counter=6, counter++=5, R=16565, r=33103, u=33131, 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=274366097, counter=6, r=33103, R=16565, u=33131, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=6, r=33103, R=16565, u=33131, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=6, r=33092, R=16565, u=33131, v=13] [L34] EXPR counter++ VAL [A=274366097, counter=7, counter++=6, r=33092, R=16565, u=33131, 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=274366097, counter=7, r=33092, R=16565, u=33131, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=7, R=16565, r=33092, u=33131, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=7, r=33079, R=16565, u=33131, v=15] [L34] EXPR counter++ VAL [A=274366097, counter=8, counter++=7, R=16565, r=33079, u=33131, 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=274366097, counter=8, r=33079, R=16565, u=33131, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=8, R=16565, r=33079, u=33131, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=8, R=16565, r=33064, u=33131, v=17] [L34] EXPR counter++ VAL [A=274366097, counter=9, counter++=8, R=16565, r=33064, u=33131, 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=274366097, counter=9, r=33064, R=16565, u=33131, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=9, R=16565, r=33064, u=33131, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=9, r=33047, R=16565, u=33131, v=19] [L34] EXPR counter++ VAL [A=274366097, counter=10, counter++=9, r=33047, R=16565, u=33131, 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=274366097, counter=10, R=16565, r=33047, u=33131, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=10, r=33047, R=16565, u=33131, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=10, r=33028, R=16565, u=33131, v=21] [L34] EXPR counter++ VAL [A=274366097, counter=11, counter++=10, R=16565, r=33028, u=33131, 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=274366097, counter=11, r=33028, R=16565, u=33131, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=11, R=16565, r=33028, u=33131, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=11, R=16565, r=33007, u=33131, v=23] [L34] EXPR counter++ VAL [A=274366097, counter=12, counter++=11, r=33007, R=16565, u=33131, 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=274366097, counter=12, R=16565, r=33007, u=33131, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=12, r=33007, R=16565, u=33131, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=12, R=16565, r=32984, u=33131, v=25] [L34] EXPR counter++ VAL [A=274366097, counter=13, counter++=12, R=16565, r=32984, u=33131, 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=274366097, counter=13, R=16565, r=32984, u=33131, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=13, R=16565, r=32984, u=33131, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=13, R=16565, r=32959, u=33131, v=27] [L34] EXPR counter++ VAL [A=274366097, counter=14, counter++=13, r=32959, R=16565, u=33131, 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=274366097, counter=14, r=32959, R=16565, u=33131, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=14, R=16565, r=32959, u=33131, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=14, R=16565, r=32932, u=33131, v=29] [L34] EXPR counter++ VAL [A=274366097, counter=15, counter++=14, R=16565, r=32932, u=33131, 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=274366097, counter=15, r=32932, R=16565, u=33131, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=15, R=16565, r=32932, u=33131, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=15, r=32903, R=16565, u=33131, v=31] [L34] EXPR counter++ VAL [A=274366097, counter=16, counter++=15, R=16565, r=32903, u=33131, 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=274366097, counter=16, r=32903, R=16565, u=33131, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=16, r=32903, R=16565, u=33131, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=16, R=16565, r=32872, u=33131, v=33] [L34] EXPR counter++ VAL [A=274366097, counter=17, counter++=16, r=32872, R=16565, u=33131, 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=274366097, counter=17, r=32872, R=16565, u=33131, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=17, R=16565, r=32872, u=33131, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=17, R=16565, r=32839, u=33131, v=35] [L34] EXPR counter++ VAL [A=274366097, counter=18, counter++=17, R=16565, r=32839, u=33131, 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=274366097, counter=18, r=32839, R=16565, u=33131, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=18, r=32839, R=16565, u=33131, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=18, R=16565, r=32804, u=33131, v=37] [L34] EXPR counter++ VAL [A=274366097, counter=19, counter++=18, R=16565, r=32804, u=33131, 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=274366097, counter=19, R=16565, r=32804, u=33131, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=19, r=32804, R=16565, u=33131, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=19, r=32767, R=16565, u=33131, v=39] [L34] EXPR counter++ VAL [A=274366097, counter=20, counter++=19, r=32767, R=16565, u=33131, 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=274366097, counter=20, r=32767, R=16565, u=33131, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=274366097, counter=20, r=32767, R=16565, u=33131, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274366097, counter=20, R=16565, r=32728, u=33131, v=41] [L34] EXPR counter++ VAL [A=274366097, counter=21, counter++=20, r=32728, R=16565, u=33131, 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: 31.1s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 222 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 735 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 550 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 318 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 185 mSDtfsCounter, 318 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 422 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 23.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1239 SizeOfPredicates, 26 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 68 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-16 02:09:03,917 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