/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 02:14:44,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 02:14:44,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 02:14:44,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 02:14:44,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 02:14:44,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 02:14:44,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 02:14:44,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 02:14:44,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 02:14:44,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 02:14:44,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 02:14:44,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 02:14:44,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 02:14:44,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 02:14:44,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 02:14:44,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 02:14:44,661 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 02:14:44,662 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 02:14:44,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 02:14:44,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 02:14:44,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 02:14:44,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 02:14:44,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 02:14:44,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 02:14:44,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 02:14:44,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 02:14:44,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 02:14:44,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 02:14:44,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 02:14:44,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 02:14:44,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 02:14:44,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 02:14:44,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 02:14:44,686 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 02:14:44,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 02:14:44,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 02:14:44,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 02:14:44,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 02:14:44,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 02:14:44,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 02:14:44,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 02:14:44,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-02 02:14:44,717 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 02:14:44,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 02:14:44,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 02:14:44,718 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 02:14:44,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 02:14:44,719 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 02:14:44,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 02:14:44,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 02:14:44,720 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 02:14:44,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 02:14:44,720 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 02:14:44,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 02:14:44,722 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 02:14:44,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 02:14:44,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 02:14:44,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 02:14:44,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 02:14:44,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 02:14:44,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 02:14:44,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 02:14:44,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 02:14:44,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 02:14:44,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 02:14:44,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 02:14:44,723 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 02:14:44,724 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 02:14:44,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 02:14:44,724 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 02:14:44,724 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 [2023-04-02 02:14:44,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 02:14:44,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 02:14:44,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 02:14:44,983 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 02:14:44,983 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 02:14:44,984 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-04-02 02:14:46,073 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 02:14:46,253 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 02:14:46,254 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-04-02 02:14:46,261 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b293f4d/bb5c572572604a73bafab821f08fc225/FLAG5d6f57b91 [2023-04-02 02:14:46,275 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35b293f4d/bb5c572572604a73bafab821f08fc225 [2023-04-02 02:14:46,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 02:14:46,279 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 02:14:46,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 02:14:46,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 02:14:46,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 02:14:46,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7438e8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46, skipping insertion in model container [2023-04-02 02:14:46,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 02:14:46,305 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 02:14:46,427 WARN L247 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-04-02 02:14:46,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 02:14:46,451 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 02:14:46,460 WARN L247 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-04-02 02:14:46,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 02:14:46,477 INFO L208 MainTranslator]: Completed translation [2023-04-02 02:14:46,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46 WrapperNode [2023-04-02 02:14:46,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 02:14:46,478 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 02:14:46,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 02:14:46,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 02:14:46,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,508 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 02:14:46,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 02:14:46,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 02:14:46,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 02:14:46,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (1/1) ... [2023-04-02 02:14:46,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 02:14:46,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:46,534 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-04-02 02:14:46,535 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-04-02 02:14:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 02:14:46,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 02:14:46,569 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 02:14:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 02:14:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 02:14:46,570 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 02:14:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 02:14:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 02:14:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 02:14:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 02:14:46,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 02:14:46,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 02:14:46,629 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 02:14:46,630 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 02:14:46,766 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 02:14:46,770 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 02:14:46,771 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 02:14:46,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:14:46 BoogieIcfgContainer [2023-04-02 02:14:46,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 02:14:46,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 02:14:46,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 02:14:46,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 02:14:46,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 02:14:46" (1/3) ... [2023-04-02 02:14:46,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f980f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:14:46, skipping insertion in model container [2023-04-02 02:14:46,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 02:14:46" (2/3) ... [2023-04-02 02:14:46,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17f980f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 02:14:46, skipping insertion in model container [2023-04-02 02:14:46,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 02:14:46" (3/3) ... [2023-04-02 02:14:46,778 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2023-04-02 02:14:46,808 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 02:14:46,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 02:14:46,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 02:14:46,874 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;@30633492, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 02:14:46,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 02:14:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 02:14:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 02:14:46,882 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:46,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:14:46,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:46,887 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2023-04-02 02:14:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615654372] [2023-04-02 02:14:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:46,982 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:46,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1026507160] [2023-04-02 02:14:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:46,986 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-04-02 02:14:46,988 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-04-02 02:14:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:14:47,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-02 02:14:47,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-02 02:14:47,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 02:14:47,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:47,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615654372] [2023-04-02 02:14:47,134 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:47,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026507160] [2023-04-02 02:14:47,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026507160] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 02:14:47,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 02:14:47,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 02:14:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508606252] [2023-04-02 02:14:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:14:47,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 02:14:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 02:14:47,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 02:14:47,176 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:14:47,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:47,199 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2023-04-02 02:14:47,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 02:14:47,202 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2023-04-02 02:14:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:47,210 INFO L225 Difference]: With dead ends: 53 [2023-04-02 02:14:47,210 INFO L226 Difference]: Without dead ends: 25 [2023-04-02 02:14:47,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-04-02 02:14:47,218 INFO L413 NwaCegarLoop]: 34 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, 34 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-04-02 02:14:47,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:14:47,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-02 02:14:47,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-02 02:14:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 02:14:47,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-04-02 02:14:47,258 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2023-04-02 02:14:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:47,259 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-04-02 02:14:47,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:14:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-04-02 02:14:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 02:14:47,261 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:47,262 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:14:47,268 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-04-02 02:14:47,467 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-04-02 02:14:47,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:47,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2023-04-02 02:14:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:47,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708129595] [2023-04-02 02:14:47,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:47,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:47,485 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:47,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [737839149] [2023-04-02 02:14:47,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:47,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:47,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:47,487 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-04-02 02:14:47,492 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-04-02 02:14:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:14:47,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2023-04-02 02:14:47,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:47,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:47,672 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 02:14:47,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708129595] [2023-04-02 02:14:47,673 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737839149] [2023-04-02 02:14:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737839149] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 02:14:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 02:14:47,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-02 02:14:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702586694] [2023-04-02 02:14:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:14:47,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-02 02:14:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-02 02:14:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-02 02:14:47,675 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:14:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:47,700 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-04-02 02:14:47,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-02 02:14:47,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-04-02 02:14:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:47,702 INFO L225 Difference]: With dead ends: 34 [2023-04-02 02:14:47,702 INFO L226 Difference]: Without dead ends: 27 [2023-04-02 02:14:47,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-04-02 02:14:47,704 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 02:14:47,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:14:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-02 02:14:47,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-02 02:14:47,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 02:14:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-04-02 02:14:47,711 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2023-04-02 02:14:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:47,712 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-04-02 02:14:47,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-04-02 02:14:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-04-02 02:14:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 02:14:47,713 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:47,714 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 02:14:47,719 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-04-02 02:14:47,917 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-04-02 02:14:47,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:47,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2023-04-02 02:14:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179189340] [2023-04-02 02:14:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:47,930 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:47,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1375455665] [2023-04-02 02:14:47,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:47,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:47,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:47,932 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-04-02 02:14:47,939 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-04-02 02:14:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:14:48,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-02 02:14:48,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:48,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 02:14:48,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179189340] [2023-04-02 02:14:48,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:48,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375455665] [2023-04-02 02:14:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375455665] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 02:14:48,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 02:14:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-02 02:14:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675381786] [2023-04-02 02:14:48,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 02:14:48,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-02 02:14:48,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:48,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-02 02:14:48,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-02 02:14:48,138 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 02:14:49,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-04-02 02:14:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:49,982 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2023-04-02 02:14:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-02 02:14:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-04-02 02:14:49,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:49,984 INFO L225 Difference]: With dead ends: 39 [2023-04-02 02:14:49,984 INFO L226 Difference]: Without dead ends: 37 [2023-04-02 02:14:49,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-04-02 02:14:49,985 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-04-02 02:14:49,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-04-02 02:14:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-04-02 02:14:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2023-04-02 02:14:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 02:14:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2023-04-02 02:14:50,006 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2023-04-02 02:14:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:50,006 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2023-04-02 02:14:50,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-02 02:14:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2023-04-02 02:14:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 02:14:50,010 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:50,010 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, 1, 1, 1, 1] [2023-04-02 02:14:50,018 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-04-02 02:14:50,210 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-04-02 02:14:50,211 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:50,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:50,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2023-04-02 02:14:50,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:50,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934813421] [2023-04-02 02:14:50,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:50,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:50,223 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700253188] [2023-04-02 02:14:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:50,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:50,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:50,228 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-04-02 02:14:50,231 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-04-02 02:14:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:14:50,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 02:14:50,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:50,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:14:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:50,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934813421] [2023-04-02 02:14:50,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:50,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700253188] [2023-04-02 02:14:50,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700253188] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:14:50,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:14:50,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-04-02 02:14:50,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686838295] [2023-04-02 02:14:50,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:14:50,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-02 02:14:50,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:50,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-02 02:14:50,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-04-02 02:14:50,502 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2023-04-02 02:14:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:50,701 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2023-04-02 02:14:50,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-02 02:14:50,701 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2023-04-02 02:14:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:50,704 INFO L225 Difference]: With dead ends: 43 [2023-04-02 02:14:50,706 INFO L226 Difference]: Without dead ends: 38 [2023-04-02 02:14:50,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-04-02 02:14:50,707 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:14:50,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 120 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:14:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-02 02:14:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-04-02 02:14:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 02:14:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-04-02 02:14:50,716 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2023-04-02 02:14:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:50,717 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-04-02 02:14:50,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2023-04-02 02:14:50,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-04-02 02:14:50,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-04-02 02:14:50,718 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:50,718 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, 1, 1, 1, 1] [2023-04-02 02:14:50,726 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-04-02 02:14:50,925 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-04-02 02:14:50,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:50,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2023-04-02 02:14:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:50,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979810926] [2023-04-02 02:14:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:50,936 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:50,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830262471] [2023-04-02 02:14:50,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:50,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:50,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:50,937 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-04-02 02:14:50,940 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-04-02 02:14:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 02:14:50,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 02:14:50,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:51,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:14:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:51,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:51,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979810926] [2023-04-02 02:14:51,105 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830262471] [2023-04-02 02:14:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830262471] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:14:51,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:14:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 02:14:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538890129] [2023-04-02 02:14:51,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:14:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 02:14:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 02:14:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-02 02:14:51,108 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-02 02:14:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:51,182 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2023-04-02 02:14:51,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 02:14:51,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2023-04-02 02:14:51,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:51,186 INFO L225 Difference]: With dead ends: 61 [2023-04-02 02:14:51,186 INFO L226 Difference]: Without dead ends: 56 [2023-04-02 02:14:51,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 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-04-02 02:14:51,187 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 02:14:51,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 117 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:14:51,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-04-02 02:14:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-04-02 02:14:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-02 02:14:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2023-04-02 02:14:51,213 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2023-04-02 02:14:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:51,214 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2023-04-02 02:14:51,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-02 02:14:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2023-04-02 02:14:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-04-02 02:14:51,215 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:51,215 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, 1, 1, 1, 1] [2023-04-02 02:14:51,228 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-04-02 02:14:51,421 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-04-02 02:14:51,422 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:51,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:51,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2023-04-02 02:14:51,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567126435] [2023-04-02 02:14:51,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:51,440 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:51,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1753082201] [2023-04-02 02:14:51,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 02:14:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:51,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:51,450 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-04-02 02:14:51,473 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-04-02 02:14:51,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 02:14:51,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 02:14:51,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 02:14:51,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:51,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:14:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-02 02:14:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567126435] [2023-04-02 02:14:51,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:51,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753082201] [2023-04-02 02:14:51,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753082201] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:14:51,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:14:51,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 02:14:51,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043593654] [2023-04-02 02:14:51,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:14:51,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 02:14:51,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 02:14:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-04-02 02:14:51,789 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 02:14:51,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:51,958 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2023-04-02 02:14:51,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 02:14:51,960 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2023-04-02 02:14:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:51,965 INFO L225 Difference]: With dead ends: 115 [2023-04-02 02:14:51,965 INFO L226 Difference]: Without dead ends: 110 [2023-04-02 02:14:51,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 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-04-02 02:14:51,967 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 02:14:51,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 128 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 02:14:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-04-02 02:14:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2023-04-02 02:14:52,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-04-02 02:14:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-04-02 02:14:52,010 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2023-04-02 02:14:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:52,010 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-04-02 02:14:52,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2023-04-02 02:14:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-04-02 02:14:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-04-02 02:14:52,013 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:52,013 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, 1, 1, 1, 1] [2023-04-02 02:14:52,021 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-04-02 02:14:52,219 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-04-02 02:14:52,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:52,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2023-04-02 02:14:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677902465] [2023-04-02 02:14:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:52,234 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:52,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [567485253] [2023-04-02 02:14:52,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 02:14:52,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:52,236 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-04-02 02:14:52,263 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-04-02 02:14:52,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-04-02 02:14:52,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 02:14:52,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 02:14:52,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 02:14:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-02 02:14:52,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 02:14:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-04-02 02:14:53,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 02:14:53,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677902465] [2023-04-02 02:14:53,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 02:14:53,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567485253] [2023-04-02 02:14:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567485253] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 02:14:53,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 02:14:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-04-02 02:14:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361703623] [2023-04-02 02:14:53,230 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 02:14:53,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-02 02:14:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 02:14:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-02 02:14:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-04-02 02:14:53,232 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2023-04-02 02:14:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 02:14:53,647 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2023-04-02 02:14:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-02 02:14:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2023-04-02 02:14:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 02:14:53,649 INFO L225 Difference]: With dead ends: 205 [2023-04-02 02:14:53,649 INFO L226 Difference]: Without dead ends: 200 [2023-04-02 02:14:53,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-04-02 02:14:53,650 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 150 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 02:14:53,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 188 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 02:14:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-04-02 02:14:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-04-02 02:14:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-04-02 02:14:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2023-04-02 02:14:53,694 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 113 [2023-04-02 02:14:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 02:14:53,695 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2023-04-02 02:14:53,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2023-04-02 02:14:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2023-04-02 02:14:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2023-04-02 02:14:53,703 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 02:14:53,703 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, 1, 1, 1, 1] [2023-04-02 02:14:53,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-02 02:14:53,915 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-04-02 02:14:53,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 02:14:53,916 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 02:14:53,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 4 times [2023-04-02 02:14:53,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 02:14:53,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852996394] [2023-04-02 02:14:53,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 02:14:53,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 02:14:53,945 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 02:14:53,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800869269] [2023-04-02 02:14:53,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-02 02:14:53,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 02:14:53,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 02:14:53,947 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-04-02 02:14:53,949 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-04-02 02:14:54,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-02 02:14:54,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-04-02 02:14:54,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 02:14:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 02:14:54,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 02:14:54,506 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 02:14:54,507 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 02:14:54,517 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-04-02 02:14:54,715 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-04-02 02:14:54,718 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-04-02 02:14:54,722 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 02:14:54,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 02:14:54 BoogieIcfgContainer [2023-04-02 02:14:54,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 02:14:54,819 INFO L158 Benchmark]: Toolchain (without parser) took 8539.90ms. Allocated memory is still 257.9MB. Free memory was 204.7MB in the beginning and 146.9MB in the end (delta: 57.9MB). Peak memory consumption was 58.8MB. Max. memory is 8.0GB. [2023-04-02 02:14:54,819 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 02:14:54,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.67ms. Allocated memory is still 257.9MB. Free memory was 204.7MB in the beginning and 194.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 02:14:54,819 INFO L158 Benchmark]: Boogie Preprocessor took 32.12ms. Allocated memory is still 257.9MB. Free memory was 194.3MB in the beginning and 192.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 02:14:54,820 INFO L158 Benchmark]: RCFGBuilder took 261.01ms. Allocated memory is still 257.9MB. Free memory was 192.8MB in the beginning and 181.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-02 02:14:54,820 INFO L158 Benchmark]: TraceAbstraction took 8044.52ms. Allocated memory is still 257.9MB. Free memory was 180.2MB in the beginning and 146.9MB in the end (delta: 33.3MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. [2023-04-02 02:14:54,821 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 134.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.67ms. Allocated memory is still 257.9MB. Free memory was 204.7MB in the beginning and 194.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.12ms. Allocated memory is still 257.9MB. Free memory was 194.3MB in the beginning and 192.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 261.01ms. Allocated memory is still 257.9MB. Free memory was 192.8MB in the beginning and 181.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8044.52ms. Allocated memory is still 257.9MB. Free memory was 180.2MB in the beginning and 146.9MB in the end (delta: 33.3MB). Peak memory consumption was 34.7MB. Max. memory is 8.0GB. * 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 [\old(counter)=26, 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, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=46657, R=217, \old(counter)=0, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=46657, R=217, \old(counter)=0, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=46657, R=217, \old(counter)=0, counter=0, r=432, u=435, v=1] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=0, counter=1, r=432, u=435, 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, \old(counter)=0, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=1, r=432, u=435, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=1, r=432, u=435, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=1, r=431, u=435, v=3] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=1, counter=2, r=431, u=435, 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, \old(counter)=0, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=2, r=431, u=435, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=2, r=431, u=435, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=2, r=428, u=435, v=5] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=2, counter=3, r=428, u=435, 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, \old(counter)=0, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=3, r=428, u=435, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=3, r=428, u=435, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=3, r=423, u=435, v=7] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=3, counter=4, r=423, u=435, 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, \old(counter)=0, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=4, r=423, u=435, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=4, r=423, u=435, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=4, r=416, u=435, v=9] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=4, counter=5, r=416, u=435, 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, \old(counter)=0, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=5, r=416, u=435, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=5, r=416, u=435, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=5, r=407, u=435, v=11] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=5, counter=6, r=407, u=435, 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, \old(counter)=0, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=6, r=407, u=435, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=6, r=407, u=435, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=6, r=396, u=435, v=13] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=6, counter=7, r=396, u=435, 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, \old(counter)=0, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=7, r=396, u=435, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=7, r=396, u=435, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=7, r=383, u=435, v=15] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=7, counter=8, r=383, u=435, 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, \old(counter)=0, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=8, r=383, u=435, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=8, r=383, u=435, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=8, r=368, u=435, v=17] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=8, counter=9, r=368, u=435, 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, \old(counter)=0, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=9, r=368, u=435, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=9, r=368, u=435, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=9, r=351, u=435, v=19] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=9, counter=10, r=351, u=435, 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, \old(counter)=0, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=10, r=351, u=435, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=10, r=351, u=435, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=10, r=332, u=435, v=21] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=10, counter=11, r=332, u=435, 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, \old(counter)=0, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=11, r=332, u=435, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=11, r=332, u=435, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=11, r=311, u=435, v=23] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=11, counter=12, r=311, u=435, 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, \old(counter)=0, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=12, r=311, u=435, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=12, r=311, u=435, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=12, r=288, u=435, v=25] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=12, counter=13, r=288, u=435, 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, \old(counter)=0, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=13, r=288, u=435, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=13, r=288, u=435, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=13, r=263, u=435, v=27] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=13, counter=14, r=263, u=435, 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, \old(counter)=0, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=14, r=263, u=435, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=14, r=263, u=435, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=14, r=236, u=435, v=29] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=14, counter=15, r=236, u=435, 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, \old(counter)=0, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=15, r=236, u=435, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=15, r=236, u=435, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=15, r=207, u=435, v=31] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=15, counter=16, r=207, u=435, 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, \old(counter)=0, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=16, r=207, u=435, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=16, r=207, u=435, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=16, r=176, u=435, v=33] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=16, counter=17, r=176, u=435, 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, \old(counter)=0, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=17, r=176, u=435, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=17, r=176, u=435, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=17, r=143, u=435, v=35] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=17, counter=18, r=143, u=435, 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, \old(counter)=0, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=18, r=143, u=435, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=18, r=143, u=435, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=18, r=108, u=435, v=37] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=18, counter=19, r=108, u=435, 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, \old(counter)=0, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=19, r=108, u=435, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=19, r=108, u=435, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=19, r=71, u=435, v=39] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=19, counter=20, r=71, u=435, 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, \old(counter)=0, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=46657, R=217, \old(counter)=0, counter=20, r=71, u=435, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=46657, R=217, \old(counter)=0, counter=20, r=71, u=435, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=46657, R=217, \old(counter)=0, counter=20, r=32, u=435, v=41] [L34] EXPR counter++ VAL [A=46657, R=217, \old(counter)=0, counter++=20, counter=21, r=32, u=435, 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, \old(counter)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 249 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 736 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 254 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 183 mSDtfsCounter, 254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 470 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1331 SizeOfPredicates, 24 NumberOfNonLiveVariables, 944 ConjunctsInSsa, 76 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-04-02 02:14:54,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...