/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/loops-crafted-1/nested3-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:53:53,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:53:53,132 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:53:53,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:53:53,167 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:53:53,170 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:53:53,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:53:53,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:53:53,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:53:53,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:53:53,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:53:53,176 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:53:53,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:53:53,177 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:53:53,178 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:53:53,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:53:53,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:53:53,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:53:53,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:53:53,183 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:53:53,185 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:53:53,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:53:53,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:53:53,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:53:53,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:53:53,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:53:53,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:53:53,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:53:53,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:53:53,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:53:53,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:53:53,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:53:53,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:53:53,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:53:53,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:53:53,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:53:53,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:53:53,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:53:53,197 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:53:53,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:53:53,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:53:53,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:53:53,202 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:53:53,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:53:53,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:53:53,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:53:53,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:53:53,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:53:53,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:53:53,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:53:53,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:53:53,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:53:53,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:53:53,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:53:53,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:53:53,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:53:53,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:53:53,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:53:53,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:53:53,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:53:53,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:53:53,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:53:53,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:53:53,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:53:53,214 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:53:53,214 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:53:53,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:53:53,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:53:53,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:53:53,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:53:53,445 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:53:53,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-27 16:53:53,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b614b9a8d/dce05ad796fa43c3919ba85e87bb091f/FLAGd91b415f3 [2022-04-27 16:53:53,916 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:53:53,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c [2022-04-27 16:53:53,930 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b614b9a8d/dce05ad796fa43c3919ba85e87bb091f/FLAGd91b415f3 [2022-04-27 16:53:53,950 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b614b9a8d/dce05ad796fa43c3919ba85e87bb091f [2022-04-27 16:53:53,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:53:53,956 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:53:53,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:53:53,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:53:53,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:53:53,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:53:53" (1/1) ... [2022-04-27 16:53:53,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770ea887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:53, skipping insertion in model container [2022-04-27 16:53:53,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:53:53" (1/1) ... [2022-04-27 16:53:53,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:53:53,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:53:54,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c[321,334] [2022-04-27 16:53:54,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:53:54,212 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:53:54,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested3-2.c[321,334] [2022-04-27 16:53:54,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:53:54,254 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:53:54,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54 WrapperNode [2022-04-27 16:53:54,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:53:54,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:53:54,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:53:54,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:53:54,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:53:54,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:53:54,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:53:54,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:53:54,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:53:54,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:53:54,337 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:53:54,360 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:53:54,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:53:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:53:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:53:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:53:54,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:53:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:53:54,375 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:53:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:53:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:53:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:53:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:53:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:53:54,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:53:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:53:54,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:53:54,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:53:54,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:53:54,437 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:53:54,439 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:53:54,626 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:53:54,631 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:53:54,631 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-27 16:53:54,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:53:54 BoogieIcfgContainer [2022-04-27 16:53:54,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:53:54,633 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:53:54,633 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:53:54,634 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:53:54,637 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:53:54" (1/1) ... [2022-04-27 16:53:54,639 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:53:56,580 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-27 16:53:56,581 INFO L91 elerationTransformer]: Accelerated Formula: (and (< (mod v_main_~z~0_3 4294967296) 268435455) (= (+ v_main_~z~0_3 1) v_main_~z~0_2)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] to Formula: (let ((.cse0 (mod v_main_~z~0_3 4294967296))) (or (and (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post4_3| |v_main_#t~post4_1|) (<= 268435455 .cse0)) (and (<= (div (+ (* (- 1) v_main_~z~0_2) 268435455) (- 4294967296)) (+ (div (+ v_main_~z~0_3 (- 4294967295)) 4294967296) 1)) (< .cse0 268435455) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_#t~post4=|v_main_#t~post4_3|, main_~z~0=v_main_~z~0_3} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~z~0, main_#t~post4] [2022-04-27 16:53:56,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:53:56 BasicIcfg [2022-04-27 16:53:56,587 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:53:56,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:53:56,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:53:56,592 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:53:56,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:53:53" (1/4) ... [2022-04-27 16:53:56,593 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c941e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:53:56, skipping insertion in model container [2022-04-27 16:53:56,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:53:54" (2/4) ... [2022-04-27 16:53:56,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c941e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:53:56, skipping insertion in model container [2022-04-27 16:53:56,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:53:54" (3/4) ... [2022-04-27 16:53:56,596 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c941e45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:53:56, skipping insertion in model container [2022-04-27 16:53:56,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:53:56" (4/4) ... [2022-04-27 16:53:56,597 INFO L111 eAbstractionObserver]: Analyzing ICFG nested3-2.cJordan [2022-04-27 16:53:56,611 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:53:56,612 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:53:56,660 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:53:56,667 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@2c2f37f6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14a57ca6 [2022-04-27 16:53:56,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:53:56,675 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 16:53:56,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:53:56,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:53:56,681 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:53:56,681 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:53:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:53:56,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1301415802, now seen corresponding path program 1 times [2022-04-27 16:53:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:53:56,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357719428] [2022-04-27 16:53:56,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:53:56,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:53:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:56,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:53:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:56,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {28#true} is VALID [2022-04-27 16:53:56,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 16:53:56,891 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 16:53:56,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:53:56,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {28#true} is VALID [2022-04-27 16:53:56,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 16:53:56,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 16:53:56,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-27 16:53:56,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [76] mainENTRY-->L19-2: Formula: (and (= v_main_~w~0_1 0) (= v_main_~x~0_1 0) (= v_main_~z~0_5 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~w~0, main_~x~0, main_~z~0, main_~y~0] {28#true} is VALID [2022-04-27 16:53:56,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [78] L19-2-->L19-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 16:53:56,897 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} [81] L19-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_7 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {29#false} is VALID [2022-04-27 16:53:56,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} [86] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-27 16:53:56,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} [92] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 16:53:56,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [96] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-27 16:53:56,899 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:53:56,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:53:56,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357719428] [2022-04-27 16:53:56,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357719428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:53:56,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:53:56,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:53:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624809310] [2022-04-27 16:53:56,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:53:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 16:53:56,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:53:56,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:53:56,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:56,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:53:56,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:53:56,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:53:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:53:56,962 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:53:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,044 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 16:53:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:53:57,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 16:53:57,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:53:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:53:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-27 16:53:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:53:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-27 16:53:57,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-27 16:53:57,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:57,114 INFO L225 Difference]: With dead ends: 25 [2022-04-27 16:53:57,115 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 16:53:57,123 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:53:57,129 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:53:57,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:53:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 16:53:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-27 16:53:57,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:53:57,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,155 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,155 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,158 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-27 16:53:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 16:53:57,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 16:53:57,159 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-04-27 16:53:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,162 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-27 16:53:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 16:53:57,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:53:57,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:53:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-27 16:53:57,170 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 11 [2022-04-27 16:53:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:53:57,171 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-27 16:53:57,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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:53:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-27 16:53:57,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 16:53:57,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:53:57,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:53:57,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:53:57,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:53:57,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:53:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1302339323, now seen corresponding path program 1 times [2022-04-27 16:53:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:53:57,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289403447] [2022-04-27 16:53:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:53:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:53:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:53:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:57,257 INFO L290 TraceCheckUtils]: 0: Hoare triple {127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {121#true} is VALID [2022-04-27 16:53:57,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-27 16:53:57,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-27 16:53:57,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {121#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:53:57,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {127#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {121#true} is VALID [2022-04-27 16:53:57,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {121#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-27 16:53:57,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121#true} {121#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-27 16:53:57,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {121#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#true} is VALID [2022-04-27 16:53:57,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {121#true} [76] mainENTRY-->L19-2: Formula: (and (= v_main_~w~0_1 0) (= v_main_~x~0_1 0) (= v_main_~z~0_5 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~w~0, main_~x~0, main_~z~0, main_~y~0] {126#(= main_~x~0 0)} is VALID [2022-04-27 16:53:57,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#(= main_~x~0 0)} [79] L19-2-->L19-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {122#false} is VALID [2022-04-27 16:53:57,264 INFO L272 TraceCheckUtils]: 7: Hoare triple {122#false} [81] L19-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~x~0_7 2) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~x~0=v_main_~x~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {122#false} is VALID [2022-04-27 16:53:57,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {122#false} [86] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {122#false} is VALID [2022-04-27 16:53:57,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {122#false} [92] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {122#false} is VALID [2022-04-27 16:53:57,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {122#false} [96] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {122#false} is VALID [2022-04-27 16:53:57,265 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:53:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:53:57,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289403447] [2022-04-27 16:53:57,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289403447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:53:57,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:53:57,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:53:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711349392] [2022-04-27 16:53:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:53:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 16:53:57,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:53:57,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:53:57,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:57,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:53:57,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:53:57,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:53:57,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:53:57,283 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:53:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,414 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 16:53:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:53:57,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 16:53:57,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:53:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:53:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-27 16:53:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:53:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-04-27 16:53:57,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-04-27 16:53:57,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:57,457 INFO L225 Difference]: With dead ends: 27 [2022-04-27 16:53:57,457 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 16:53:57,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:53:57,459 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:53:57,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:53:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 16:53:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-04-27 16:53:57,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:53:57,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,463 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,463 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,466 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 16:53:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-27 16:53:57,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 16:53:57,467 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-27 16:53:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,469 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-27 16:53:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-27 16:53:57,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:53:57,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:53:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-27 16:53:57,472 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2022-04-27 16:53:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:53:57,473 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-27 16:53:57,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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:53:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-27 16:53:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 16:53:57,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:53:57,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:53:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:53:57,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:53:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:53:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1748313539, now seen corresponding path program 1 times [2022-04-27 16:53:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:53:57,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656584395] [2022-04-27 16:53:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:53:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:53:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:53:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:57,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {234#true} is VALID [2022-04-27 16:53:57,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-27 16:53:57,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-27 16:53:57,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:53:57,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {234#true} is VALID [2022-04-27 16:53:57,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-27 16:53:57,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-27 16:53:57,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#true} is VALID [2022-04-27 16:53:57,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} [76] mainENTRY-->L19-2: Formula: (and (= v_main_~w~0_1 0) (= v_main_~x~0_1 0) (= v_main_~z~0_5 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~w~0, main_~x~0, main_~z~0, main_~y~0] {234#true} is VALID [2022-04-27 16:53:57,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {234#true} [80] L19-2-->L22-2: Formula: (and (< (mod v_main_~x~0_5 4294967296) 268435455) (= v_main_~y~0_5 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~y~0] {239#(= main_~y~0 0)} is VALID [2022-04-27 16:53:57,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {239#(= main_~y~0 0)} [83] L22-2-->L22-3: Formula: (not (< (mod v_main_~y~0_6 4294967296) 268435455)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-27 16:53:57,534 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} [87] L22-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod v_main_~y~0_8 2) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~y~0] {235#false} is VALID [2022-04-27 16:53:57,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} [86] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {235#false} is VALID [2022-04-27 16:53:57,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} [92] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-27 16:53:57,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} [96] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {235#false} is VALID [2022-04-27 16:53:57,535 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:53:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:53:57,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656584395] [2022-04-27 16:53:57,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656584395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:53:57,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:53:57,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:53:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326647206] [2022-04-27 16:53:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:53:57,536 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:53:57,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:53:57,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:53:57,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:57,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:53:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:53:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:53:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:53:57,547 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:53:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,633 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 16:53:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:53:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 16:53:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:53:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:53:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 16:53:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:53:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-04-27 16:53:57,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-04-27 16:53:57,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:57,669 INFO L225 Difference]: With dead ends: 25 [2022-04-27 16:53:57,669 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 16:53:57,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:53:57,671 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:53:57,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:53:57,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 16:53:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-04-27 16:53:57,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:53:57,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,674 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,674 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,676 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 16:53:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 16:53:57,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 16:53:57,678 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-27 16:53:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,679 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-04-27 16:53:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-04-27 16:53:57,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:53:57,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:53:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-27 16:53:57,682 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2022-04-27 16:53:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:53:57,682 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-27 16:53:57,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:53:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-27 16:53:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:53:57,683 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:53:57,683 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:53:57,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:53:57,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:53:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:53:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1606116621, now seen corresponding path program 1 times [2022-04-27 16:53:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:53:57,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592471098] [2022-04-27 16:53:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:53:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:53:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:57,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:53:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:53:57,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {343#true} is VALID [2022-04-27 16:53:57,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-27 16:53:57,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {343#true} {343#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-27 16:53:57,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {343#true} [72] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:53:57,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [74] 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) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (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] {343#true} is VALID [2022-04-27 16:53:57,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#true} [77] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-27 16:53:57,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} [100] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-27 16:53:57,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {343#true} [73] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {343#true} is VALID [2022-04-27 16:53:57,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {343#true} [76] mainENTRY-->L19-2: Formula: (and (= v_main_~w~0_1 0) (= v_main_~x~0_1 0) (= v_main_~z~0_5 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~w~0=v_main_~w~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~w~0, main_~x~0, main_~z~0, main_~y~0] {343#true} is VALID [2022-04-27 16:53:57,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {343#true} [80] L19-2-->L22-2: Formula: (and (< (mod v_main_~x~0_5 4294967296) 268435455) (= v_main_~y~0_5 0)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} AuxVars[] AssignedVars[main_~y~0] {343#true} is VALID [2022-04-27 16:53:57,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {343#true} [84] L22-2-->L24-2: Formula: (and (< (mod v_main_~y~0_7 4294967296) 268435455) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_7} OutVars{main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {348#(= main_~z~0 0)} is VALID [2022-04-27 16:53:57,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(= main_~z~0 0)} [89] L24-2-->L24-3: Formula: (not (< (mod v_main_~z~0_1 4294967296) 268435455)) InVars {main_~z~0=v_main_~z~0_1} OutVars{main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[] {344#false} is VALID [2022-04-27 16:53:57,738 INFO L272 TraceCheckUtils]: 9: Hoare triple {344#false} [95] L24-3-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~z~0_7 4) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0] {344#false} is VALID [2022-04-27 16:53:57,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#false} [86] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {344#false} is VALID [2022-04-27 16:53:57,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#false} [92] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {344#false} is VALID [2022-04-27 16:53:57,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {344#false} [96] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {344#false} is VALID [2022-04-27 16:53:57,738 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:53:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:53:57,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592471098] [2022-04-27 16:53:57,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592471098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:53:57,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:53:57,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:53:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155227619] [2022-04-27 16:53:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:53:57,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:53:57,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,750 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:53:57,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:53:57,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:53:57,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:53:57,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:53:57,752 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,826 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 16:53:57,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:53:57,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:53:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 16:53:57,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-27 16:53:57,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-27 16:53:57,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:53:57,858 INFO L225 Difference]: With dead ends: 24 [2022-04-27 16:53:57,858 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 16:53:57,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:53:57,859 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:53:57,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 28 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:53:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 16:53:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-27 16:53:57,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:53:57,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,863 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,863 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,868 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 16:53:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 16:53:57,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-27 16:53:57,871 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 24 states. [2022-04-27 16:53:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:53:57,877 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 16:53:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 16:53:57,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:53:57,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:53:57,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:53:57,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:53:57,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:53:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-27 16:53:57,880 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2022-04-27 16:53:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:53:57,880 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-27 16:53:57,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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:53:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 16:53:57,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:53:57,881 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:53:57,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:53:57,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 16:53:57,882 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:53:57,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:53:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1773342651, now seen corresponding path program 1 times [2022-04-27 16:53:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:53:57,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879135661] [2022-04-27 16:53:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:53:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:53:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 16:53:57,925 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 16:53:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 16:53:57,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 16:53:57,955 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 16:53:57,956 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:53:57,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 16:53:57,959 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 16:53:57,962 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:53:57,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:53:57 BasicIcfg [2022-04-27 16:53:57,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:53:57,984 INFO L158 Benchmark]: Toolchain (without parser) took 4027.54ms. Allocated memory is still 175.1MB. Free memory was 123.4MB in the beginning and 66.8MB in the end (delta: 56.6MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB. [2022-04-27 16:53:57,985 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 175.1MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:53:57,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.86ms. Allocated memory is still 175.1MB. Free memory was 123.2MB in the beginning and 150.4MB in the end (delta: -27.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:53:57,985 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 175.1MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:53:57,987 INFO L158 Benchmark]: RCFGBuilder took 331.12ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 137.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 16:53:57,987 INFO L158 Benchmark]: IcfgTransformer took 1953.34ms. Allocated memory is still 175.1MB. Free memory was 137.8MB in the beginning and 111.0MB in the end (delta: 26.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-04-27 16:53:57,987 INFO L158 Benchmark]: TraceAbstraction took 1394.02ms. Allocated memory is still 175.1MB. Free memory was 110.4MB in the beginning and 66.8MB in the end (delta: 43.6MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. [2022-04-27 16:53:57,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {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.12ms. Allocated memory is still 175.1MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 290.86ms. Allocated memory is still 175.1MB. Free memory was 123.2MB in the beginning and 150.4MB in the end (delta: -27.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 175.1MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.12ms. Allocated memory is still 175.1MB. Free memory was 148.8MB in the beginning and 137.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 1953.34ms. Allocated memory is still 175.1MB. Free memory was 137.8MB in the beginning and 111.0MB in the end (delta: 26.8MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 1394.02ms. Allocated memory is still 175.1MB. Free memory was 110.4MB in the beginning and 66.8MB in the end (delta: 43.6MB). Peak memory consumption was 43.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] unsigned int x = 0; [L15] unsigned int y = 0; [L16] unsigned int z = 0; [L17] unsigned int w = 0; VAL [w=0, x=0, y=0, z=0] [L19] COND TRUE x < 0x0fffffff [L20] y = 0 VAL [w=0, x=0, y=0, z=0] [L22] COND TRUE y < 0x0fffffff [L23] z =0 VAL [w=0, x=0, y=0, z=0] [L24] COND TRUE z <0x0fffffff [L25] z++ VAL [w=0, x=0, y=0, z=268435455, z++=268435458] [L24] COND FALSE !(z <0x0fffffff) VAL [w=0, x=0, y=0, z=268435455, z++=268435458] [L27] CALL __VERIFIER_assert(!(z % 4)) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 74 IncrementalHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 88 mSDtfsCounter, 74 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 61 NumberOfCodeBlocks, 61 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-27 16:53:58,009 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...