/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/bresenham-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-02 01:51:31,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-02 01:51:31,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-02 01:51:31,656 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-02 01:51:31,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-02 01:51:31,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-02 01:51:31,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-02 01:51:31,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-02 01:51:31,660 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-02 01:51:31,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-02 01:51:31,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-02 01:51:31,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-02 01:51:31,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-02 01:51:31,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-02 01:51:31,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-02 01:51:31,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-02 01:51:31,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-02 01:51:31,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-02 01:51:31,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-02 01:51:31,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-02 01:51:31,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-02 01:51:31,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-02 01:51:31,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-02 01:51:31,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-02 01:51:31,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-02 01:51:31,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-02 01:51:31,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-02 01:51:31,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-02 01:51:31,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-02 01:51:31,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-02 01:51:31,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-02 01:51:31,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-02 01:51:31,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-02 01:51:31,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-02 01:51:31,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-02 01:51:31,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-02 01:51:31,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-02 01:51:31,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-02 01:51:31,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-02 01:51:31,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-02 01:51:31,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-02 01:51:31,683 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 01:51:31,697 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-02 01:51:31,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-02 01:51:31,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-02 01:51:31,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-02 01:51:31,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-02 01:51:31,698 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-02 01:51:31,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-02 01:51:31,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-02 01:51:31,699 INFO L138 SettingsManager]: * Use SBE=true [2023-04-02 01:51:31,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-02 01:51:31,699 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-02 01:51:31,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-02 01:51:31,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-02 01:51:31,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-02 01:51:31,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-02 01:51:31,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-02 01:51:31,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-02 01:51:31,701 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-02 01:51:31,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-02 01:51:31,702 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-02 01:51:31,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-02 01:51:31,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-02 01:51:31,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-02 01:51:31,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-02 01:51:31,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:51:31,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-02 01:51:31,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-02 01:51:31,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-02 01:51:31,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-02 01:51:31,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-02 01:51:31,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-02 01:51:31,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-02 01:51:31,704 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-02 01:51:31,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-02 01:51:31,704 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-02 01:51:31,704 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 01:51:31,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-02 01:51:31,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-02 01:51:31,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-02 01:51:31,923 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-02 01:51:31,924 INFO L275 PluginConnector]: CDTParser initialized [2023-04-02 01:51:31,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-04-02 01:51:33,033 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-02 01:51:33,209 INFO L351 CDTParser]: Found 1 translation units. [2023-04-02 01:51:33,212 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-04-02 01:51:33,215 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ab07d39/4dbe345ba6554c489e0f96706b25b019/FLAG67fe59b7c [2023-04-02 01:51:33,225 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5ab07d39/4dbe345ba6554c489e0f96706b25b019 [2023-04-02 01:51:33,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-02 01:51:33,228 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-02 01:51:33,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-02 01:51:33,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-02 01:51:33,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-02 01:51:33,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152d9485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33, skipping insertion in model container [2023-04-02 01:51:33,233 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-02 01:51:33,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-02 01:51:33,347 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/bresenham-ll_unwindbound20.c[597,610] [2023-04-02 01:51:33,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:51:33,378 INFO L203 MainTranslator]: Completed pre-run [2023-04-02 01:51:33,388 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/bresenham-ll_unwindbound20.c[597,610] [2023-04-02 01:51:33,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-02 01:51:33,415 INFO L208 MainTranslator]: Completed translation [2023-04-02 01:51:33,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33 WrapperNode [2023-04-02 01:51:33,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-02 01:51:33,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-02 01:51:33,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-02 01:51:33,417 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-02 01:51:33,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,442 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-02 01:51:33,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-02 01:51:33,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-02 01:51:33,444 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-02 01:51:33,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (1/1) ... [2023-04-02 01:51:33,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-02 01:51:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:33,477 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 01:51:33,479 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 01:51:33,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-02 01:51:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-02 01:51:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-02 01:51:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-02 01:51:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-02 01:51:33,513 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-02 01:51:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-02 01:51:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-02 01:51:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-02 01:51:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-02 01:51:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-02 01:51:33,513 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-02 01:51:33,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-02 01:51:33,567 INFO L236 CfgBuilder]: Building ICFG [2023-04-02 01:51:33,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-02 01:51:33,699 INFO L277 CfgBuilder]: Performing block encoding [2023-04-02 01:51:33,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-02 01:51:33,703 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-02 01:51:33,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:51:33 BoogieIcfgContainer [2023-04-02 01:51:33,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-02 01:51:33,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-02 01:51:33,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-02 01:51:33,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-02 01:51:33,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.04 01:51:33" (1/3) ... [2023-04-02 01:51:33,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3370c173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:51:33, skipping insertion in model container [2023-04-02 01:51:33,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.04 01:51:33" (2/3) ... [2023-04-02 01:51:33,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3370c173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.04 01:51:33, skipping insertion in model container [2023-04-02 01:51:33,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.04 01:51:33" (3/3) ... [2023-04-02 01:51:33,712 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-04-02 01:51:33,723 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-02 01:51:33,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-02 01:51:33,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-02 01:51:33,758 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;@51c4e6d1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-02 01:51:33,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-02 01:51:33,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 01:51:33,765 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:33,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:33,766 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:33,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:33,769 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 1 times [2023-04-02 01:51:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701696273] [2023-04-02 01:51:33,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:33,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:33,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:33,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:33,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701696273] [2023-04-02 01:51:33,874 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-04-02 01:51:33,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152494926] [2023-04-02 01:51:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:33,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:33,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:33,877 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 01:51:33,878 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 01:51:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:33,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 1 conjunts are in the unsatisfiable core [2023-04-02 01:51:33,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:33,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:51:33,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152494926] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:51:33,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:51:33,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-02 01:51:33,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39206790] [2023-04-02 01:51:33,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:51:33,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-02 01:51:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:34,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-02 01:51:34,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-02 01:51:34,019 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:34,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:34,035 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2023-04-02 01:51:34,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-02 01:51:34,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 01:51:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:34,042 INFO L225 Difference]: With dead ends: 44 [2023-04-02 01:51:34,042 INFO L226 Difference]: Without dead ends: 20 [2023-04-02 01:51:34,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 01:51:34,049 INFO L413 NwaCegarLoop]: 28 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, 28 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 01:51:34,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:34,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-04-02 01:51:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-04-02 01:51:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-02 01:51:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-04-02 01:51:34,079 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2023-04-02 01:51:34,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:34,080 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-04-02 01:51:34,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-04-02 01:51:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-02 01:51:34,081 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:34,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:34,091 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 01:51:34,291 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 01:51:34,291 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:34,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:34,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 1 times [2023-04-02 01:51:34,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:34,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93427299] [2023-04-02 01:51:34,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:34,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:34,304 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1613340262] [2023-04-02 01:51:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:34,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:34,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:34,306 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 01:51:34,308 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 01:51:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:34,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-02 01:51:34,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:34,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-02 01:51:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:34,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93427299] [2023-04-02 01:51:34,489 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:34,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613340262] [2023-04-02 01:51:34,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613340262] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-02 01:51:34,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-02 01:51:34,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-02 01:51:34,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779169439] [2023-04-02 01:51:34,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-02 01:51:34,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-04-02 01:51:34,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:34,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-04-02 01:51:34,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-04-02 01:51:34,491 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:34,583 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-04-02 01:51:34,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-02 01:51:34,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-02 01:51:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:34,585 INFO L225 Difference]: With dead ends: 34 [2023-04-02 01:51:34,585 INFO L226 Difference]: Without dead ends: 29 [2023-04-02 01:51:34,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:51:34,587 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:34,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 61 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-04-02 01:51:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2023-04-02 01:51:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-04-02 01:51:34,602 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2023-04-02 01:51:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:34,602 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-04-02 01:51:34,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-02 01:51:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-04-02 01:51:34,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-02 01:51:34,604 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:34,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:34,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-04-02 01:51:34,810 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 01:51:34,811 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:34,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:34,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 1 times [2023-04-02 01:51:34,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:34,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127597125] [2023-04-02 01:51:34,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:34,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:34,834 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:34,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1284105866] [2023-04-02 01:51:34,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:34,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:34,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:34,841 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 01:51:34,842 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 01:51:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:34,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:34,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:35,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:35,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127597125] [2023-04-02 01:51:35,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:35,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284105866] [2023-04-02 01:51:35,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284105866] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:35,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:35,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-04-02 01:51:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808147042] [2023-04-02 01:51:35,384 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:35,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-02 01:51:35,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:35,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-02 01:51:35,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2023-04-02 01:51:35,385 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:35,635 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-04-02 01:51:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-02 01:51:35,636 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2023-04-02 01:51:35,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:35,636 INFO L225 Difference]: With dead ends: 45 [2023-04-02 01:51:35,636 INFO L226 Difference]: Without dead ends: 38 [2023-04-02 01:51:35,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2023-04-02 01:51:35,637 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:35,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 136 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-02 01:51:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-04-02 01:51:35,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2023-04-02 01:51:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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 01:51:35,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-04-02 01:51:35,644 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2023-04-02 01:51:35,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:35,644 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-04-02 01:51:35,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-02 01:51:35,645 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-04-02 01:51:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-02 01:51:35,645 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:35,646 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:35,657 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 01:51:35,852 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 01:51:35,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:35,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:35,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 1 times [2023-04-02 01:51:35,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:35,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356427810] [2023-04-02 01:51:35,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:35,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:35,863 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641843899] [2023-04-02 01:51:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:35,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:35,864 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 01:51:35,868 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 01:51:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:35,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2023-04-02 01:51:35,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:35,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:35,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:35,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:35,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356427810] [2023-04-02 01:51:35,983 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:35,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641843899] [2023-04-02 01:51:35,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641843899] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:35,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:35,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-04-02 01:51:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157146874] [2023-04-02 01:51:35,983 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:35,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-02 01:51:35,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-02 01:51:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-04-02 01:51:35,984 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:51:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:36,029 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2023-04-02 01:51:36,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:51:36,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2023-04-02 01:51:36,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:36,031 INFO L225 Difference]: With dead ends: 77 [2023-04-02 01:51:36,031 INFO L226 Difference]: Without dead ends: 71 [2023-04-02 01:51:36,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 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 01:51:36,032 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:36,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-04-02 01:51:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-04-02 01:51:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-02 01:51:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2023-04-02 01:51:36,057 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 23 [2023-04-02 01:51:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:36,057 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2023-04-02 01:51:36,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-02 01:51:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2023-04-02 01:51:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-02 01:51:36,058 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:36,058 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:36,065 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 01:51:36,263 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 01:51:36,263 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:36,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1132431350, now seen corresponding path program 1 times [2023-04-02 01:51:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:36,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911815777] [2023-04-02 01:51:36,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:36,288 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:36,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979778985] [2023-04-02 01:51:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:36,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:36,291 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 01:51:36,292 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 01:51:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:36,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 29 conjunts are in the unsatisfiable core [2023-04-02 01:51:36,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:51:36,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:36,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-02 01:51:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911815777] [2023-04-02 01:51:36,782 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979778985] [2023-04-02 01:51:36,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979778985] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:36,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:36,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-04-02 01:51:36,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532570591] [2023-04-02 01:51:36,782 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:36,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-02 01:51:36,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:36,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-02 01:51:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-04-02 01:51:36,786 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:51:37,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:37,353 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2023-04-02 01:51:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-04-02 01:51:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-04-02 01:51:37,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:37,355 INFO L225 Difference]: With dead ends: 69 [2023-04-02 01:51:37,355 INFO L226 Difference]: Without dead ends: 61 [2023-04-02 01:51:37,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-04-02 01:51:37,356 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:37,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 123 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-04-02 01:51:37,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2023-04-02 01:51:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-02 01:51:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2023-04-02 01:51:37,367 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 29 [2023-04-02 01:51:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:37,367 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2023-04-02 01:51:37,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-04-02 01:51:37,367 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2023-04-02 01:51:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-02 01:51:37,368 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:37,368 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:37,387 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 01:51:37,574 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 01:51:37,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:37,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -587557621, now seen corresponding path program 1 times [2023-04-02 01:51:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:37,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443913041] [2023-04-02 01:51:37,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:37,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:37,585 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:37,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670477469] [2023-04-02 01:51:37,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:37,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:37,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:37,586 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 01:51:37,589 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 01:51:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-02 01:51:37,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2023-04-02 01:51:37,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:37,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-02 01:51:37,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443913041] [2023-04-02 01:51:37,815 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670477469] [2023-04-02 01:51:37,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670477469] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:37,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:37,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-04-02 01:51:37,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243466737] [2023-04-02 01:51:37,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:37,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-02 01:51:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-02 01:51:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-04-02 01:51:37,817 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:51:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:37,947 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2023-04-02 01:51:37,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-04-02 01:51:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 53 [2023-04-02 01:51:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:37,949 INFO L225 Difference]: With dead ends: 120 [2023-04-02 01:51:37,949 INFO L226 Difference]: Without dead ends: 114 [2023-04-02 01:51:37,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 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 01:51:37,950 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:37,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 142 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-02 01:51:37,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-04-02 01:51:37,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-04-02 01:51:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 89 states have internal predecessors, (100), 13 states have call successors, (13), 13 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-04-02 01:51:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2023-04-02 01:51:37,967 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 53 [2023-04-02 01:51:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:37,967 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2023-04-02 01:51:37,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2023-04-02 01:51:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2023-04-02 01:51:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-04-02 01:51:37,968 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:37,968 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:37,977 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 01:51:38,177 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 01:51:38,178 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:38,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:38,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1126840971, now seen corresponding path program 2 times [2023-04-02 01:51:38,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:38,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625204504] [2023-04-02 01:51:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:38,200 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:38,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1048521049] [2023-04-02 01:51:38,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-04-02 01:51:38,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:38,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:38,204 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 01:51:38,206 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 01:51:38,277 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-04-02 01:51:38,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:38,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 25 conjunts are in the unsatisfiable core [2023-04-02 01:51:38,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-02 01:51:38,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-04-02 01:51:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625204504] [2023-04-02 01:51:38,674 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048521049] [2023-04-02 01:51:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048521049] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:38,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-04-02 01:51:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120788907] [2023-04-02 01:51:38,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:38,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-04-02 01:51:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-04-02 01:51:38,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-04-02 01:51:38,676 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-04-02 01:51:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:38,971 INFO L93 Difference]: Finished difference Result 220 states and 249 transitions. [2023-04-02 01:51:38,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-04-02 01:51:38,971 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) Word has length 113 [2023-04-02 01:51:38,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:38,972 INFO L225 Difference]: With dead ends: 220 [2023-04-02 01:51:38,973 INFO L226 Difference]: Without dead ends: 214 [2023-04-02 01:51:38,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-04-02 01:51:38,974 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 137 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:38,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 193 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:38,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-04-02 01:51:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-04-02 01:51:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 169 states have (on average 1.1242603550295858) internal successors, (190), 169 states have internal predecessors, (190), 23 states have call successors, (23), 23 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-04-02 01:51:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 234 transitions. [2023-04-02 01:51:38,998 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 234 transitions. Word has length 113 [2023-04-02 01:51:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:38,998 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 234 transitions. [2023-04-02 01:51:38,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.916666666666667) internal successors, (142), 24 states have internal predecessors, (142), 22 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 20 states have call successors, (22) [2023-04-02 01:51:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 234 transitions. [2023-04-02 01:51:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-04-02 01:51:39,000 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:39,000 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:39,015 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 01:51:39,205 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 01:51:39,206 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:39,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:39,206 INFO L85 PathProgramCache]: Analyzing trace with hash 923662603, now seen corresponding path program 3 times [2023-04-02 01:51:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:39,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455211220] [2023-04-02 01:51:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:39,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:39,221 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284450010] [2023-04-02 01:51:39,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-02 01:51:39,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:39,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:39,223 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 01:51:39,255 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 01:51:39,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-02 01:51:39,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-02 01:51:39,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 27 conjunts are in the unsatisfiable core [2023-04-02 01:51:39,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-02 01:51:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-04-02 01:51:39,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-02 01:51:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 96 proven. 117 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-04-02 01:51:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-02 01:51:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455211220] [2023-04-02 01:51:39,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-04-02 01:51:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284450010] [2023-04-02 01:51:39,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284450010] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-02 01:51:39,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-02 01:51:39,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-04-02 01:51:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605420700] [2023-04-02 01:51:39,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-02 01:51:39,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-02 01:51:39,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-02 01:51:39,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-02 01:51:39,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-04-02 01:51:39,768 INFO L87 Difference]: Start difference. First operand 214 states and 234 transitions. Second operand has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-02 01:51:39,961 INFO L93 Difference]: Finished difference Result 413 states and 452 transitions. [2023-04-02 01:51:39,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-02 01:51:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 213 [2023-04-02 01:51:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-02 01:51:39,965 INFO L225 Difference]: With dead ends: 413 [2023-04-02 01:51:39,965 INFO L226 Difference]: Without dead ends: 407 [2023-04-02 01:51:39,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 408 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-04-02 01:51:39,967 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-02 01:51:39,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-02 01:51:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-04-02 01:51:40,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2023-04-02 01:51:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 321 states have (on average 1.1246105919003115) internal successors, (361), 321 states have internal predecessors, (361), 42 states have call successors, (42), 42 states have call predecessors, (42), 40 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-04-02 01:51:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 443 transitions. [2023-04-02 01:51:40,021 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 443 transitions. Word has length 213 [2023-04-02 01:51:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-02 01:51:40,021 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 443 transitions. [2023-04-02 01:51:40,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 17 states have internal predecessors, (35), 6 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-02 01:51:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 443 transitions. [2023-04-02 01:51:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-04-02 01:51:40,030 INFO L187 NwaCegarLoop]: Found error trace [2023-04-02 01:51:40,031 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:40,047 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 01:51:40,238 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 01:51:40,239 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-02 01:51:40,239 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-02 01:51:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1603720973, now seen corresponding path program 1 times [2023-04-02 01:51:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-02 01:51:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249211198] [2023-04-02 01:51:40,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-02 01:51:40,263 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-04-02 01:51:40,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479553057] [2023-04-02 01:51:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-02 01:51:40,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:40,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-02 01:51:40,265 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-02 01:51:40,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-02 01:51:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 01:51:40,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-02 01:51:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-02 01:51:40,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-02 01:51:40,569 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-02 01:51:40,570 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-02 01:51:40,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-02 01:51:40,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-02 01:51:40,775 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-04-02 01:51:40,777 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-02 01:51:40,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.04 01:51:40 BoogieIcfgContainer [2023-04-02 01:51:40,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-02 01:51:40,861 INFO L158 Benchmark]: Toolchain (without parser) took 7633.70ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 240.7MB in the beginning and 267.3MB in the end (delta: -26.6MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2023-04-02 01:51:40,861 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-02 01:51:40,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.61ms. Allocated memory is still 276.8MB. Free memory was 240.2MB in the beginning and 229.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-04-02 01:51:40,862 INFO L158 Benchmark]: Boogie Preprocessor took 27.19ms. Allocated memory is still 276.8MB. Free memory was 229.7MB in the beginning and 228.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-02 01:51:40,862 INFO L158 Benchmark]: RCFGBuilder took 260.53ms. Allocated memory is still 276.8MB. Free memory was 228.1MB in the beginning and 216.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-02 01:51:40,862 INFO L158 Benchmark]: TraceAbstraction took 7153.05ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 216.1MB in the beginning and 267.3MB in the end (delta: -51.2MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2023-04-02 01:51:40,863 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.10ms. Allocated memory is still 178.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 186.61ms. Allocated memory is still 276.8MB. Free memory was 240.2MB in the beginning and 229.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.19ms. Allocated memory is still 276.8MB. Free memory was 229.7MB in the beginning and 228.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 260.53ms. Allocated memory is still 276.8MB. Free memory was 228.1MB in the beginning and 216.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7153.05ms. Allocated memory was 276.8MB in the beginning and 332.4MB in the end (delta: 55.6MB). Free memory was 216.1MB in the beginning and 267.3MB in the end (delta: -51.2MB). Peak memory consumption was 5.9MB. 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; VAL [\old(counter)=27, counter=0] [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=77, Y=2, \old(counter)=0, counter=0, v=-73, x=0, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=0, counter=1, v=-73, x=0, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=1, v=-73, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=1, v=-73, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=1, v=-73, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=1, v=-69, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=1, v=-69, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=1, counter=2, v=-69, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=2, v=-69, x=0, x=1, x=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=2, v=-69, x=0, x=1, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=2, v=-69, x=0, x=1, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=2, v=-65, x=0, x=1, x=2, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=2, v=-65, x=0, x=2, x=2, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=2, counter=3, v=-65, x=0, x=2, x=2, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=3, v=-65, x=0, x=2, x=4, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=3, v=-65, x=0, x=2, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=3, v=-65, x=0, x=2, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=3, v=-61, x=0, x=2, x=4, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=3, v=-61, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=3, counter=4, v=-61, x=0, x=3, x=4, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=4, v=-61, x=0, x=3, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=4, v=-61, x=0, x=3, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=4, v=-61, x=0, x=3, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=4, v=-57, x=0, x=3, x=6, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=4, v=-57, x=0, x=4, x=6, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=4, counter=5, v=-57, x=0, x=4, x=6, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=5, v=-57, x=0, x=4, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=5, v=-57, x=0, x=4, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=5, v=-57, x=0, x=4, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=5, v=-53, x=0, x=4, x=8, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=5, v=-53, x=0, x=5, x=8, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=5, counter=6, v=-53, x=0, x=5, x=8, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=6, v=-53, x=0, x=10, x=5, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=6, v=-53, x=0, x=10, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=6, v=-53, x=0, x=10, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=6, v=-49, x=0, x=10, x=5, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=6, v=-49, x=0, x=10, x=6, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=6, counter=7, v=-49, x=0, x=10, x=6, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=7, v=-49, x=0, x=12, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=7, v=-49, x=0, x=12, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=7, v=-49, x=0, x=12, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=7, v=-45, x=0, x=12, x=6, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=7, v=-45, x=0, x=12, x=7, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=7, counter=8, v=-45, x=0, x=12, x=7, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=8, v=-45, x=0, x=14, x=7, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=8, v=-45, x=0, x=14, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=8, v=-45, x=0, x=14, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=8, v=-41, x=0, x=14, x=7, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=8, v=-41, x=0, x=14, x=8, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=8, counter=9, v=-41, x=0, x=14, x=8, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=9, v=-41, x=0, x=16, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=9, v=-41, x=0, x=16, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=9, v=-41, x=0, x=16, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=9, v=-37, x=0, x=16, x=8, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=9, v=-37, x=0, x=16, x=9, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=9, counter=10, v=-37, x=0, x=16, x=9, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=10, v=-37, x=0, x=18, x=9, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=10, v=-37, x=0, x=18, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=10, v=-37, x=0, x=18, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=10, v=-33, x=0, x=18, x=9, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=10, v=-33, x=0, x=10, x=18, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=10, counter=11, v=-33, x=0, x=10, x=18, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=11, v=-33, x=0, x=10, x=20, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=11, v=-33, x=0, x=10, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=11, v=-33, x=0, x=10, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=11, v=-29, x=0, x=10, x=20, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=11, v=-29, x=0, x=11, x=20, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=11, counter=12, v=-29, x=0, x=11, x=20, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=12, v=-29, x=0, x=11, x=22, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=12, v=-29, x=0, x=11, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=12, v=-29, x=0, x=11, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=12, v=-25, x=0, x=11, x=22, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=12, v=-25, x=0, x=12, x=22, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=12, counter=13, v=-25, x=0, x=12, x=22, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=13, v=-25, x=0, x=12, x=24, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=13, v=-25, x=0, x=12, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=13, v=-25, x=0, x=12, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=13, v=-21, x=0, x=12, x=24, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=13, v=-21, x=0, x=13, x=24, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=13, counter=14, v=-21, x=0, x=13, x=24, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=14, v=-21, x=0, x=13, x=26, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=14, v=-21, x=0, x=13, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=14, v=-21, x=0, x=13, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=14, v=-17, x=0, x=13, x=26, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=14, v=-17, x=0, x=14, x=26, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=14, counter=15, v=-17, x=0, x=14, x=26, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=15, v=-17, x=0, x=14, x=28, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=15, v=-17, x=0, x=14, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=15, v=-17, x=0, x=14, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=15, v=-13, x=0, x=14, x=28, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=15, v=-13, x=0, x=15, x=28, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=15, counter=16, v=-13, x=0, x=15, x=28, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=16, v=-13, x=0, x=15, x=30, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=16, v=-13, x=0, x=15, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=16, v=-13, x=0, x=15, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=16, v=-9, x=0, x=15, x=30, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=16, v=-9, x=0, x=16, x=30, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=16, counter=17, v=-9, x=0, x=16, x=30, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=17, v=-9, x=0, x=16, x=32, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=17, v=-9, x=0, x=16, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=17, v=-9, x=0, x=16, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=17, v=-5, x=0, x=16, x=32, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=17, v=-5, x=0, x=17, x=32, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=17, counter=18, v=-5, x=0, x=17, x=32, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=18, v=-5, x=0, x=17, x=34, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=18, v=-5, x=0, x=17, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=18, v=-5, x=0, x=17, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=18, v=-1, x=0, x=17, x=34, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=18, v=-1, x=0, x=18, x=34, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=18, counter=19, v=-1, x=0, x=18, x=34, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=19, v=-1, x=0, x=18, x=36, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=19, v=-1, x=0, x=18, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=19, v=-1, x=0, x=18, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=77, Y=2, \old(counter)=0, counter=19, v=3, x=0, x=18, x=36, y=0] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=19, v=3, x=0, x=19, x=36, y=0] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=19, counter=20, v=3, x=0, x=19, x=36, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=77, Y=2, \old(counter)=0, counter=20, v=3, x=0, x=19, x=38, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=77, Y=2, \old(counter)=0, counter=20, v=3, x=0, x=19, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=77, Y=2, \old(counter)=0, counter=20, v=3, x=0, x=19, x=38, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=77, Y=2, \old(counter)=0, counter=20, v=-147, x=0, x=19, x=38, y=1] [L45] x++ VAL [X=77, Y=2, \old(counter)=0, counter=20, v=-147, x=0, x=20, x=38, y=1] [L31] EXPR counter++ VAL [X=77, Y=2, \old(counter)=0, counter++=20, counter=21, v=-147, x=0, x=20, x=38, y=1] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=77, Y=2, \old(counter)=0, counter=21, v=-147, x=20, x=20, x=40, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 345 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 762 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 824 IncrementalHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 143 mSDtfsCounter, 824 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 981 GetRequests, 823 SyntacticMatches, 4 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=8, InterpolantAutomatonStates: 133, 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, 8 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 702 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 916 ConstructedInterpolants, 1 QuantifiedInterpolants, 2896 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1062 ConjunctsInSsa, 143 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 4128/5134 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 01:51:40,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...