/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loop-lit/jm2006.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:21:44,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:21:44,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:21:44,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:21:44,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:21:44,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:21:44,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:21:44,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:21:44,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:21:44,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:21:44,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:21:44,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:21:44,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:21:44,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:21:44,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:21:44,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:21:44,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:21:44,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:21:44,956 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:21:44,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:21:44,963 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:21:44,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:21:44,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:21:44,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:21:44,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:21:44,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:21:44,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:21:44,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:21:44,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:21:44,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:21:44,976 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:21:44,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:21:44,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:21:44,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:21:44,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:21:44,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:21:44,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:21:44,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:21:44,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:21:44,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:21:44,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:21:44,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:21:44,983 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:21:44,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:21:44,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:21:44,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:21:44,998 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:21:44,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:21:44,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:21:44,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:21:44,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:21:44,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:21:44,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:21:44,999 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:21:44,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:21:44,999 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:21:44,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:21:45,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:21:45,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:21:45,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:21:45,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:21:45,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:45,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:21:45,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:21:45,001 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:21:45,001 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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 16:21:45,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:21:45,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:21:45,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:21:45,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:21:45,272 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:21:45,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-27 16:21:45,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6967f6dd9/6ea897aa30904725a25f9f24e68ba89d/FLAGd2a26d732 [2022-04-27 16:21:45,705 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:21:45,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i [2022-04-27 16:21:45,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6967f6dd9/6ea897aa30904725a25f9f24e68ba89d/FLAGd2a26d732 [2022-04-27 16:21:45,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6967f6dd9/6ea897aa30904725a25f9f24e68ba89d [2022-04-27 16:21:45,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:21:45,728 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:21:45,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:45,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:21:45,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:21:45,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c6ae247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45, skipping insertion in model container [2022-04-27 16:21:45,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:21:45,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:21:45,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i[895,908] [2022-04-27 16:21:45,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:45,924 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:21:45,936 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/jm2006.i[895,908] [2022-04-27 16:21:45,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:21:45,951 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:21:45,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45 WrapperNode [2022-04-27 16:21:45,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:21:45,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:21:45,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:21:45,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:21:45,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,967 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:21:45,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:21:45,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:21:45,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:21:45,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (1/1) ... [2022-04-27 16:21:45,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:21:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:46,020 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 16:21:46,030 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 16:21:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:21:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:21:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:21:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 16:21:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:21:46,064 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:21:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 16:21:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:21:46,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 16:21:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:21:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:21:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:21:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:21:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:21:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:21:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:21:46,123 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:21:46,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:21:46,239 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:21:46,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:21:46,245 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 16:21:46,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:46 BoogieIcfgContainer [2022-04-27 16:21:46,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:21:46,248 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:21:46,248 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:21:46,249 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:21:46,251 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:46" (1/1) ... [2022-04-27 16:21:46,253 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:21:46,669 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:21:46,672 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (not (= v_main_~x~0_4 0)) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_4} OutVars{main_~x~0=v_main_~x~0_3, main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] to Formula: (let ((.cse0 (= v_main_~x~0_4 0))) (or (and (= v_main_~x~0_4 v_main_~x~0_3) (= v_main_~y~0_4 v_main_~y~0_3) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) .cse0 (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (or (not (<= (+ v_main_~x~0_3 1) 0)) (not (<= 1 v_main_~x~0_4))) (not .cse0) (= v_main_~y~0_3 (+ v_main_~x~0_3 v_main_~y~0_4 (* (- 1) v_main_~x~0_4))) (< v_main_~x~0_3 v_main_~x~0_4)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] [2022-04-27 16:21:46,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:46 BasicIcfg [2022-04-27 16:21:46,677 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:21:46,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:21:46,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:21:46,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:21:46,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:21:45" (1/4) ... [2022-04-27 16:21:46,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2d27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:46, skipping insertion in model container [2022-04-27 16:21:46,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:21:45" (2/4) ... [2022-04-27 16:21:46,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2d27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:21:46, skipping insertion in model container [2022-04-27 16:21:46,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:21:46" (3/4) ... [2022-04-27 16:21:46,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a2d27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:46, skipping insertion in model container [2022-04-27 16:21:46,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:21:46" (4/4) ... [2022-04-27 16:21:46,685 INFO L111 eAbstractionObserver]: Analyzing ICFG jm2006.iJordan [2022-04-27 16:21:46,699 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:21:46,699 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:21:46,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:21:46,740 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@2107d3f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5163812f [2022-04-27 16:21:46,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:21:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:21:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:21:46,754 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:46,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:46,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:46,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1752834070, now seen corresponding path program 1 times [2022-04-27 16:21:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:46,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369588626] [2022-04-27 16:21:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:46,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:46,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:21:46,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:46,895 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:46,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:46,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {24#true} is VALID [2022-04-27 16:21:46,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:46,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:46,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:21:46,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {24#true} is VALID [2022-04-27 16:21:46,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {24#true} is VALID [2022-04-27 16:21:46,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#true} [72] L31-2-->L31-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:21:46,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:21:46,900 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {25#false} is VALID [2022-04-27 16:21:46,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25#false} is VALID [2022-04-27 16:21:46,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:21:46,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:21:46,901 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 16:21:46,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:46,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369588626] [2022-04-27 16:21:46,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369588626] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:46,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:46,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:21:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119072886] [2022-04-27 16:21:46,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:46,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:21:46,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:46,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:21:46,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:46,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:21:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:46,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:21:46,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:21:46,950 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:21:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:47,000 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-27 16:21:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:21:47,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:21:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:21:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:21:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:21:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:21:47,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-27 16:21:47,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:47,071 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:21:47,071 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:21:47,073 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 16:21:47,078 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:47,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:21:47,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:21:47,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:21:47,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:47,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 16:21:47,106 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 16:21:47,106 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 16:21:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:47,113 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:47,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:47,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:47,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-27 16:21:47,114 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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) Second operand 14 states. [2022-04-27 16:21:47,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:47,117 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 16:21:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:47,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:47,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:47,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:47,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:47,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 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 16:21:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 16:21:47,123 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 13 [2022-04-27 16:21:47,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:47,126 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 16:21:47,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 16:21:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 16:21:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:21:47,134 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:47,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:47,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:21:47,134 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1781463221, now seen corresponding path program 1 times [2022-04-27 16:21:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:47,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897244177] [2022-04-27 16:21:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:47,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:47,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:47,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:21:47,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:47,428 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:47,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:47,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {95#true} is VALID [2022-04-27 16:21:47,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:47,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:47,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:21:47,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {95#true} is VALID [2022-04-27 16:21:47,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {100#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 16:21:47,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#(and (or (and (or (= main_~i~0 0) (= main_~i~0 main_~x~0)) (or (<= main_~y~0 main_~j~0) (not (= main_~i~0 0)))) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {101#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 16:21:47,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {101#(and (or (and (<= main_~y~0 main_~j~0) (= main_~i~0 0)) (<= main_~y~0 0)) (< 0 (+ main_~y~0 1)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {102#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 16:21:47,434 INFO L272 TraceCheckUtils]: 9: Hoare triple {102#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:21:47,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {104#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:21:47,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {104#(not (= __VERIFIER_assert_~cond 0))} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:21:47,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {96#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:21:47,436 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 16:21:47,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:47,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897244177] [2022-04-27 16:21:47,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897244177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:21:47,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:21:47,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:21:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165375495] [2022-04-27 16:21:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:21:47,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-27 16:21:47,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:47,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 16:21:47,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:47,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:21:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:21:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:21:47,461 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 16:21:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:47,690 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-27 16:21:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:21:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 13 [2022-04-27 16:21:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 16:21:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-27 16:21:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 16:21:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2022-04-27 16:21:47,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 20 transitions. [2022-04-27 16:21:47,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:47,721 INFO L225 Difference]: With dead ends: 19 [2022-04-27 16:21:47,721 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 16:21:47,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:21:47,723 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:47,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 32 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:21:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 16:21:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 16:21:47,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:47,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 16:21:47,726 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 16:21:47,726 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 16:21:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:47,727 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 16:21:47,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:21:47,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:47,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:47,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-27 16:21:47,728 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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) Second operand 15 states. [2022-04-27 16:21:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:47,729 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 16:21:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:21:47,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:47,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:47,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:47,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 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 16:21:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 16:21:47,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-27 16:21:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:47,731 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 16:21:47,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 16:21:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 16:21:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:21:47,732 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:21:47,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:21:47,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:21:47,732 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:21:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:21:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash 219122817, now seen corresponding path program 1 times [2022-04-27 16:21:47,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:21:47,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377046135] [2022-04-27 16:21:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:21:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:47,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:21:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:47,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {182#true} is VALID [2022-04-27 16:21:47,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:47,998 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {182#true} {182#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:47,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:21:47,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {182#true} is VALID [2022-04-27 16:21:47,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:47,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:47,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {182#true} is VALID [2022-04-27 16:21:48,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {187#(and (<= 0 main_~y~0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 16:21:48,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#(and (<= 0 main_~y~0) (<= main_~j~0 main_~y~0) (<= main_~y~0 main_~j~0) (= main_~i~0 main_~x~0))} [74] L31-2-->L31-2: Formula: (let ((.cse0 (= v_main_~x~0_4 0))) (or (and (= v_main_~x~0_4 v_main_~x~0_3) (= v_main_~y~0_4 v_main_~y~0_3) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) .cse0 (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (or (not (<= (+ v_main_~x~0_3 1) 0)) (not (<= 1 v_main_~x~0_4))) (not .cse0) (= v_main_~y~0_3 (+ v_main_~x~0_3 v_main_~y~0_4 (* (- 1) v_main_~x~0_4))) (< v_main_~x~0_3 v_main_~x~0_4)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {188#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} is VALID [2022-04-27 16:21:48,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#(and (or (<= (+ main_~j~0 main_~x~0) (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= (+ main_~i~0 main_~y~0) (+ main_~j~0 main_~x~0)) (<= main_~y~0 0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {189#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} is VALID [2022-04-27 16:21:48,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {189#(and (or (<= main_~j~0 (+ main_~i~0 main_~y~0)) (not (<= (+ main_~y~0 1) 0))) (or (<= main_~y~0 0) (<= (+ main_~i~0 main_~y~0) main_~j~0)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {190#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 16:21:48,006 INFO L272 TraceCheckUtils]: 10: Hoare triple {190#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:21:48,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:21:48,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 16:21:48,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 16:21:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:48,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:21:48,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377046135] [2022-04-27 16:21:48,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377046135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:21:48,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081196952] [2022-04-27 16:21:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:21:48,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:48,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:21:48,016 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 16:21:48,048 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 16:21:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:48,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:21:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:21:48,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:21:48,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {182#true} is VALID [2022-04-27 16:21:48,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {182#true} is VALID [2022-04-27 16:21:48,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {215#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0))} is VALID [2022-04-27 16:21:48,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {215#(and (= main_~j~0 main_~y~0) (= main_~i~0 main_~x~0))} [74] L31-2-->L31-2: Formula: (let ((.cse0 (= v_main_~x~0_4 0))) (or (and (= v_main_~x~0_4 v_main_~x~0_3) (= v_main_~y~0_4 v_main_~y~0_3) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) .cse0 (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (or (not (<= (+ v_main_~x~0_3 1) 0)) (not (<= 1 v_main_~x~0_4))) (not .cse0) (= v_main_~y~0_3 (+ v_main_~x~0_3 v_main_~y~0_4 (* (- 1) v_main_~x~0_4))) (< v_main_~x~0_3 v_main_~x~0_4)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {219#(or (and (< main_~x~0 main_~i~0) (or (not (<= (+ main_~x~0 1) 0)) (not (<= 1 main_~i~0))) (= main_~y~0 (+ (* (- 1) main_~i~0) main_~j~0 main_~x~0)) (not (= main_~i~0 0))) (and (= main_~j~0 main_~y~0) (= main_~i~0 0) (= main_~i~0 main_~x~0)))} is VALID [2022-04-27 16:21:48,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(or (and (< main_~x~0 main_~i~0) (or (not (<= (+ main_~x~0 1) 0)) (not (<= 1 main_~i~0))) (= main_~y~0 (+ (* (- 1) main_~i~0) main_~j~0 main_~x~0)) (not (= main_~i~0 0))) (and (= main_~j~0 main_~y~0) (= main_~i~0 0) (= main_~i~0 main_~x~0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {223#(or (and (< 0 main_~i~0) (= (+ main_~i~0 main_~y~0) main_~j~0)) (and (= main_~j~0 main_~y~0) (= main_~i~0 0)))} is VALID [2022-04-27 16:21:48,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#(or (and (< 0 main_~i~0) (= (+ main_~i~0 main_~y~0) main_~j~0)) (and (= main_~j~0 main_~y~0) (= main_~i~0 0)))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {190#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 16:21:48,562 INFO L272 TraceCheckUtils]: 10: Hoare triple {190#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:21:48,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:21:48,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 16:21:48,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 16:21:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:48,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:21:48,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} [82] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 16:21:48,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {234#(<= 1 __VERIFIER_assert_~cond)} [80] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {183#false} is VALID [2022-04-27 16:21:48,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#(<= 1 |__VERIFIER_assert_#in~cond|)} [79] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {234#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:21:48,819 INFO L272 TraceCheckUtils]: 10: Hoare triple {190#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} [77] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~y~0_5 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_5} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {230#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:21:48,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {253#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} [75] L31-3-->L36: Formula: (= v_main_~i~0_2 v_main_~j~0_2) InVars {main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} OutVars{main_~i~0=v_main_~i~0_2, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[] {190#(and (<= main_~y~0 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-27 16:21:48,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} [73] L31-2-->L31-3: Formula: (= v_main_~x~0_2 0) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {253#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))))} is VALID [2022-04-27 16:21:48,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {261#(or (not (= main_~i~0 main_~j~0)) (and (or (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0))) (or (<= main_~x~0 0) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))))} [74] L31-2-->L31-2: Formula: (let ((.cse0 (= v_main_~x~0_4 0))) (or (and (= v_main_~x~0_4 v_main_~x~0_3) (= v_main_~y~0_4 v_main_~y~0_3) (= |v_main_#t~post3_3| |v_main_#t~post3_1|) .cse0 (= |v_main_#t~post4_3| |v_main_#t~post4_1|)) (and (or (not (<= (+ v_main_~x~0_3 1) 0)) (not (<= 1 v_main_~x~0_4))) (not .cse0) (= v_main_~y~0_3 (+ v_main_~x~0_3 v_main_~y~0_4 (* (- 1) v_main_~x~0_4))) (< v_main_~x~0_3 v_main_~x~0_4)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~y~0=v_main_~y~0_4, main_#t~post3=|v_main_#t~post3_3|, main_~x~0=v_main_~x~0_4} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~y~0=v_main_~y~0_3, main_#t~post3=|v_main_#t~post3_1|, main_~x~0=v_main_~x~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0, main_#t~post3] {257#(or (not (= main_~i~0 main_~j~0)) (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0)))} is VALID [2022-04-27 16:21:48,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} [70] L28-->L31-2: Formula: (and (<= 0 v_main_~j~0_3) (<= 0 v_main_~i~0_3) (= v_main_~i~0_3 v_main_~x~0_1) (= v_main_~j~0_3 v_main_~y~0_1)) InVars {main_~i~0=v_main_~i~0_3, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_3, main_~y~0=v_main_~y~0_1, main_~x~0=v_main_~x~0_1, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[main_~x~0, main_~y~0] {261#(or (not (= main_~i~0 main_~j~0)) (and (or (and (<= main_~y~0 0) (< 0 (+ main_~y~0 1))) (not (= main_~x~0 0))) (or (<= main_~x~0 0) (and (< main_~x~0 (+ main_~y~0 1)) (<= main_~y~0 main_~x~0)))))} is VALID [2022-04-27 16:21:48,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} [67] mainENTRY-->L28: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~j~0_5 |v_main_#t~nondet2_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (= v_main_~i~0_5 |v_main_#t~nondet1_2|)) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~j~0, main_#t~nondet2, main_~i~0] {182#true} is VALID [2022-04-27 16:21:48,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#true} [64] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} [85] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} [68] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} [65] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {182#true} is VALID [2022-04-27 16:21:48,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {182#true} [63] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {182#true} is VALID [2022-04-27 16:21:48,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:21:48,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081196952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:21:48,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:21:48,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-04-27 16:21:48,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32747871] [2022-04-27 16:21:48,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:21:48,826 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:21:48,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:21:48,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:48,851 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 16:21:48,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 16:21:48,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:21:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 16:21:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-04-27 16:21:48,853 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:49,208 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 16:21:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:21:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 16:21:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:21:49,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2022-04-27 16:21:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2022-04-27 16:21:49,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 14 transitions. [2022-04-27 16:21:49,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:21:49,229 INFO L225 Difference]: With dead ends: 13 [2022-04-27 16:21:49,229 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:21:49,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2022-04-27 16:21:49,231 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:21:49,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:21:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:21:49,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:21:49,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:21:49,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:49,232 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:49,232 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:49,232 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:21:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:49,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:49,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:49,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:21:49,233 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:21:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:21:49,233 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:21:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:49,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:49,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:21:49,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:21:49,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:21:49,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:21:49,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:21:49,234 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 16:21:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:21:49,234 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:21:49,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:21:49,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:21:49,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:21:49,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:21:49,263 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 16:21:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:21:49,465 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 16:21:49,466 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:21:49,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:21:49 BasicIcfg [2022-04-27 16:21:49,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:21:49,470 INFO L158 Benchmark]: Toolchain (without parser) took 3741.59ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 124.9MB in the beginning and 121.9MB in the end (delta: 3.0MB). Peak memory consumption was 61.8MB. Max. memory is 8.0GB. [2022-04-27 16:21:49,470 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:21:49,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.84ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 124.8MB in the beginning and 211.6MB in the end (delta: -86.8MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-04-27 16:21:49,471 INFO L158 Benchmark]: Boogie Preprocessor took 28.25ms. Allocated memory is still 234.9MB. Free memory was 211.6MB in the beginning and 209.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:21:49,472 INFO L158 Benchmark]: RCFGBuilder took 265.64ms. Allocated memory is still 234.9MB. Free memory was 209.9MB in the beginning and 197.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 16:21:49,472 INFO L158 Benchmark]: IcfgTransformer took 429.99ms. Allocated memory is still 234.9MB. Free memory was 197.9MB in the beginning and 183.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 16:21:49,472 INFO L158 Benchmark]: TraceAbstraction took 2790.17ms. Allocated memory is still 234.9MB. Free memory was 182.7MB in the beginning and 121.9MB in the end (delta: 60.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2022-04-27 16:21:49,474 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.84ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 124.8MB in the beginning and 211.6MB in the end (delta: -86.8MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.25ms. Allocated memory is still 234.9MB. Free memory was 211.6MB in the beginning and 209.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 265.64ms. Allocated memory is still 234.9MB. Free memory was 209.9MB in the beginning and 197.9MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 429.99ms. Allocated memory is still 234.9MB. Free memory was 197.9MB in the beginning and 183.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2790.17ms. Allocated memory is still 234.9MB. Free memory was 182.7MB in the beginning and 121.9MB in the end (delta: 60.8MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 40 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 353 SizeOfPredicates, 6 NumberOfNonLiveVariables, 63 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:21:49,503 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...