/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/vnew1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:50:55,882 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:50:55,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:50:55,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:50:55,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:50:55,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:50:55,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:50:55,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:50:55,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:50:55,948 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:50:55,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:50:55,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:50:55,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:50:55,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:50:55,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:50:55,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:50:55,955 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:50:55,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:50:55,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:50:55,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:50:55,964 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:50:55,965 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:50:55,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:50:55,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:50:55,968 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:50:55,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:50:55,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:50:55,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:50:55,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:50:55,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:50:55,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:50:55,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:50:55,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:50:55,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:50:55,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:50:55,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:50:55,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:50:55,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:50:55,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:50:55,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:50:55,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:50:55,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:50:55,981 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:50:55,990 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:50:55,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:50:55,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:50:55,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:50:55,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:50:55,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:50:55,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:50:55,992 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:50:55,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:50:55,993 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:50:55,993 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:50:55,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:50:55,994 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:50:55,994 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:50:55,994 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-07 17:50:56,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:50:56,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:50:56,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:50:56,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:50:56,194 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:50:56,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew1.c [2022-04-07 17:50:56,234 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac055e5b/41a152553d6548cb84a9d310e98c4cd6/FLAGba1373888 [2022-04-07 17:50:56,572 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:50:56,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c [2022-04-07 17:50:56,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac055e5b/41a152553d6548cb84a9d310e98c4cd6/FLAGba1373888 [2022-04-07 17:50:57,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ac055e5b/41a152553d6548cb84a9d310e98c4cd6 [2022-04-07 17:50:57,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:50:57,015 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:50:57,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:50:57,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:50:57,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:50:57,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375e8897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57, skipping insertion in model container [2022-04-07 17:50:57,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:50:57,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:50:57,164 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/vnew1.c[403,416] [2022-04-07 17:50:57,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:50:57,183 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:50:57,190 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/vnew1.c[403,416] [2022-04-07 17:50:57,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:50:57,200 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:50:57,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57 WrapperNode [2022-04-07 17:50:57,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:50:57,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:50:57,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:50:57,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:50:57,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:50:57,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:50:57,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:50:57,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:50:57,220 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:50:57,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:50:57,239 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-07 17:50:57,247 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-07 17:50:57,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:50:57,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:50:57,263 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:50:57,263 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 17:50:57,263 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:50:57,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:50:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 17:50:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:50:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:50:57,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:50:57,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:50:57,308 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:50:57,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:50:57,456 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:50:57,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:50:57,461 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 17:50:57,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:50:57 BoogieIcfgContainer [2022-04-07 17:50:57,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:50:57,463 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:50:57,463 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:50:57,475 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:50:57,479 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:50:57" (1/1) ... [2022-04-07 17:50:57,480 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:50:59,901 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-07 17:50:59,902 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~i~0_4 (+ v_main_~i~0_5 3)) (= (+ v_main_~k~0_6 1) v_main_~k~0_7) (< (mod v_main_~i~0_5 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~k~0=v_main_~k~0_7, main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} OutVars{main_~k~0=v_main_~k~0_6, main_~i~0=v_main_~i~0_4, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post5] to Formula: (let ((.cse1 (mod v_main_~n~0_9 4294967296)) (.cse0 (mod v_main_~i~0_5 4294967296))) (or (and (< v_main_~k~0_6 v_main_~k~0_7) (forall ((v_it_1 Int)) (or (< (mod (+ v_main_~i~0_5 (* v_it_1 3)) 4294967296) (mod v_main_~n~0_9 4294967296)) (not (<= (+ v_main_~k~0_6 v_it_1 1) v_main_~k~0_7)) (not (<= 1 v_it_1)))) (= v_main_~i~0_4 (+ (* v_main_~k~0_6 (- 3)) v_main_~i~0_5 (* v_main_~k~0_7 3))) (< .cse0 .cse1)) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~k~0_7 v_main_~k~0_6) (<= .cse1 .cse0) (= v_main_~i~0_4 v_main_~i~0_5)))) InVars {main_~i~0=v_main_~i~0_5, main_#t~post5=|v_main_#t~post5_3|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_7} OutVars{main_~i~0=v_main_~i~0_4, main_#t~post5=|v_main_#t~post5_1|, main_~n~0=v_main_~n~0_9, main_~k~0=v_main_~k~0_6} AuxVars[] AssignedVars[main_~k~0, main_~i~0, main_#t~post5] [2022-04-07 17:50:59,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:50:59 BasicIcfg [2022-04-07 17:50:59,907 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:50:59,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:50:59,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:50:59,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:50:59,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:50:57" (1/4) ... [2022-04-07 17:50:59,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1823aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:50:59, skipping insertion in model container [2022-04-07 17:50:59,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:50:57" (2/4) ... [2022-04-07 17:50:59,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1823aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:50:59, skipping insertion in model container [2022-04-07 17:50:59,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:50:57" (3/4) ... [2022-04-07 17:50:59,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1823aa55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:50:59, skipping insertion in model container [2022-04-07 17:50:59,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:50:59" (4/4) ... [2022-04-07 17:50:59,913 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew1.cJordan [2022-04-07 17:50:59,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:50:59,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:50:59,942 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:50:59,946 INFO L340 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 [2022-04-07 17:50:59,947 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:50:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 17:50:59,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:50:59,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:50:59,963 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:50:59,964 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:50:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:50:59,971 INFO L85 PathProgramCache]: Analyzing trace with hash 565582179, now seen corresponding path program 1 times [2022-04-07 17:50:59,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:50:59,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193148534] [2022-04-07 17:50:59,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:50:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:51:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:00,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-07 17:51:00,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 17:51:00,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 17:51:00,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:51:00,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {26#true} is VALID [2022-04-07 17:51:00,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 17:51:00,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 17:51:00,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26#true} is VALID [2022-04-07 17:51:00,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} [70] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {26#true} is VALID [2022-04-07 17:51:00,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} [73] L19-->L22-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {26#true} is VALID [2022-04-07 17:51:00,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} [75] L22-2-->L22-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-07 17:51:00,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} [78] L22-3-->L27-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {27#false} is VALID [2022-04-07 17:51:00,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} [81] L27-2-->L28: Formula: (< (mod v_main_~j~0_2 4294967296) (mod (div (mod v_main_~n~0_2 4294967296) 3) 4294967296)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-07 17:51:00,127 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} [83] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 (mod v_main_~k~0_8 4294967296)) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {27#false} is VALID [2022-04-07 17:51:00,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} [85] __VERIFIER_assertENTRY-->L9: 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] {27#false} is VALID [2022-04-07 17:51:00,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} [86] L9-->L10: 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[] {27#false} is VALID [2022-04-07 17:51:00,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} [88] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#false} is VALID [2022-04-07 17:51:00,128 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-07 17:51:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:00,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193148534] [2022-04-07 17:51:00,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193148534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:00,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:00,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:51:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60642555] [2022-04-07 17:51:00,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-07 17:51:00,138 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:00,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:51:00,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:00,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:51:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:00,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:51:00,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:51:00,183 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:51:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:00,242 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-07 17:51:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:51:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-07 17:51:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:51:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 17:51:00,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:51:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-04-07 17:51:00,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2022-04-07 17:51:00,302 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-07 17:51:00,309 INFO L225 Difference]: With dead ends: 23 [2022-04-07 17:51:00,309 INFO L226 Difference]: Without dead ends: 18 [2022-04-07 17:51:00,310 INFO L912 BasicCegarLoop]: 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-07 17:51:00,318 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:00,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:51:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-07 17:51:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-07 17:51:00,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:00,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,340 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,340 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:00,346 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-07 17:51:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 17:51:00,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:00,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:00,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-07 17:51:00,348 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-07 17:51:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:00,349 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-04-07 17:51:00,349 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 17:51:00,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:00,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:00,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:00,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-07 17:51:00,352 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2022-04-07 17:51:00,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:00,352 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-07 17:51:00,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-07 17:51:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-07 17:51:00,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-07 17:51:00,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:00,353 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:51:00,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:51:00,353 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1453085860, now seen corresponding path program 1 times [2022-04-07 17:51:00,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:00,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486325339] [2022-04-07 17:51:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:00,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:51:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:00,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {119#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {111#true} is VALID [2022-04-07 17:51:00,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {111#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-07 17:51:00,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-07 17:51:00,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {111#true} [66] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {119#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:51:00,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [68] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#length_1| 2) 8) (= (select |v_#valid_1| 2) 1) (= v_~SIZE~0_3 20000001) (= (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_#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{~SIZE~0=v_~SIZE~0_3, #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[~SIZE~0, #NULL.offset, #NULL.base] {111#true} is VALID [2022-04-07 17:51:00,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {111#true} [71] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-07 17:51:00,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111#true} {111#true} [91] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-07 17:51:00,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {111#true} [67] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {111#true} is VALID [2022-04-07 17:51:00,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#true} [70] mainENTRY-->L19: Formula: (= v_main_~n~0_3 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_3, main_~k~0=v_main_~k~0_4} AuxVars[] AssignedVars[main_#t~nondet4, main_~k~0, main_~i~0, main_~n~0] {111#true} is VALID [2022-04-07 17:51:00,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#true} [73] L19-->L22-2: Formula: (and (= v_main_~i~0_2 0) (<= (mod v_main_~n~0_7 4294967296) (mod v_~SIZE~0_2 4294967296)) (= v_main_~k~0_5 v_main_~n~0_7)) InVars {~SIZE~0=v_~SIZE~0_2, main_~n~0=v_main_~n~0_7} OutVars{~SIZE~0=v_~SIZE~0_2, main_~i~0=v_main_~i~0_2, main_~n~0=v_main_~n~0_7, main_~k~0=v_main_~k~0_5} AuxVars[] AssignedVars[main_~k~0, main_~i~0] {116#(= main_~i~0 0)} is VALID [2022-04-07 17:51:00,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {116#(= main_~i~0 0)} [76] L22-2-->L22-3: Formula: (not (< (mod v_main_~i~0_3 4294967296) (mod v_main_~n~0_8 4294967296))) InVars {main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} OutVars{main_~i~0=v_main_~i~0_3, main_~n~0=v_main_~n~0_8} AuxVars[] AssignedVars[] {117#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-07 17:51:00,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {117#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} [78] L22-3-->L27-2: Formula: (= v_main_~j~0_5 0) InVars {} OutVars{main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_~j~0] {118#(and (<= (+ (* (div main_~j~0 4294967296) 12884901888) main_~n~0) (+ (* (div main_~n~0 4294967296) 4294967296) (* (div (div (+ main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) 3) 4294967296) 12884901888))) (= main_~j~0 0))} is VALID [2022-04-07 17:51:00,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {118#(and (<= (+ (* (div main_~j~0 4294967296) 12884901888) main_~n~0) (+ (* (div main_~n~0 4294967296) 4294967296) (* (div (div (+ main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) 3) 4294967296) 12884901888))) (= main_~j~0 0))} [81] L27-2-->L28: Formula: (< (mod v_main_~j~0_2 4294967296) (mod (div (mod v_main_~n~0_2 4294967296) 3) 4294967296)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {112#false} is VALID [2022-04-07 17:51:00,529 INFO L272 TraceCheckUtils]: 10: Hoare triple {112#false} [83] L28-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< 0 (mod v_main_~k~0_8 4294967296)) 1 0)) InVars {main_~k~0=v_main_~k~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0] {112#false} is VALID [2022-04-07 17:51:00,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {112#false} [85] __VERIFIER_assertENTRY-->L9: 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] {112#false} is VALID [2022-04-07 17:51:00,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {112#false} [86] L9-->L10: 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[] {112#false} is VALID [2022-04-07 17:51:00,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {112#false} [88] L10-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {112#false} is VALID [2022-04-07 17:51:00,530 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-07 17:51:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:00,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486325339] [2022-04-07 17:51:00,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486325339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:51:00,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:51:00,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 17:51:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843034227] [2022-04-07 17:51:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:51:00,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-07 17:51:00,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:51:00,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:51:00,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:00,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:51:00,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:51:00,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:51:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 17:51:00,545 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:51:00,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:00,654 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-07 17:51:00,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:51:00,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-07 17:51:00,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:51:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:51:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-07 17:51:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:51:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-04-07 17:51:00,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-04-07 17:51:00,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:51:00,677 INFO L225 Difference]: With dead ends: 21 [2022-04-07 17:51:00,677 INFO L226 Difference]: Without dead ends: 19 [2022-04-07 17:51:00,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-07 17:51:00,678 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:51:00,679 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 27 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-04-07 17:51:00,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-07 17:51:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-07 17:51:00,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:51:00,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,681 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,681 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:00,682 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-07 17:51:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-07 17:51:00,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:00,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:00,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 17:51:00,683 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-07 17:51:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:51:00,684 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-07 17:51:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-07 17:51:00,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:51:00,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:51:00,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:51:00,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:51:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 17:51:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-07 17:51:00,686 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-07 17:51:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:51:00,686 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-07 17:51:00,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 17:51:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-07 17:51:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-07 17:51:00,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:51:00,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:51:00,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:51:00,687 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:51:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:51:00,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1975996661, now seen corresponding path program 1 times [2022-04-07 17:51:00,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:51:00,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425280969] [2022-04-07 17:51:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:51:00,700 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_1.0) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_1.0)) 4294967296))) 0)) [2022-04-07 17:51:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:51:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:51:00,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425280969] [2022-04-07 17:51:00,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Interpolation not supported for quantified formulae. [2022-04-07 17:51:00,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776297560] [2022-04-07 17:51:00,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:51:00,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:51:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:51:00,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 17:51:00,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process