/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:59:55,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:59:55,735 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:59:55,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:59:55,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:59:55,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:59:55,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:59:55,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:59:55,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:59:55,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:59:55,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:59:55,798 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:59:55,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:59:55,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:59:55,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:59:55,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:59:55,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:59:55,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:59:55,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:59:55,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:59:55,815 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:59:55,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:59:55,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:59:55,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:59:55,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:59:55,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:59:55,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:59:55,822 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:59:55,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:59:55,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:59:55,824 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:59:55,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:59:55,825 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:59:55,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:59:55,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:59:55,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:59:55,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:59:55,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:59:55,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:59:55,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:59:55,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:59:55,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:59:55,831 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 [2022-04-27 11:59:55,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:59:55,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:59:55,865 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:59:55,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:59:55,865 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:59:55,865 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:59:55,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:59:55,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:59:55,866 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:59:55,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:59:55,867 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:59:55,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:59:55,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:59:55,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:59:55,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:59:55,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:59:55,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:59:55,869 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:59:55,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:59:55,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:59:55,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:59:55,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:59:55,870 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:59:55,870 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:59:55,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:59:55,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:59:55,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:59:55,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:59:55,871 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:59:55,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:59:55,871 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:59:55,871 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:59:55,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:59:55,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:59:56,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:59:56,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:59:56,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:59:56,149 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:59:56,150 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:59:56,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound1.c [2022-04-27 11:59:56,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da9e3dba/a65297c0c81f42b1928d1435a7b690f0/FLAG308ca43f0 [2022-04-27 11:59:56,612 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:59:56,612 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound1.c [2022-04-27 11:59:56,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da9e3dba/a65297c0c81f42b1928d1435a7b690f0/FLAG308ca43f0 [2022-04-27 11:59:56,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5da9e3dba/a65297c0c81f42b1928d1435a7b690f0 [2022-04-27 11:59:56,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:59:56,638 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:59:56,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:59:56,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:59:56,644 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:59:56,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257f6375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56, skipping insertion in model container [2022-04-27 11:59:56,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:59:56,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:59:56,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound1.c[597,610] [2022-04-27 11:59:56,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:59:56,842 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:59:56,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound1.c[597,610] [2022-04-27 11:59:56,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:59:56,869 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:59:56,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56 WrapperNode [2022-04-27 11:59:56,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:59:56,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:59:56,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:59:56,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:59:56,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,891 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:59:56,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:59:56,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:59:56,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:59:56,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (1/1) ... [2022-04-27 11:59:56,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:59:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:59:56,937 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) [2022-04-27 11:59:56,963 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 [2022-04-27 11:59:56,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:59:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:59:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:59:56,987 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:59:56,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:59:56,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:59:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:59:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:59:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:59:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:59:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:59:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:59:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:59:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:59:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:59:56,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:59:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:59:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:59:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:59:56,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:59:57,047 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:59:57,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:59:57,255 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:59:57,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:59:57,261 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:59:57,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:59:57 BoogieIcfgContainer [2022-04-27 11:59:57,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:59:57,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:59:57,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:59:57,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:59:57,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:59:56" (1/3) ... [2022-04-27 11:59:57,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660a53ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:59:57, skipping insertion in model container [2022-04-27 11:59:57,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:59:56" (2/3) ... [2022-04-27 11:59:57,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660a53ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:59:57, skipping insertion in model container [2022-04-27 11:59:57,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:59:57" (3/3) ... [2022-04-27 11:59:57,301 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound1.c [2022-04-27 11:59:57,314 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:59:57,314 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:59:57,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:59:57,387 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3649abf7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@189ad311 [2022-04-27 11:59:57,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:59:57,396 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) [2022-04-27 11:59:57,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:59:57,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:59:57,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:59:57,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:59:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:59:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2019451875, now seen corresponding path program 1 times [2022-04-27 11:59:57,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:59:57,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680689835] [2022-04-27 11:59:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:57,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:59:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:59:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:57,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-04-27 11:59:57,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:59:57,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #62#return; {28#true} is VALID [2022-04-27 11:59:57,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:59:57,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {28#true} is VALID [2022-04-27 11:59:57,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-27 11:59:57,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #62#return; {28#true} is VALID [2022-04-27 11:59:57,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2022-04-27 11:59:57,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {28#true} is VALID [2022-04-27 11:59:57,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-27 11:59:57,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {29#false} is VALID [2022-04-27 11:59:57,650 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {29#false} is VALID [2022-04-27 11:59:57,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-27 11:59:57,651 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-27 11:59:57,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-27 11:59:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:59:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:59:57,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680689835] [2022-04-27 11:59:57,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680689835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:59:57,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:59:57,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:59:57,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461227756] [2022-04-27 11:59:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:59:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 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 [2022-04-27 11:59:57,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:59:57,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:59:57,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:57,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:59:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:59:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:59:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:59:57,718 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:59:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:57,858 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-27 11:59:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:59:57,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 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 [2022-04-27 11:59:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:59:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:59:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-27 11:59:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:59:57,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-27 11:59:57,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-27 11:59:57,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:57,987 INFO L225 Difference]: With dead ends: 45 [2022-04-27 11:59:57,987 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 11:59:57,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:59:57,994 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:59:57,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:59:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 11:59:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-27 11:59:58,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:59:58,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second 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) [2022-04-27 11:59:58,029 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second 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) [2022-04-27 11:59:58,030 INFO L87 Difference]: Start difference. First operand 21 states. Second 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) [2022-04-27 11:59:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:58,035 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 11:59:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 11:59:58,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:59:58,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:59:58,036 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 21 states. [2022-04-27 11:59:58,037 INFO L87 Difference]: Start difference. First 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) Second operand 21 states. [2022-04-27 11:59:58,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:58,041 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 11:59:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 11:59:58,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:59:58,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:59:58,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:59:58,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:59:58,043 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) [2022-04-27 11:59:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-27 11:59:58,046 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2022-04-27 11:59:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:59:58,046 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-27 11:59:58,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:59:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-27 11:59:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:59:58,052 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:59:58,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:59:58,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:59:58,059 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:59:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:59:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1431109416, now seen corresponding path program 1 times [2022-04-27 11:59:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:59:58,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955663605] [2022-04-27 11:59:58,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:58,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:59:58,087 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:59:58,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696597647] [2022-04-27 11:59:58,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:58,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:59:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:59:58,096 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) [2022-04-27 11:59:58,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:59:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:58,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 11:59:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:58,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:59:58,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {164#true} call ULTIMATE.init(); {164#true} is VALID [2022-04-27 11:59:58,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {164#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {164#true} is VALID [2022-04-27 11:59:58,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {164#true} assume true; {164#true} is VALID [2022-04-27 11:59:58,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164#true} {164#true} #62#return; {164#true} is VALID [2022-04-27 11:59:58,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {164#true} call #t~ret9 := main(); {164#true} is VALID [2022-04-27 11:59:58,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {164#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {184#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 11:59:58,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {184#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 11:59:58,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {191#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-27 11:59:58,430 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:59:58,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {199#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:59:58,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {165#false} is VALID [2022-04-27 11:59:58,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {165#false} assume !false; {165#false} is VALID [2022-04-27 11:59:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:59:58,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:59:58,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:59:58,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955663605] [2022-04-27 11:59:58,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:59:58,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696597647] [2022-04-27 11:59:58,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696597647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:59:58,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:59:58,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:59:58,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448930845] [2022-04-27 11:59:58,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:59:58,438 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 [2022-04-27 11:59:58,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:59:58,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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) [2022-04-27 11:59:58,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:58,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:59:58,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:59:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:59:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:59:58,455 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) [2022-04-27 11:59:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:58,656 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 11:59:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:59:58,656 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 [2022-04-27 11:59:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:59:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-27 11:59:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 11:59:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-04-27 11:59:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-27 11:59:58,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-27 11:59:58,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:58,701 INFO L225 Difference]: With dead ends: 34 [2022-04-27 11:59:58,701 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 11:59:58,701 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 [2022-04-27 11:59:58,702 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 64 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 [2022-04-27 11:59:58,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 64 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:59:58,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 11:59:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 11:59:58,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:59:58,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second 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) [2022-04-27 11:59:58,710 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second 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) [2022-04-27 11:59:58,710 INFO L87 Difference]: Start difference. First operand 29 states. Second 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) [2022-04-27 11:59:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:58,712 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 11:59:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 11:59:58,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:59:58,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:59:58,713 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 29 states. [2022-04-27 11:59:58,713 INFO L87 Difference]: Start difference. First 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) Second operand 29 states. [2022-04-27 11:59:58,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:58,715 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-27 11:59:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-04-27 11:59:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:59:58,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:59:58,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:59:58,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:59:58,717 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) [2022-04-27 11:59:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-27 11:59:58,718 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 12 [2022-04-27 11:59:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:59:58,719 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-27 11:59:58,719 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) [2022-04-27 11:59:58,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-27 11:59:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:59:58,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:59:58,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:59:58,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:59:58,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:59:58,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:59:58,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:59:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1603905768, now seen corresponding path program 1 times [2022-04-27 11:59:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:59:58,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843808808] [2022-04-27 11:59:58,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:59:58,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:59:58,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684537963] [2022-04-27 11:59:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:58,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:59:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:59:58,957 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) [2022-04-27 11:59:58,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:59:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:59,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 11:59:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:59,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:59:59,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2022-04-27 11:59:59,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#(<= 0 ~counter~0)} assume true; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {360#(<= 0 ~counter~0)} {352#true} #62#return; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {360#(<= 0 ~counter~0)} call #t~ret9 := main(); {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#(<= 0 ~counter~0)} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~counter~0)} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,197 INFO L272 TraceCheckUtils]: 8: Hoare triple {376#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#(<= 1 ~counter~0)} ~cond := #in~cond; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= 1 ~counter~0)} assume !(0 == ~cond); {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(<= 1 ~counter~0)} assume true; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,199 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {376#(<= 1 ~counter~0)} {376#(<= 1 ~counter~0)} #58#return; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#(<= 1 ~counter~0)} assume !!(~x~0 <= ~X~0); {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#(<= 1 ~counter~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {376#(<= 1 ~counter~0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {407#(<= 1 |main_#t~post6|)} is VALID [2022-04-27 11:59:59,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {407#(<= 1 |main_#t~post6|)} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {353#false} is VALID [2022-04-27 11:59:59,202 INFO L272 TraceCheckUtils]: 18: Hoare triple {353#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {353#false} is VALID [2022-04-27 11:59:59,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-27 11:59:59,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-27 11:59:59,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-27 11:59:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:59:59,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:59:59,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-27 11:59:59,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-27 11:59:59,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-27 11:59:59,384 INFO L272 TraceCheckUtils]: 18: Hoare triple {353#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {353#false} is VALID [2022-04-27 11:59:59,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {407#(<= 1 |main_#t~post6|)} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {353#false} is VALID [2022-04-27 11:59:59,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {407#(<= 1 |main_#t~post6|)} is VALID [2022-04-27 11:59:59,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {376#(<= 1 ~counter~0)} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#(<= 1 ~counter~0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#(<= 1 ~counter~0)} assume !!(~x~0 <= ~X~0); {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,387 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {352#true} {376#(<= 1 ~counter~0)} #58#return; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-27 11:59:59,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {352#true} assume !(0 == ~cond); {352#true} is VALID [2022-04-27 11:59:59,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {352#true} ~cond := #in~cond; {352#true} is VALID [2022-04-27 11:59:59,388 INFO L272 TraceCheckUtils]: 8: Hoare triple {376#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {352#true} is VALID [2022-04-27 11:59:59,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~counter~0)} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {376#(<= 1 ~counter~0)} is VALID [2022-04-27 11:59:59,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#(<= 0 ~counter~0)} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {360#(<= 0 ~counter~0)} call #t~ret9 := main(); {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {360#(<= 0 ~counter~0)} {352#true} #62#return; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#(<= 0 ~counter~0)} assume true; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {360#(<= 0 ~counter~0)} is VALID [2022-04-27 11:59:59,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2022-04-27 11:59:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:59:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:59:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843808808] [2022-04-27 11:59:59,392 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:59:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684537963] [2022-04-27 11:59:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684537963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:59:59,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:59:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 11:59:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272147063] [2022-04-27 11:59:59,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:59:59,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:59:59,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:59:59,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:59:59,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:59,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:59:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:59:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:59:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:59:59,418 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:59:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:59,510 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-27 11:59:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:59:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 11:59:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:59:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:59:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 11:59:59,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:59:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-27 11:59:59,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-27 11:59:59,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:59:59,552 INFO L225 Difference]: With dead ends: 40 [2022-04-27 11:59:59,552 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 11:59:59,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:59:59,554 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:59:59,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:59:59,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 11:59:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 11:59:59,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:59:59,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:59:59,564 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:59:59,564 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:59:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:59,565 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-27 11:59:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-27 11:59:59,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:59:59,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:59:59,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 11:59:59,566 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 11:59:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:59:59,568 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-27 11:59:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-27 11:59:59,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:59:59,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:59:59,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:59:59,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:59:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 11:59:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-27 11:59:59,570 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-27 11:59:59,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:59:59,570 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-27 11:59:59,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 11:59:59,570 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-27 11:59:59,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 11:59:59,571 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:59:59,571 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] [2022-04-27 11:59:59,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 11:59:59,795 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,SelfDestructingSolverStorable2 [2022-04-27 11:59:59,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:59:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:59:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1893873077, now seen corresponding path program 1 times [2022-04-27 11:59:59,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:59:59,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944984481] [2022-04-27 11:59:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:59,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:59:59,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:59:59,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094480365] [2022-04-27 11:59:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:59:59,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:59:59,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:59:59,813 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) [2022-04-27 11:59:59,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:59:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:59,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-27 11:59:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:59:59,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:00:00,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {626#true} call ULTIMATE.init(); {626#true} is VALID [2022-04-27 12:00:00,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {626#true} is VALID [2022-04-27 12:00:00,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#true} assume true; {626#true} is VALID [2022-04-27 12:00:00,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {626#true} {626#true} #62#return; {626#true} is VALID [2022-04-27 12:00:00,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {626#true} call #t~ret9 := main(); {626#true} is VALID [2022-04-27 12:00:00,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,105 INFO L272 TraceCheckUtils]: 8: Hoare triple {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {626#true} is VALID [2022-04-27 12:00:00,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#true} ~cond := #in~cond; {626#true} is VALID [2022-04-27 12:00:00,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#true} assume !(0 == ~cond); {626#true} is VALID [2022-04-27 12:00:00,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#true} assume true; {626#true} is VALID [2022-04-27 12:00:00,106 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {626#true} {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #58#return; {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {646#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {674#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {678#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {678#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {678#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {678#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !(#t~post6 < 1);havoc #t~post6; {678#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {678#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {688#(and (= main_~y~0 main_~xy~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0) (= main_~y~0 0))} is VALID [2022-04-27 12:00:00,112 INFO L272 TraceCheckUtils]: 19: Hoare triple {688#(and (= main_~y~0 main_~xy~0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:00,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:00,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {627#false} is VALID [2022-04-27 12:00:00,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {627#false} assume !false; {627#false} is VALID [2022-04-27 12:00:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:00:00,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:00:00,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {627#false} assume !false; {627#false} is VALID [2022-04-27 12:00:00,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {696#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {627#false} is VALID [2022-04-27 12:00:00,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {692#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {696#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:00:00,320 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {692#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:00:00,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {716#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {712#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-27 12:00:00,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} assume !(#t~post6 < 1);havoc #t~post6; {716#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-27 12:00:00,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {716#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-27 12:00:00,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {726#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post8 := ~x~0;~x~0 := 1 + #t~post8;havoc #t~post8; {716#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-27 12:00:00,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {726#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:00:00,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} assume !!(~x~0 <= ~X~0); {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:00:00,398 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {626#true} {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #58#return; {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:00:00,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#true} assume true; {626#true} is VALID [2022-04-27 12:00:00,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#true} assume !(0 == ~cond); {626#true} is VALID [2022-04-27 12:00:00,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#true} ~cond := #in~cond; {626#true} is VALID [2022-04-27 12:00:00,398 INFO L272 TraceCheckUtils]: 8: Hoare triple {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {626#true} is VALID [2022-04-27 12:00:00,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} assume !!(#t~post6 < 1);havoc #t~post6;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:00:00,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:00:00,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {626#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {730#(= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) main_~X~0 main_~v~0 (* main_~Y~0 2)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-27 12:00:00,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {626#true} call #t~ret9 := main(); {626#true} is VALID [2022-04-27 12:00:00,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {626#true} {626#true} #62#return; {626#true} is VALID [2022-04-27 12:00:00,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {626#true} assume true; {626#true} is VALID [2022-04-27 12:00:00,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {626#true} is VALID [2022-04-27 12:00:00,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {626#true} call ULTIMATE.init(); {626#true} is VALID [2022-04-27 12:00:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:00:00,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:00:00,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944984481] [2022-04-27 12:00:00,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:00:00,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094480365] [2022-04-27 12:00:00,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094480365] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:00:00,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:00:00,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-04-27 12:00:00,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096866659] [2022-04-27 12:00:00,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:00:00,404 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-04-27 12:00:00,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:00:00,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:00:00,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:00,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 12:00:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:00:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 12:00:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:00:00,460 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:00:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:00,863 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2022-04-27 12:00:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:00:00,864 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-04-27 12:00:00,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:00:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:00:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-04-27 12:00:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:00:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2022-04-27 12:00:00,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2022-04-27 12:00:00,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:00:00,902 INFO L225 Difference]: With dead ends: 33 [2022-04-27 12:00:00,902 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 12:00:00,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:00:00,904 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:00:00,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 100 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:00:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 12:00:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-27 12:00:00,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:00:00,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:00:00,913 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:00:00,914 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:00:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:00,915 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-04-27 12:00:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-04-27 12:00:00,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:00,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:00,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 12:00:00,915 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 12:00:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:00:00,917 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-04-27 12:00:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-04-27 12:00:00,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:00:00,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:00:00,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:00:00,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:00:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:00:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2022-04-27 12:00:00,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 23 [2022-04-27 12:00:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:00:00,919 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2022-04-27 12:00:00,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:00:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2022-04-27 12:00:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:00:00,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:00:00,926 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] [2022-04-27 12:00:00,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:01,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:01,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:00:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:00:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1213814707, now seen corresponding path program 1 times [2022-04-27 12:00:01,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:00:01,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492812851] [2022-04-27 12:00:01,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:01,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:00:01,145 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:00:01,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [975374393] [2022-04-27 12:00:01,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:00:01,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:01,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:00:01,149 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) [2022-04-27 12:00:01,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:00:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:00:01,190 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 12:00:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 12:00:01,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 12:00:01,219 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 12:00:01,220 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:00:01,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:00:01,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:00:01,444 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 12:00:01,448 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:00:01,478 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:00:01,478 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 12:00:01,478 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:00:01,480 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:00:01,481 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:00:01,482 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-04-27 12:00:01,482 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:00:01,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:00:01 BoogieIcfgContainer [2022-04-27 12:00:01,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:00:01,484 INFO L158 Benchmark]: Toolchain (without parser) took 4845.93ms. Allocated memory was 185.6MB in the beginning and 233.8MB in the end (delta: 48.2MB). Free memory was 134.9MB in the beginning and 183.6MB in the end (delta: -48.7MB). Peak memory consumption was 198.9kB. Max. memory is 8.0GB. [2022-04-27 12:00:01,484 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 185.6MB. Free memory was 151.4MB in the beginning and 151.3MB in the end (delta: 76.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:00:01,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.89ms. Allocated memory is still 185.6MB. Free memory was 134.7MB in the beginning and 159.8MB in the end (delta: -25.1MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 12:00:01,485 INFO L158 Benchmark]: Boogie Preprocessor took 27.75ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 158.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 12:00:01,485 INFO L158 Benchmark]: RCFGBuilder took 384.86ms. Allocated memory is still 185.6MB. Free memory was 158.4MB in the beginning and 146.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 12:00:01,485 INFO L158 Benchmark]: TraceAbstraction took 4198.00ms. Allocated memory was 185.6MB in the beginning and 233.8MB in the end (delta: 48.2MB). Free memory was 145.9MB in the beginning and 183.6MB in the end (delta: -37.7MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-27 12:00:01,486 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 185.6MB. Free memory was 151.4MB in the beginning and 151.3MB in the end (delta: 76.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.89ms. Allocated memory is still 185.6MB. Free memory was 134.7MB in the beginning and 159.8MB in the end (delta: -25.1MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.75ms. Allocated memory is still 185.6MB. Free memory was 159.8MB in the beginning and 158.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 384.86ms. Allocated memory is still 185.6MB. Free memory was 158.4MB in the beginning and 146.5MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 4198.00ms. Allocated memory was 185.6MB in the beginning and 233.8MB in the end (delta: 48.2MB). Free memory was 145.9MB in the beginning and 183.6MB in the end (delta: -37.7MB). Peak memory consumption was 12.0MB. 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)=5, 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 [\old(counter)=0, counter=0, v=0, x=0, X=4, y=0, Y=2] [L31] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, v=0, X=4, x=0, Y=2, y=0] [L31] COND TRUE counter++<1 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [\old(counter)=0, counter=1, v=0, X=4, x=0, x=0, x=0, Y=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=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 [\old(counter)=0, counter=1, v=0, x=0, x=0, x=0, X=4, y=0, Y=2] [L35] COND FALSE !(!(x <= X)) VAL [\old(counter)=0, counter=1, v=0, X=4, x=0, x=0, x=0, y=0, Y=2] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [\old(counter)=0, counter=1, v=-4, x=0, x=0, x=0, X=4, Y=2, y=1] [L45] x++ VAL [\old(counter)=0, counter=1, v=-4, X=4, x=0, x=0, x=1, y=1, Y=2] [L31] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, v=-4, x=0, x=0, x=1, X=4, Y=2, y=1] [L31] COND FALSE !(counter++<1) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [\old(counter)=0, counter=2, v=-4, x=2, x=1, x=1, X=4, y=1, Y=2] [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=2] [L14] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] [L16] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 76 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 624 SizeOfPredicates, 7 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 12/18 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! [2022-04-27 12:00:01,507 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...